{"meta":{"query_hash":"81f72d4dcd75","filters":{"venue":"EPiC series in computing"},"cohort_total":45,"direct_labels_cover":3,"predictions_cover":45,"exported":45,"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/81f72d4dcd75","api":"https://metacan.xera.ac/api/v1/cohort?venue=EPiC+series+in+computing"},"results":[{"id":"W2100320630","doi":"10.29007/8xbv","title":"Beagle as a HOL4 external ATP method","year":2018,"lang":"en","type":"article","venue":"EPiC series in computing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","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":"Australian Research Council; Austrian Science Fund; Australian Government","keywords":"Beagle; Computer science; NIST; Theoretical computer science; Algorithm; Speech recognition","score_opus":0.020750352089263596,"score_gpt":0.3285817336613172,"score_spread":0.3078313815720536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100320630","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022183262,0.00011215644,0.96393186,0.00060693355,0.0006724193,0.00011200379,2.1010554e-7,0.000734942,0.011646189],"genre_scores_gemma":[0.36158252,0.0000053322365,0.63713145,0.00068888505,0.00026910502,0.0000025619947,5.009849e-7,0.000009802472,0.0003098417],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998249,0.00019752239,0.0003942061,0.0005082682,0.00024158735,0.00040941656],"domain_scores_gemma":[0.9988731,0.00022397091,0.00015374496,0.0005552901,0.00011763324,0.00007624378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009417741,0.00017706475,0.00023458156,0.00018705091,0.0002581355,0.00021172829,0.0010846729,0.00008238565,0.000041950974],"category_scores_gemma":[0.00019118203,0.00018264103,0.00005868741,0.00065266085,0.0000997358,0.00038390304,0.0007468494,0.0002128612,0.00008926322],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006210321,0.00024100074,0.01134093,0.00005964229,0.000048007983,0.00020925429,0.022890653,0.026330395,0.0011871043,0.25520694,0.0036032286,0.6788207],"study_design_scores_gemma":[0.00041801936,0.00035894642,0.0033756848,0.00019016204,0.0000030551294,0.00024836755,0.000064810134,0.9366058,0.013900538,0.03289667,0.011480776,0.00045718095],"about_ca_topic_score_codex":0.00008343315,"about_ca_topic_score_gemma":0.0000052622067,"teacher_disagreement_score":0.9102754,"about_ca_system_score_codex":0.000057994148,"about_ca_system_score_gemma":0.000070441594,"threshold_uncertainty_score":0.7447885},"labels":[],"label_agreement":null},{"id":"W2131254610","doi":"10.29007/jqtz","title":"Translating Higher-Order Specifications to Coq Libraries Supporting Hybrid Proofs","year":2018,"lang":"en","type":"article","venue":"EPiC series in computing","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":"University of Ottawa","funders":"","keywords":"Computer science; Programming language; Specification language; Syntax; Mathematical proof; Proof assistant; Programming language specification; Formal specification; Object language; Formal methods; Abstract syntax; Language Of Temporal Ordering Specification; Artificial intelligence; Programming paradigm; Natural language; Semantics (computer science); Inductive programming; Programming domain","score_opus":0.05207422924053338,"score_gpt":0.28358559903730546,"score_spread":0.2315113697967721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131254610","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025931526,0.00016730044,0.9370088,0.0038345638,0.002341778,0.0005344434,7.550308e-7,0.00063777383,0.02954305],"genre_scores_gemma":[0.8622633,6.718624e-7,0.13616876,0.00027135853,0.0007543167,0.000014356777,0.0000036148595,0.00001750656,0.0005060896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978121,0.000115246956,0.0006325312,0.00057922787,0.00025337614,0.0006075548],"domain_scores_gemma":[0.99882114,0.0001588751,0.00020403511,0.0005661047,0.00013724968,0.00011262318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070954696,0.00020141085,0.0002717976,0.00015105815,0.00044883823,0.00048568996,0.0008824596,0.0000551115,0.000058933736],"category_scores_gemma":[0.00016693553,0.00019654197,0.000051065537,0.0009523007,0.00014383077,0.000674389,0.00034734994,0.00018621296,0.000098299024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009829217,0.00006651072,0.016185436,0.000065648994,0.000020769872,0.000041946783,0.017036034,0.00020054287,0.00027190434,0.7370001,0.00076922594,0.22833204],"study_design_scores_gemma":[0.002150743,0.001706278,0.050183766,0.00030919505,0.00002935233,0.00041861765,0.00406218,0.11253388,0.023042396,0.24716452,0.55513406,0.003265027],"about_ca_topic_score_codex":0.000059053134,"about_ca_topic_score_gemma":0.000050966588,"teacher_disagreement_score":0.8363318,"about_ca_system_score_codex":0.000047102156,"about_ca_system_score_gemma":0.000114164584,"threshold_uncertainty_score":0.80147487},"labels":[],"label_agreement":null},{"id":"W2395908759","doi":"10.29007/zd7s","title":"Meaning Formulas for Syntax-Based Mathematical Algorithms","year":2018,"lang":"en","type":"article","venue":"EPiC series in computing","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; McMaster University","keywords":"Meaning (existential); Statement (logic); Computer science; Syntax; Algorithm; Mathematical induction; Theoretical computer science; Mathematical logic; Mathematics; Artificial intelligence; Linguistics; Epistemology","score_opus":0.035962834764284114,"score_gpt":0.2909447288713724,"score_spread":0.25498189410708827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395908759","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037413766,0.000036938003,0.9883821,0.00024576345,0.0009969488,0.00032505824,2.5653708e-7,0.0002526136,0.0060189245],"genre_scores_gemma":[0.7213571,1.9640802e-7,0.27802065,0.00013367426,0.00037988447,0.0000143365105,0.0000012198111,0.000010788553,0.0000821258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985068,0.000057935016,0.0003865954,0.00038000027,0.00020191984,0.0004667404],"domain_scores_gemma":[0.9989181,0.00038465284,0.00012963689,0.00040141057,0.0001024254,0.00006374224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009067969,0.00015643566,0.00025716732,0.00009336279,0.0002534668,0.00019405209,0.00063650194,0.00007785561,0.000012580251],"category_scores_gemma":[0.00024353208,0.00013843925,0.00007519444,0.00030019775,0.000100777484,0.00025278988,0.00021239815,0.000103252576,0.000039359118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009423499,0.00005278287,0.00082296086,0.00012395039,0.00001356393,0.000013204555,0.0029486818,0.00012359858,0.00004224562,0.9107034,0.00014873492,0.08499742],"study_design_scores_gemma":[0.00056645006,0.0003640022,0.00015045857,0.000053399275,0.000004556609,0.0000444487,0.0002081095,0.77171415,0.0027990509,0.21721882,0.0065941284,0.00028241845],"about_ca_topic_score_codex":0.000019421946,"about_ca_topic_score_gemma":0.00001918808,"teacher_disagreement_score":0.77159053,"about_ca_system_score_codex":0.000059772115,"about_ca_system_score_gemma":0.00005785377,"threshold_uncertainty_score":0.5645389},"labels":[],"label_agreement":null},{"id":"W2397007421","doi":"10.29007/44jw","title":"The Turing O-Machine and the DIME Network Architecture: Injecting the Architectural Resiliency into Distributed Computing","year":2018,"lang":"en","type":"article","venue":"EPiC series in computing","topic":"Computability, Logic, AI Algorithms","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":"Object Research Systems (Canada)","funders":"","keywords":"Computer science; Turing machine; Oracle; Distributed computing; Virtual machine; Theoretical computer science; Operating system; Programming language; Computation","score_opus":0.006140681895732632,"score_gpt":0.2380729585410363,"score_spread":0.23193227664530366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397007421","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32939535,0.0020252045,0.6534512,0.011189792,0.0022639981,0.00075685437,0.0000011430672,0.00038019478,0.0005362538],"genre_scores_gemma":[0.9566902,0.00001086881,0.041228715,0.00045900978,0.0015635035,0.000008959484,0.0000020337702,0.000023923043,0.000012816985],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948739,0.0014979223,0.0009246443,0.0009149192,0.0006405427,0.0011480942],"domain_scores_gemma":[0.9895201,0.008377553,0.00040778087,0.0014111948,0.00018111472,0.00010227863],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0066944677,0.0004532666,0.00047965487,0.00007976405,0.004269489,0.00097011233,0.0029471614,0.0000891049,0.0000027402723],"category_scores_gemma":[0.0021778585,0.00023583928,0.00014254323,0.0015297788,0.0021131341,0.00021315752,0.0049760346,0.001238394,0.000003972739],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015569385,0.00003413095,0.014745246,0.00004663045,0.00007730083,0.000021480577,0.036550984,0.10090272,0.00001678014,0.035483845,0.00011700526,0.81184816],"study_design_scores_gemma":[0.00084294524,0.00015767243,0.03331548,0.0001295893,0.000011506084,0.00034658765,0.00058428483,0.86665344,0.00007451025,0.09585916,0.0016284424,0.00039635773],"about_ca_topic_score_codex":0.00057803304,"about_ca_topic_score_gemma":0.001145437,"teacher_disagreement_score":0.81145185,"about_ca_system_score_codex":0.00016513876,"about_ca_system_score_gemma":0.00009786579,"threshold_uncertainty_score":0.9970268},"labels":[],"label_agreement":null},{"id":"W2397288865","doi":"10.29007/28ww","title":"Boosting the Performance of SLS and CDCL Solvers by Preprocessor Tuning","year":2018,"lang":"en","type":"article","venue":"EPiC series in computing","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":"Artificial Intelligence in Medicine (Canada)","funders":"Deutsche Forschungsgemeinschaft","keywords":"Preprocessor; Solver; Computer science; Boosting (machine learning); Data pre-processing; Algorithm; Artificial intelligence; Programming language","score_opus":0.0180842090583107,"score_gpt":0.27646896351676065,"score_spread":0.25838475445844994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397288865","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.79997516,0.00013208807,0.1978222,0.00013806338,0.00029870967,0.00009361086,2.436429e-7,0.0000553141,0.0014846048],"genre_scores_gemma":[0.74822944,0.000009339074,0.251598,0.000074302836,0.000053494885,0.0000019661838,2.4474159e-7,0.000004459071,0.000028778866],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989859,0.00009254442,0.0002943292,0.00025597244,0.00015318424,0.00021807208],"domain_scores_gemma":[0.9991118,0.0002295398,0.0002004623,0.00036231818,0.00007329218,0.00002263668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014033265,0.0000909939,0.00012483548,0.00004741632,0.000253915,0.000062998355,0.0005978823,0.000036563833,0.0000028218044],"category_scores_gemma":[0.00035772286,0.000075300486,0.00001361015,0.00037381775,0.00026452533,0.00054448633,0.00042122346,0.00013604488,0.0000018536349],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067909925,0.00006110483,0.12830915,0.00046183998,0.00003542161,0.000002719092,0.060525842,0.0019224943,0.022260888,0.03984707,0.00040985807,0.7460957],"study_design_scores_gemma":[0.00016926808,0.00017223675,0.015122205,0.00017675241,0.0000024796452,0.000026704673,0.0005180171,0.9229252,0.059412517,0.00045818972,0.00086603954,0.00015039554],"about_ca_topic_score_codex":0.000019275116,"about_ca_topic_score_gemma":0.0000019837132,"teacher_disagreement_score":0.9210027,"about_ca_system_score_codex":0.000022859394,"about_ca_system_score_gemma":0.000027215132,"threshold_uncertainty_score":0.30706647},"labels":[],"label_agreement":null},{"id":"W2398036300","doi":"10.29007/fblb","title":"CDCL with Less Destructive Backtracking through Partial Ordering","year":2018,"lang":"en","type":"article","venue":"EPiC series in computing","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Backtracking; Satisfiability; Boolean satisfiability problem; Solver; Relation (database); Computer science; Series (stratigraphy); Algorithm; Theoretical computer science; Combinatorics; Mathematics; Programming language; Data mining","score_opus":0.02310364717064647,"score_gpt":0.26435545493342355,"score_spread":0.24125180776277708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398036300","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2704308,0.000010419855,0.7248498,0.0002528772,0.0005320736,0.000079958634,1.8162847e-7,0.00014436292,0.003699499],"genre_scores_gemma":[0.7526261,0.0000022926424,0.24707714,0.000112667476,0.0001600353,0.0000016754517,6.524458e-7,0.0000070655833,0.000012346766],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989469,0.000059679227,0.00022359389,0.00034038283,0.00015420416,0.00027524453],"domain_scores_gemma":[0.99944395,0.00008589712,0.0001032265,0.0002434358,0.00009070664,0.00003277265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017145877,0.00012580125,0.00014013231,0.00006228703,0.00025066244,0.00016024547,0.00026658826,0.000043120097,0.000034004024],"category_scores_gemma":[0.000044830813,0.00012147172,0.00001914269,0.00050596864,0.00017447324,0.0008490403,0.00017369521,0.0001407006,0.000009218137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064240536,0.000044737353,0.12252304,0.000036490568,0.00004146603,0.000068269896,0.024439063,0.036330964,0.00024012766,0.13368367,0.000038741084,0.6824892],"study_design_scores_gemma":[0.0019414359,0.0005128704,0.1308771,0.00051253015,0.000012212811,0.0006064584,0.0044252183,0.835173,0.012553552,0.009197466,0.003061419,0.001126701],"about_ca_topic_score_codex":0.00006315216,"about_ca_topic_score_gemma":0.00019762246,"teacher_disagreement_score":0.7988421,"about_ca_system_score_codex":0.00005776392,"about_ca_system_score_gemma":0.00006565299,"threshold_uncertainty_score":0.4953473},"labels":[],"label_agreement":null},{"id":"W2398674600","doi":"10.29007/5dmr","title":"Strong 0-dimensionality in Pointfree Topology","year":2018,"lang":"en","type":"article","venue":"EPiC series in computing","topic":"Computability, Logic, AI Algorithms","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":"Curse of dimensionality; Computer science; Topology (electrical circuits); Artificial intelligence; Theoretical computer science; Mathematics","score_opus":0.02401188408444463,"score_gpt":0.29466258069680806,"score_spread":0.2706506966123634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398674600","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.7508739,0.00011249155,0.23887989,0.0023347691,0.002454714,0.00023509444,8.404977e-7,0.00025254424,0.0048557636],"genre_scores_gemma":[0.8564708,0.0000011812966,0.14275675,0.00039793813,0.00032210734,0.0000032594367,0.0000012245204,0.000008484571,0.00003823679],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973192,0.00036552956,0.0006130486,0.0007800124,0.00027305784,0.00064910966],"domain_scores_gemma":[0.9982608,0.0005643228,0.00012521156,0.00085968734,0.00011134406,0.00007866681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014603396,0.00021624973,0.00036794273,0.00021593623,0.0001490905,0.00008257169,0.0011660381,0.0001127547,0.00008245775],"category_scores_gemma":[0.0003709184,0.00022628145,0.000058467016,0.0008538972,0.00037381545,0.0003939653,0.001814847,0.00034645657,0.000042061],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005497448,0.0004810169,0.31879014,0.00006613578,0.000026604974,0.00029068236,0.00812696,0.005044269,0.00023974458,0.44660875,0.0005014436,0.2197693],"study_design_scores_gemma":[0.0009477698,0.00040548228,0.42021945,0.00008281604,0.0000021169158,0.00016127533,0.00029106514,0.45037082,0.00087666145,0.124643765,0.001453455,0.0005453023],"about_ca_topic_score_codex":0.00044253826,"about_ca_topic_score_gemma":0.0007810741,"teacher_disagreement_score":0.44532657,"about_ca_system_score_codex":0.0002175771,"about_ca_system_score_gemma":0.000113551265,"threshold_uncertainty_score":0.922749},"labels":[],"label_agreement":null},{"id":"W2398808383","doi":"10.29007/54ps","title":"Cuts for circular proofs","year":2018,"lang":"en","type":"article","venue":"EPiC series in computing","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematical proof; Computer science; Geometry; Mathematics","score_opus":0.026233579637175763,"score_gpt":0.2901355418962448,"score_spread":0.26390196225906903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398808383","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1471565,0.00021392606,0.8450826,0.0014101722,0.0017366763,0.00027052822,3.2584177e-7,0.00028624904,0.003843044],"genre_scores_gemma":[0.83481365,0.0000017067879,0.16441144,0.0003368805,0.0003212849,0.000007298845,5.603467e-7,0.000006018841,0.000101130565],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989531,0.00003643241,0.00022091174,0.00033342888,0.000112890615,0.00034323227],"domain_scores_gemma":[0.99924713,0.00019173897,0.00006538029,0.00039181675,0.00007381744,0.00003009417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004084653,0.000104175335,0.00016555781,0.000074498916,0.00016362709,0.00009949348,0.0006782628,0.00005159728,0.0000048489915],"category_scores_gemma":[0.00025142427,0.00009837685,0.00004277289,0.0002639873,0.00010742932,0.00026007576,0.00028946417,0.00006864081,0.000015842788],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041618638,0.00013533738,0.050008547,0.00023823163,0.00005422424,0.00008180503,0.014156004,0.00030926405,0.0012786106,0.44189322,0.0046845702,0.48711854],"study_design_scores_gemma":[0.0021310404,0.0011412634,0.08663182,0.00036385554,0.000013796665,0.00026237423,0.0010809667,0.554164,0.03364024,0.22191723,0.097412124,0.0012413188],"about_ca_topic_score_codex":0.000017648683,"about_ca_topic_score_gemma":0.000023208544,"teacher_disagreement_score":0.6876572,"about_ca_system_score_codex":0.000029502526,"about_ca_system_score_gemma":0.00004836184,"threshold_uncertainty_score":0.40116915},"labels":[],"label_agreement":null},{"id":"W2404358658","doi":"10.29007/8g5j","title":"Towards a Logic for Reasoning About Learning in a Changing World","year":2018,"lang":"en","type":"article","venue":"EPiC series in computing","topic":"Intelligent Tutoring Systems and Adaptive Learning","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; Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Automated reasoning; Epistemology; Computer science; Artificial intelligence; Cognitive science; Psychology; Philosophy","score_opus":0.028421000741811784,"score_gpt":0.29583891452570976,"score_spread":0.26741791378389795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404358658","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.086924136,0.00026126613,0.8979821,0.00038481812,0.0015551046,0.0002973795,1.8833961e-7,0.0003031435,0.012291846],"genre_scores_gemma":[0.8925,0.000002694014,0.10116129,0.00016172974,0.0007441518,0.000017788974,9.209679e-7,0.000019080962,0.005392339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793077,0.00015447199,0.0004489371,0.00052182475,0.00018709179,0.0007569102],"domain_scores_gemma":[0.9991536,0.00026623384,0.00018719824,0.00024448129,0.0001014035,0.000047058995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00184954,0.00019388714,0.0003077815,0.0010038983,0.0003647705,0.00021476473,0.0005486751,0.000061238825,0.000009883059],"category_scores_gemma":[0.0005249759,0.00020098938,0.00006882395,0.0019000181,0.000052506915,0.00036887013,0.00042050195,0.00037045285,0.000014281018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019900133,0.00002231294,0.035288747,0.00007311213,0.000011033335,0.00004016983,0.017805345,0.008440459,0.00012896156,0.8500553,0.000019101533,0.0880956],"study_design_scores_gemma":[0.0008670519,0.00042001635,0.014023867,0.0028002388,0.0000037967434,0.000063948675,0.0036159095,0.8904956,0.0016430697,0.0063036475,0.07895996,0.00080292864],"about_ca_topic_score_codex":0.00008173647,"about_ca_topic_score_gemma":0.0000868824,"teacher_disagreement_score":0.8820551,"about_ca_system_score_codex":0.00017170732,"about_ca_system_score_gemma":0.00006630044,"threshold_uncertainty_score":0.8196109},"labels":[],"label_agreement":null},{"id":"W2405484365","doi":"10.29007/2m22","title":"Towards an Expressive Practical Logical Action Theory","year":2018,"lang":"en","type":"article","venue":"EPiC series in computing","topic":"Semantic Web and Ontologies","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":"York University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; York University","keywords":"Situation calculus; Decidability; Undecidable problem; Fragment (logic); Computer science; Projection (relational algebra); Satisfiability; Action (physics); Logical consequence; Boolean satisfiability problem; Class (philosophy); Description logic; Theoretical computer science; Circumscription; Calculus (dental); Algorithm; Artificial intelligence","score_opus":0.0782508513794713,"score_gpt":0.37216339548233685,"score_spread":0.29391254410286555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405484365","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35805634,0.00003814732,0.6321449,0.001160449,0.0012775759,0.00008260647,1.5496406e-7,0.00028225654,0.006957526],"genre_scores_gemma":[0.8471971,0.0000041050557,0.15189576,0.00040280164,0.0004580339,0.0000025206805,6.301694e-7,0.000004994756,0.000034053464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984768,0.00032876772,0.00023959762,0.00041788173,0.00019800232,0.00033892487],"domain_scores_gemma":[0.9989158,0.00040140442,0.00009709012,0.00044829675,0.00007491467,0.000062509214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006582383,0.0001299996,0.00018123313,0.000072831775,0.0001858032,0.00016236691,0.0005576373,0.00009961445,0.00005159528],"category_scores_gemma":[0.0007372998,0.000108655724,0.000033661094,0.00024408303,0.00024562865,0.00089743687,0.00046124344,0.00021236406,0.00003339411],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086570966,0.00014684888,0.0052378755,0.000015616593,0.0000151220065,0.00017032288,0.0062730196,0.000071219416,0.00070784154,0.7079543,0.00037395238,0.2789473],"study_design_scores_gemma":[0.0012359385,0.0020622571,0.17352921,0.00018732146,0.00001672164,0.0010833284,0.012102691,0.18267654,0.036053967,0.5824413,0.007481169,0.0011295567],"about_ca_topic_score_codex":0.00003063345,"about_ca_topic_score_gemma":0.000033739747,"teacher_disagreement_score":0.48914075,"about_ca_system_score_codex":0.00004296551,"about_ca_system_score_gemma":0.00007494458,"threshold_uncertainty_score":0.4430852},"labels":[],"label_agreement":null},{"id":"W2575628753","doi":"10.29007/976n","title":"An Algebra of Combined Constraint Solving","year":2018,"lang":"en","type":"article","venue":"EPiC series in computing","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rotation formalisms in three dimensions; Mathematical proof; Algebra over a field; Computer science; Formalism (music); Relational algebra; Constraint satisfaction problem; Universal algebra; Relation algebra; Algebraic structure; Modular design; Theoretical computer science; Programming language; Relational database; Mathematics; Algebra representation; Pure mathematics; Cellular algebra; Artificial intelligence","score_opus":0.015341149201505108,"score_gpt":0.2653032240207558,"score_spread":0.24996207481925067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575628753","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.698991,0.00009345984,0.27646407,0.00015154092,0.001252486,0.0001239015,4.861715e-7,0.00021502998,0.02270804],"genre_scores_gemma":[0.9384776,0.0000021355731,0.061167523,0.000107376065,0.00020397613,0.000001073131,0.0000010138789,0.000007204883,0.000032123993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986847,0.000115350325,0.0003590297,0.00034652205,0.00015060857,0.0003438015],"domain_scores_gemma":[0.9989646,0.00018932659,0.00015261784,0.0004930517,0.00012875749,0.000071632094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063535746,0.0001355064,0.0002505154,0.00010274931,0.00015554026,0.00008622229,0.0008505255,0.0000638836,0.000039647606],"category_scores_gemma":[0.0001748734,0.00013050532,0.000043803757,0.000385778,0.00033452173,0.00037176372,0.00036446538,0.00013237135,0.000016180644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021332977,0.00019780075,0.045299936,0.000057483277,0.000024264547,0.00003753709,0.020802997,0.000118207114,0.0024612579,0.81665343,0.0002148799,0.11411085],"study_design_scores_gemma":[0.0025403565,0.0028443157,0.109048046,0.0005458638,0.000013201543,0.00020248126,0.0025086051,0.7345785,0.046098053,0.09862231,0.0017980719,0.0012002144],"about_ca_topic_score_codex":0.000040232797,"about_ca_topic_score_gemma":0.000046293884,"teacher_disagreement_score":0.7344603,"about_ca_system_score_codex":0.000034451612,"about_ca_system_score_gemma":0.000087254935,"threshold_uncertainty_score":0.5321852},"labels":[],"label_agreement":null},{"id":"W2577435553","doi":"10.29007/2ksh","title":"Proof Support for Common Logic","year":2018,"lang":"en","type":"article","venue":"EPiC series in computing","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":"University of Toronto","funders":"Deutsche Forschungsgemeinschaft; European Commission","keywords":"Computer science; Extension (predicate logic); Bunched logic; Higher-order logic; Description logic; Set (abstract data type); Programming language; Philosophy of logic; Theoretical computer science; Multimodal logic; Autoepistemic logic","score_opus":0.040353831192221044,"score_gpt":0.3012005958831883,"score_spread":0.2608467646909673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577435553","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0094599435,0.00008525771,0.96998966,0.00050349743,0.002362727,0.0005280882,3.5915124e-7,0.00026423525,0.01680625],"genre_scores_gemma":[0.9584247,7.1325064e-7,0.04023504,0.0003323355,0.0005103129,0.000016810216,0.0000030659585,0.000009218107,0.00046784466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986717,0.00006587316,0.00033507193,0.0003674301,0.00014223356,0.00041770065],"domain_scores_gemma":[0.999176,0.00013928601,0.00013097456,0.0004160444,0.00008804684,0.00004962529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007738355,0.0001327554,0.00022817687,0.00007353766,0.00020785606,0.00014313214,0.0007145739,0.000071658396,0.000013895353],"category_scores_gemma":[0.0000868455,0.00011704081,0.000053698383,0.00029196544,0.00011345618,0.0002431006,0.00032731463,0.000096594056,0.000034357465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014988966,0.00007173476,0.014979655,0.00009194375,0.000013989429,0.00002364607,0.0037154586,0.000046504196,0.000051320992,0.8300765,0.0014282307,0.14948599],"study_design_scores_gemma":[0.0018740058,0.0033243448,0.00934657,0.000057497677,0.000011649003,0.00031152688,0.0006128719,0.13131815,0.008344479,0.5466754,0.29699564,0.0011278637],"about_ca_topic_score_codex":0.000038893217,"about_ca_topic_score_gemma":0.00007997661,"teacher_disagreement_score":0.9489647,"about_ca_system_score_codex":0.000042841657,"about_ca_system_score_gemma":0.00005126985,"threshold_uncertainty_score":0.47727856},"labels":[],"label_agreement":null},{"id":"W2577559092","doi":"10.29007/493z","title":"Modeling Organic Chemistry and Planning Organic Synthesis","year":2018,"lang":"en","type":"article","venue":"EPiC series in computing","topic":"Semantic Web and Ontologies","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":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Benchmark (surveying); Set (abstract data type); Domain (mathematical analysis); Organic molecules; Artificial intelligence; Theoretical computer science; Chemistry; Programming language; Molecule; Mathematics; Organic chemistry","score_opus":0.02047545171841846,"score_gpt":0.2535248274359482,"score_spread":0.2330493757175297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577559092","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.7102782,0.00028712463,0.28748193,0.00025522514,0.00030351055,0.00003570892,9.2453895e-8,0.00019070636,0.0011674553],"genre_scores_gemma":[0.9572561,0.000009970561,0.042320922,0.000107701,0.00025940948,0.000001292824,2.148695e-7,0.000010401363,0.00003399579],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988397,0.00003802986,0.0002556357,0.0004016252,0.00012675548,0.00033828258],"domain_scores_gemma":[0.99924105,0.0002468617,0.000055552428,0.00035680927,0.00005319906,0.000046549023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035536324,0.00014493459,0.00021230282,0.000041303545,0.00020992242,0.00014299362,0.0005529327,0.000077541365,0.000057666544],"category_scores_gemma":[0.00058522413,0.00014324553,0.00001960035,0.00031871934,0.00009678853,0.0002740093,0.00061216747,0.00014524421,0.0000104747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013282611,0.0003070436,0.2222209,0.0011388512,0.00030785167,0.0010044313,0.100107,0.0137357125,0.11757216,0.01837389,0.00059741753,0.5245019],"study_design_scores_gemma":[0.00016728166,0.000029698069,0.002902807,0.00021647743,0.0000054452707,0.00015509172,0.0014972944,0.97148305,0.020297151,0.0028765977,0.000076271936,0.00029283535],"about_ca_topic_score_codex":0.000021602791,"about_ca_topic_score_gemma":0.000012504745,"teacher_disagreement_score":0.95774734,"about_ca_system_score_codex":0.000036803,"about_ca_system_score_gemma":0.000048293896,"threshold_uncertainty_score":0.58413833},"labels":[],"label_agreement":null},{"id":"W2578608903","doi":"10.29007/z9mz","title":"Metis-based Paramodulation Tactic for HOL Light","year":2018,"lang":"en","type":"article","venue":"EPiC series in computing","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":3,"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":"Austrian Science Fund","keywords":"HOL; Metis; Mathematical proof; Automated theorem proving; Computer science; Programming language; Proof assistant; Gas meter prover; Mathematics; Database","score_opus":0.03108864312804124,"score_gpt":0.290305685783355,"score_spread":0.2592170426553138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578608903","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019176846,0.000078974954,0.97617847,0.00061825383,0.0017758597,0.00037349336,1.8721342e-7,0.0002040364,0.0015938875],"genre_scores_gemma":[0.9358893,3.3490426e-7,0.06334677,0.00017222323,0.00046313446,0.000016943148,0.0000028648303,0.000009095054,0.00009930536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988087,0.000083511135,0.00028610483,0.00035213865,0.00015058268,0.0003189583],"domain_scores_gemma":[0.9991322,0.00020376687,0.00014573916,0.0003730879,0.00010235486,0.000042832293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006230723,0.00012154185,0.00017787423,0.00009477922,0.00020903235,0.00017399935,0.00042756728,0.00006762628,0.0000067105625],"category_scores_gemma":[0.0001675143,0.00011205267,0.000052251966,0.00035123,0.000052569514,0.00029056086,0.00010337818,0.00007561329,0.000025367335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056559704,0.0001662237,0.02419511,0.00023133066,0.00004257941,0.000026046491,0.0063763363,0.0017532283,0.0005714341,0.67327845,0.0012815683,0.29202116],"study_design_scores_gemma":[0.0012534821,0.0008053119,0.0091688335,0.000043409393,0.000009892674,0.000031794058,0.00014092925,0.82284504,0.011802585,0.0619117,0.09143889,0.0005481314],"about_ca_topic_score_codex":0.000037993494,"about_ca_topic_score_gemma":0.000038903785,"teacher_disagreement_score":0.91671246,"about_ca_system_score_codex":0.000051539813,"about_ca_system_score_gemma":0.000049189104,"threshold_uncertainty_score":0.45693752},"labels":[],"label_agreement":null},{"id":"W2579738600","doi":"10.29007/8drm","title":"Benchmark Problem: A PK/PD Model and Safety Constraints for Anesthesia Delivery","year":2018,"lang":"en","type":"article","venue":"EPiC series in computing","topic":"Anesthesia and Sedative Agents","field":"Medicine","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Benchmark (surveying); Propofol; Hypnosis; Computer science; Unconsciousness; Pharmacodynamics; Pharmacokinetics; Nonlinear system; Code (set theory); Anesthesia; Medicine; Pharmacology; Physics; Programming language","score_opus":0.02501857068454738,"score_gpt":0.2827003861352207,"score_spread":0.2576818154506733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579738600","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.9854134,0.00010131693,0.008501723,0.0011115419,0.00003658607,0.0005924219,0.0000016472496,0.000045172193,0.0041962154],"genre_scores_gemma":[0.9490511,0.00001647359,0.04930462,0.0010594855,0.00015425833,0.000008487459,0.000014730776,0.000016622187,0.0003742612],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899185,0.00003837339,0.00029172437,0.00028496486,0.00011118131,0.00028190317],"domain_scores_gemma":[0.999437,0.0001557449,0.00007628673,0.00014602487,0.00010763804,0.00007731496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036099603,0.00014411125,0.0002892382,0.000065599495,0.00016351498,0.000016677512,0.00007088078,0.00007851964,0.0000484859],"category_scores_gemma":[0.00007785735,0.00013170406,0.000040999686,0.000100502766,0.00041136163,0.00007619085,0.000042079366,0.00010226392,0.000004717041],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0052874107,0.0006071916,0.62318325,0.0016120472,0.00033177948,0.00078054063,0.031987708,0.0010115384,0.0031394188,0.040699072,0.0064271973,0.28493282],"study_design_scores_gemma":[0.012531032,0.0036789398,0.42831165,0.0024694963,0.00025003476,0.0042760097,0.0056587188,0.498817,0.0020100102,0.017122613,0.023428468,0.0014460139],"about_ca_topic_score_codex":0.000013298661,"about_ca_topic_score_gemma":0.000010259635,"teacher_disagreement_score":0.49780548,"about_ca_system_score_codex":0.000041447933,"about_ca_system_score_gemma":0.000085949556,"threshold_uncertainty_score":0.53707355},"labels":[],"label_agreement":null},{"id":"W2580401938","doi":"10.29007/vz48","title":"Proving uniformity and independence by self-composition and coupling","year":2018,"lang":"en","type":"article","venue":"EPiC series in computing","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":"Polytechnique Montréal","funders":"Horizon 2020 Framework Programme; European Commission; Simons Foundation; National Science Foundation","keywords":"Mathematical proof; Probabilistic logic; Computer science; Theoretical computer science; Probabilistic CTL; Probabilistic argumentation; Independence (probability theory); Markov chain; Abstraction; Probabilistic relevance model; Proof assistant; Programming language; Mathematics; Probabilistic analysis of algorithms; Artificial intelligence; Machine learning","score_opus":0.011702104608956926,"score_gpt":0.27000418668284665,"score_spread":0.2583020820738897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2580401938","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.59698284,0.000093493196,0.4020767,0.00008351073,0.00021361889,0.00010013536,2.717383e-7,0.00012278942,0.00032662298],"genre_scores_gemma":[0.6143087,0.0000106764855,0.38557282,0.00005135009,0.00004656872,0.0000015718185,5.1471704e-7,0.000003758702,0.0000040432146],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989763,0.000060265,0.00023607953,0.0003461456,0.00015875144,0.00022249705],"domain_scores_gemma":[0.99942976,0.000111651934,0.000114108756,0.00023534695,0.00006233204,0.000046820835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010673611,0.00010750129,0.00012290456,0.00007293219,0.00027567113,0.00017151503,0.00028139673,0.00007035015,0.000001230979],"category_scores_gemma":[0.00008727968,0.000114634386,0.000008252819,0.00026175377,0.00013065035,0.0009174157,0.00040761312,0.00017950629,0.000001817701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071239665,0.00019755737,0.21652618,0.0005109223,0.000043291726,0.000029994559,0.031144833,0.0006179074,0.02191416,0.26871213,0.00013246034,0.4600993],"study_design_scores_gemma":[0.00024229118,0.00013411415,0.030382717,0.000108192995,0.000002855627,0.00012487739,0.00018258549,0.94910216,0.016316481,0.0029665704,0.00020269089,0.00023448396],"about_ca_topic_score_codex":0.000035315454,"about_ca_topic_score_gemma":0.000006027617,"teacher_disagreement_score":0.94848424,"about_ca_system_score_codex":0.00005464529,"about_ca_system_score_gemma":0.000026719283,"threshold_uncertainty_score":0.46746546},"labels":[],"label_agreement":null},{"id":"W2613423194","doi":"10.29007/n76q","title":"Origami folds in higher-dimension","year":2018,"lang":"en","type":"article","venue":"EPiC series in computing","topic":"Advanced Materials and Mechanics","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Concreteness; Generalization; Dimension (graph theory); Euclidean geometry; Euclidean space; Point (geometry); Plane (geometry); Axiom; Mathematics; Computer science; Pure mathematics; Geometry; Mathematical analysis","score_opus":0.018517118382784026,"score_gpt":0.24289228728215445,"score_spread":0.22437516889937043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613423194","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.9883382,0.00013507699,0.00452177,0.00003984331,0.0036117265,0.00007423837,6.045654e-7,0.00020205694,0.003076539],"genre_scores_gemma":[0.98610425,0.000018566767,0.013383243,0.000047842816,0.00034797855,0.0000018081622,0.0000015901097,0.000020798265,0.00007393596],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999383,0.000013328536,0.00019967473,0.00012159918,0.00005391152,0.0002284854],"domain_scores_gemma":[0.9997937,0.000028067185,0.000018825685,0.00012530181,0.000012312192,0.000021782793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013427994,0.00009370852,0.00014282523,0.000053914362,0.000029706503,0.000012326451,0.00007437937,0.00005666589,0.0000774516],"category_scores_gemma":[0.00001602816,0.00009900191,0.000011666855,0.00015478194,0.00001799843,0.000093781404,0.00006294347,0.00007824719,0.000019637813],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017169077,0.00013149806,0.005086574,0.0007230378,0.000047352554,0.00033102848,0.00827132,0.13469048,0.57759714,0.112706,0.001324096,0.15891977],"study_design_scores_gemma":[0.0028310197,0.0005049771,0.015800199,0.0012525542,0.000011656494,0.000057105975,0.00076108554,0.18996634,0.6391025,0.04580073,0.102311015,0.0016008267],"about_ca_topic_score_codex":0.000011588512,"about_ca_topic_score_gemma":0.000039865758,"teacher_disagreement_score":0.15731895,"about_ca_system_score_codex":0.00006195468,"about_ca_system_score_gemma":0.0000052275536,"threshold_uncertainty_score":0.40371808},"labels":[],"label_agreement":null},{"id":"W2626157061","doi":"10.29007/hb5r","title":"gcn.MOPS: Accelerating cn.MOPS with GPU","year":2019,"lang":"en","type":"article","venue":"EPiC series in computing","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","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":"Speedup; Computer science; Parallel computing; Central processing unit; CPU shielding; Multi-core processor; Acceleration; Process (computing); Single-core; Parallelism (grammar); Computer hardware; Operating system; Physics","score_opus":0.010673065013122575,"score_gpt":0.2276986797527043,"score_spread":0.21702561473958173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2626157061","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.99046236,0.0007231232,0.00023813544,0.00011539809,0.00030314602,0.0001730627,0.0000022524623,0.000007808301,0.007974709],"genre_scores_gemma":[0.99183965,0.000041029965,0.0071693785,0.00022647213,0.0002821137,0.0000051797138,0.000011361795,0.000023281504,0.00040155044],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9989904,0.000037889607,0.00021913472,0.00036254938,0.00008819725,0.00030183478],"domain_scores_gemma":[0.9995137,0.000029866043,0.00008455011,0.00028929734,0.000048247424,0.00003433104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017750719,0.00016622404,0.00019151311,0.00003098228,0.000101039426,0.0000365004,0.00018289113,0.000074509255,0.00002119247],"category_scores_gemma":[0.000035302946,0.00015001427,0.00003840346,0.00010296717,0.00005580168,0.0000017152954,0.00025080328,0.000104206774,0.000010798812],"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.00012134506,0.000049128088,0.68816864,0.00007434642,0.00011597689,0.000012794739,0.0010948171,0.007208216,0.29201773,0.0007497145,0.0002568869,0.010130425],"study_design_scores_gemma":[0.0056011155,0.003423351,0.5656085,0.0004713651,0.000058027297,0.00032283732,0.008270719,0.005741315,0.3130781,0.0012098297,0.09346095,0.0027538924],"about_ca_topic_score_codex":0.000028651195,"about_ca_topic_score_gemma":0.000052492145,"teacher_disagreement_score":0.12256011,"about_ca_system_score_codex":0.000013939493,"about_ca_system_score_gemma":0.000043889842,"threshold_uncertainty_score":0.6117404},"labels":[],"label_agreement":null},{"id":"W2736911465","doi":"10.29007/b8gq","title":"Automated analysis of Stateflow models","year":2018,"lang":"en","type":"article","venue":"EPiC series in computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Centre National d’Etudes Spatiales; Agence Nationale de la Recherche; National Aeronautics and Space Administration","keywords":"Stateflow; Computer science; Programming language; Code generation; Toolbox; Semantics (computer science); Software engineering; Key (lock)","score_opus":0.04062794395109122,"score_gpt":0.3368461936602954,"score_spread":0.2962182497092042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2736911465","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23605233,0.000018584627,0.7608136,0.00003904338,0.00032783643,0.00005434427,9.120695e-7,0.00028233748,0.0024110246],"genre_scores_gemma":[0.5352801,0.0000016658507,0.4646555,0.000029907438,0.000018324754,8.444571e-7,0.0000012696983,0.0000028309364,0.000009576761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987306,0.00015817641,0.0004232802,0.00027503783,0.00019264643,0.00022024427],"domain_scores_gemma":[0.9989665,0.00011497471,0.00018713804,0.00056541176,0.00013577852,0.000030186775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094644685,0.00009200773,0.00025151687,0.00040572893,0.00007247903,0.000042088624,0.00067395775,0.000046473957,0.000011094181],"category_scores_gemma":[0.00012876905,0.00009431362,0.00005309456,0.0026423584,0.00012555197,0.00056843454,0.00027940623,0.00007668576,0.00000470934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032541484,0.00011240584,0.00912293,0.00005806709,0.00037140242,0.000009360995,0.019506563,0.3848823,0.0013566157,0.45864177,0.00014963408,0.12575641],"study_design_scores_gemma":[0.00007656387,0.000055840937,0.015392729,0.000016957283,0.000015891967,0.0000019803915,0.00006205602,0.97618407,0.004001794,0.0040501826,0.000050669692,0.000091262315],"about_ca_topic_score_codex":0.00006361508,"about_ca_topic_score_gemma":0.000021804815,"teacher_disagreement_score":0.5913018,"about_ca_system_score_codex":0.000046754736,"about_ca_system_score_gemma":0.000034709563,"threshold_uncertainty_score":0.38459978},"labels":[],"label_agreement":null},{"id":"W2741782787","doi":"10.29007/fm8f","title":"Overview of COLIEE 2017","year":2018,"lang":"en","type":"article","venue":"EPiC series in computing","topic":"Topic Modeling","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Core Research for Evolutional Science and Technology; Ministry of Education, Culture, Sports, Science and Technology; Alberta Machine Intelligence Institute","keywords":"Task (project management); Computer science; Logical consequence; Textual entailment; Information retrieval; Information extraction; Group (periodic table); Task group; Question answering; Natural language processing; Artificial intelligence","score_opus":0.08135760093089604,"score_gpt":0.33177475092000414,"score_spread":0.2504171499891081,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741782787","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36314756,0.0006964172,0.61872196,0.0006054249,0.0016538687,0.00013149902,4.3862784e-7,0.000129226,0.014913584],"genre_scores_gemma":[0.8705374,0.000013939324,0.12900369,0.00018023913,0.00018772355,7.9410916e-7,1.7811338e-7,0.00000406428,0.00007194451],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990187,0.000053324435,0.00030549295,0.00025128052,0.00015218894,0.00021898285],"domain_scores_gemma":[0.99917287,0.00009384071,0.00011287328,0.0005259699,0.000065108055,0.000029333612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004292226,0.00008239611,0.00017730602,0.000072004514,0.000070600516,0.000034678695,0.00072682713,0.00003853764,0.000018435829],"category_scores_gemma":[0.00008842827,0.000084631836,0.000030808278,0.0002831329,0.00008327836,0.00023726084,0.0005106573,0.000085621476,0.000017142203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014377145,0.00008849409,0.029301543,0.00024752933,0.000027042175,0.00004406902,0.012252205,0.0018839885,0.00074683025,0.6173054,0.0013373402,0.3367512],"study_design_scores_gemma":[0.00078732544,0.0002853576,0.03902278,0.0006801572,0.0000050571384,0.00009094391,0.00023218844,0.8928713,0.008367153,0.043148242,0.01399261,0.0005168467],"about_ca_topic_score_codex":0.00005960265,"about_ca_topic_score_gemma":0.000029776558,"teacher_disagreement_score":0.89098734,"about_ca_system_score_codex":0.00002680478,"about_ca_system_score_gemma":0.00004769672,"threshold_uncertainty_score":0.3451186},"labels":[],"label_agreement":null},{"id":"W2758043160","doi":"10.29007/p319","title":"SC-square: when Satisfiability Checking and Symbolic Computation join forces","year":2018,"lang":"en","type":"article","venue":"EPiC series in computing","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":"Horizon 2020 Framework Programme; Agence Nationale de la Recherche","keywords":"Satisfiability; Join (topology); Computer science; Computation; Square (algebra); Focus (optics); Theoretical computer science; Symbolic computation; Algorithm; Mathematics; Combinatorics","score_opus":0.03089286117739838,"score_gpt":0.31207660951298394,"score_spread":0.28118374833558557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2758043160","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45317858,0.00007122982,0.5446484,0.0002328332,0.0005606244,0.00015507477,3.1446243e-7,0.0001222572,0.001030663],"genre_scores_gemma":[0.5562741,0.0000033548304,0.44348493,0.00009527255,0.00012455524,0.0000032326338,8.2139326e-7,0.0000062133704,0.0000075020857],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981611,0.0002945131,0.00046818008,0.0005082751,0.00023132397,0.00033663213],"domain_scores_gemma":[0.9989371,0.0002749467,0.00019661782,0.00041712372,0.00011477465,0.000059442107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017154145,0.00016424812,0.00023336572,0.00014609618,0.0003009745,0.00022419663,0.0004554515,0.000081117185,0.000008073028],"category_scores_gemma":[0.0004806054,0.00017378674,0.00002888649,0.00045986552,0.00027265222,0.00069425313,0.00047214286,0.00017809533,0.000009420627],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002182842,0.000047760648,0.08687135,0.00014739178,0.000015395735,0.000005023948,0.024088278,0.0008445042,0.0008249474,0.15466651,0.00009630006,0.73237073],"study_design_scores_gemma":[0.00031597298,0.00017806077,0.24740769,0.000138407,0.0000033267488,0.0000438485,0.00027587978,0.69780415,0.0036804264,0.049347755,0.0005122087,0.00029230074],"about_ca_topic_score_codex":0.00009795219,"about_ca_topic_score_gemma":0.000034133842,"teacher_disagreement_score":0.73207843,"about_ca_system_score_codex":0.00009413988,"about_ca_system_score_gemma":0.000041592622,"threshold_uncertainty_score":0.70868176},"labels":[],"label_agreement":null},{"id":"W2785870089","doi":"10.29007/3pxg","title":"Improving SAT Solver Performance with Structure-based Preferential Bumping","year":2018,"lang":"en","type":"article","venue":"EPiC series in computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bumping; Solver; Exploit; Computer science; Boolean satisfiability problem; Computational science; Parallel computing; Theoretical computer science; Programming language; Engineering","score_opus":0.0164611457732456,"score_gpt":0.25275935420218226,"score_spread":0.23629820842893667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2785870089","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4719849,0.000008315819,0.5266193,0.00004446189,0.00076307566,0.00010882111,3.3118826e-7,0.000125263,0.00034552783],"genre_scores_gemma":[0.55223113,3.2932073e-7,0.44749022,0.00007454335,0.00018397198,0.000001958316,0.0000014416843,0.000008323914,0.000008108411],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984594,0.00010322237,0.0003089698,0.00045362857,0.00026448,0.00041028223],"domain_scores_gemma":[0.9989857,0.00007383042,0.00020255608,0.0005872561,0.000103640756,0.000047024507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047506497,0.00017875007,0.00017528638,0.00013547535,0.00028919723,0.00017470401,0.0007687495,0.00007065337,0.000018023458],"category_scores_gemma":[0.00009740292,0.00015971727,0.000023252393,0.000501064,0.00017460043,0.00073314505,0.00029695488,0.00023756041,0.000008811713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026712238,0.000118332086,0.076223254,0.00048065913,0.00004252121,0.000015030854,0.009898669,0.016731586,0.010630768,0.03422773,0.000055755343,0.8513086],"study_design_scores_gemma":[0.00044600232,0.00038763578,0.032089293,0.0001492982,0.0000037312095,0.000016543921,0.000049477305,0.89468616,0.07129196,0.00025441125,0.0003340734,0.0002914207],"about_ca_topic_score_codex":0.000027695602,"about_ca_topic_score_gemma":0.000026869422,"teacher_disagreement_score":0.87795454,"about_ca_system_score_codex":0.00009964316,"about_ca_system_score_gemma":0.00010845215,"threshold_uncertainty_score":0.6513081},"labels":[],"label_agreement":null},{"id":"W2807099028","doi":"10.29007/9plt","title":"An Empirical Evaluation of Database Software Features on Energy Consumption","year":2018,"lang":"en","type":"article","venue":"EPiC series in computing","topic":"Green IT and Sustainability","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":"IBM (Canada); Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; International Business Machines Corporation","keywords":"Energy consumption; Computer science; Software; Efficient energy use; Software metric; Database; Software development; Software sizing; Empirical research; Software engineering; Software construction; Operating system; Engineering","score_opus":0.039280113980279745,"score_gpt":0.33849552526491455,"score_spread":0.2992154112846348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807099028","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.9890871,0.00010061413,0.009816663,0.00001966802,0.00033924956,0.000073002775,0.0000032903265,0.00011021082,0.0004502135],"genre_scores_gemma":[0.9967575,0.0000027421631,0.0030125778,0.00002957203,0.00015294307,0.0000028611084,0.000026700063,0.000010128784,0.0000049649148],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99918723,0.0001226727,0.00018487369,0.00014963411,0.00020749497,0.00014806545],"domain_scores_gemma":[0.99945456,0.00010275521,0.000027364818,0.00025918093,0.00012672017,0.000029446046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006302911,0.000086312066,0.00011761408,0.00007579427,0.000050546394,0.000012098676,0.00009439377,0.00005653341,0.00007718699],"category_scores_gemma":[0.00023920093,0.000088388166,0.000018183026,0.00012373083,0.0000833166,0.00012289968,0.000029534905,0.00009055105,0.0000020038344],"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.00013015079,0.00015287453,0.4403875,0.00032006507,0.000033575943,0.000008319792,0.005154359,0.11497648,0.00094840873,0.0017119249,0.0014634599,0.4347129],"study_design_scores_gemma":[0.00055539684,0.00022729611,0.5449758,0.00010612614,0.00001695382,0.0000071877053,0.00050053606,0.44210264,0.008528332,0.00232688,0.00042653288,0.00022629571],"about_ca_topic_score_codex":0.000042364336,"about_ca_topic_score_gemma":0.00017542703,"teacher_disagreement_score":0.4344866,"about_ca_system_score_codex":0.00011139298,"about_ca_system_score_gemma":0.000027315558,"threshold_uncertainty_score":0.36043647},"labels":[],"label_agreement":null},{"id":"W2900773200","doi":"10.29007/8m31","title":"Predicting SAT Solver Performance on Heterogeneous Hardware","year":2019,"lang":"en","type":"article","venue":"EPiC series in computing","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Solver; Reuse; Boolean satisfiability problem; Set (abstract data type); Cache; Parallel computing; Feature (linguistics); Theoretical computer science; Programming language","score_opus":0.009734830571931433,"score_gpt":0.21960126893353335,"score_spread":0.2098664383616019,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2900773200","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.9455931,0.00001832041,0.04771587,0.00022366109,0.0013243323,0.0001541872,5.1425667e-7,0.00021723835,0.00475277],"genre_scores_gemma":[0.9854997,0.0000070417473,0.013916563,0.00032101208,0.00006890729,0.0000017200477,0.0000026156313,0.000007935648,0.00017454155],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989827,0.000042542888,0.00023298507,0.0003180398,0.00018108483,0.00024259115],"domain_scores_gemma":[0.99943316,0.00010009011,0.00008546662,0.00031175633,0.000032529097,0.00003702603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019852135,0.00011649437,0.00013094879,0.00010380122,0.000118104144,0.00009957594,0.00028604557,0.00004828033,0.00008339741],"category_scores_gemma":[0.000034217184,0.000120499986,0.000034305074,0.00024086105,0.00002270982,0.000385454,0.00017690693,0.00016808756,0.0001085036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001225003,0.000018549907,0.5333466,0.000035591744,0.000008328483,0.00001125088,0.0014254595,0.3217851,0.00007997417,0.0020954423,0.000029322608,0.14115214],"study_design_scores_gemma":[0.00030707862,0.00011252419,0.08904713,0.00012281636,9.671718e-7,0.000055363776,0.00006662585,0.90859914,0.000894703,0.00007514401,0.00054642675,0.00017205815],"about_ca_topic_score_codex":0.0000070804786,"about_ca_topic_score_gemma":0.000009783092,"teacher_disagreement_score":0.5868141,"about_ca_system_score_codex":0.00007197442,"about_ca_system_score_gemma":0.00003283377,"threshold_uncertainty_score":0.49138469},"labels":[],"label_agreement":null},{"id":"W2968959540","doi":"10.29007/6l77","title":"Towards Formal Reliability Analysis of Logistics Service Supply Chains using Theorem Proving","year":2018,"lang":"en","type":"article","venue":"EPiC series in computing","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":"Concordia University","funders":"Qatar National Research Fund; Fonds National de la Recherche Luxembourg; Qatar Foundation","keywords":"Computer science; HOL; Reliability (semiconductor); Mathematical proof; Reliability engineering; Service (business); Reliability theory; Node (physics); Product (mathematics); Reliability block diagram; Automated theorem proving; Theoretical computer science; Fault tree analysis; Engineering; Mathematics; Programming language; Business","score_opus":0.04765700939063607,"score_gpt":0.33431774445010043,"score_spread":0.2866607350594644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2968959540","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35259372,0.000011243426,0.6459313,0.00007538972,0.00032927922,0.00011166909,0.0000018468685,0.000069757014,0.0008758305],"genre_scores_gemma":[0.5271624,9.88757e-7,0.47268724,0.00007473123,0.00006389924,0.0000010451614,0.0000018039652,0.000004794407,0.00000310452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789155,0.0002879342,0.00067247136,0.00042770017,0.00030409358,0.00041622855],"domain_scores_gemma":[0.99807525,0.00022267715,0.00036853785,0.00090004015,0.00038473585,0.000048776958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029427996,0.00016214029,0.0003788449,0.00033595297,0.00020134199,0.000074754695,0.001023912,0.000092972805,0.000012511734],"category_scores_gemma":[0.00091014354,0.00016040253,0.0000844138,0.0030049833,0.00024857026,0.0007714145,0.0008288057,0.00017962465,0.000001695433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088060675,0.00017705864,0.072010934,0.0003511526,0.0002183662,0.000008273035,0.026446631,0.17578717,0.0016136544,0.58446985,0.0000068194695,0.138822],"study_design_scores_gemma":[0.00010137631,0.00008125393,0.051796507,0.00004593684,0.000041385607,0.000006165777,0.00028072752,0.9394465,0.004906699,0.003098372,0.000039835188,0.00015523648],"about_ca_topic_score_codex":0.0003677187,"about_ca_topic_score_gemma":0.00008588325,"teacher_disagreement_score":0.76365936,"about_ca_system_score_codex":0.00016118445,"about_ca_system_score_gemma":0.0001304155,"threshold_uncertainty_score":0.65410256},"labels":[],"label_agreement":null},{"id":"W2996001114","doi":"10.29007/brkj","title":"A Software Architecture for Handling Complex Critical Section Constraints on Multiprocessors in a Fault-Tolerant Real-Time Embedded System","year":2019,"lang":"en","type":"article","venue":"EPiC series in computing","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Critical section; Fault tolerance; Multiprocessing; Task (project management); Architecture; Section (typography); Software; Embedded system; State (computer science); Distributed computing; Parallel computing; Operating system; Programming language; Engineering","score_opus":0.017655359937206978,"score_gpt":0.2807336872351716,"score_spread":0.26307832729796465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996001114","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.54829526,0.000021836431,0.4478349,0.00017947324,0.0011444256,0.0009912932,0.000005466491,0.00045761932,0.0010697602],"genre_scores_gemma":[0.8036131,5.163475e-7,0.19601458,0.000059775644,0.000213263,0.00003502026,0.000007867378,0.000031781055,0.000024061517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965759,0.00032570673,0.00091614225,0.0009812072,0.00041001174,0.00079104234],"domain_scores_gemma":[0.9968464,0.002045024,0.00023967531,0.00059362943,0.00016063983,0.000114675626],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013516989,0.00036269386,0.00073125976,0.00039815222,0.00021625026,0.00029359167,0.00071516045,0.00021024243,0.00001411148],"category_scores_gemma":[0.0007408705,0.00036531675,0.00012201097,0.00063326897,0.00011805367,0.00040350927,0.00023784682,0.00045612027,0.000039412625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004721243,0.00029077884,0.008251792,0.004695623,0.00007956889,0.00025334753,0.029761566,0.8637618,0.015411284,0.01652751,0.00006628287,0.060428318],"study_design_scores_gemma":[0.0018095778,0.00026534594,0.0026620927,0.0028775267,0.0000051435086,0.00027684285,0.001792671,0.9882106,0.0008873998,0.0006639809,0.000039632323,0.00050915696],"about_ca_topic_score_codex":0.00013959508,"about_ca_topic_score_gemma":0.000042092455,"teacher_disagreement_score":0.2553179,"about_ca_system_score_codex":0.00032361923,"about_ca_system_score_gemma":0.00013896414,"threshold_uncertainty_score":0.9998799},"labels":[],"label_agreement":null},{"id":"W3011003272","doi":"10.29007/cd8h","title":"Zero-skipping in CapsNet. Is it worth it?","year":2020,"lang":"en","type":"article","venue":"EPiC series in computing","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"MNIST database; Computer science; Zero (linguistics); Artificial neural network; Multiplication (music); Artificial intelligence; Algorithm; Pattern recognition (psychology); Mathematics","score_opus":0.04750061519743814,"score_gpt":0.29756828310977507,"score_spread":0.2500676679123369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011003272","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09925201,0.00025171885,0.85082245,0.044377442,0.00037620513,0.00036249828,0.0000010593199,0.00027855227,0.0042780484],"genre_scores_gemma":[0.88993603,0.000026975298,0.100527525,0.009267651,0.00015196853,0.000010272644,0.0000015973609,0.000012758392,0.000065234424],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998295,0.000062179686,0.00044825257,0.0005918886,0.00018051668,0.00042213532],"domain_scores_gemma":[0.99907464,0.00025450118,0.00012127481,0.0004299665,0.00002717305,0.00009244026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017695043,0.00016508688,0.00023185839,0.000079641606,0.00012176309,0.00008217152,0.0008931375,0.000052020543,0.000019695599],"category_scores_gemma":[0.000102900856,0.00018819865,0.00003875162,0.001417143,0.00005232696,0.00044760868,0.00069568347,0.00034275567,0.00004751521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004332042,0.00015806241,0.08455097,0.00017395981,0.00003237773,0.00036784323,0.06239902,0.3906187,0.0013146774,0.10428134,0.02107772,0.33498198],"study_design_scores_gemma":[0.0006079558,0.00008320646,0.010124359,0.0002210589,0.0000025256297,0.00003293253,0.00056995905,0.936155,0.0011918078,0.010993124,0.03943029,0.0005877644],"about_ca_topic_score_codex":0.000029554249,"about_ca_topic_score_gemma":0.00007680472,"teacher_disagreement_score":0.790684,"about_ca_system_score_codex":0.0000695633,"about_ca_system_score_gemma":0.00004192802,"threshold_uncertainty_score":0.7674518},"labels":[],"label_agreement":null},{"id":"W3013162446","doi":"10.29007/mbb7","title":"Reducing error propagation for long term energy forecasting using multivariate prediction","year":2020,"lang":"en","type":"article","venue":"EPiC series in computing","topic":"Energy Load and Power Forecasting","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":"Trent University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Benchmark (surveying); Term (time); Computer science; Feature (linguistics); Energy (signal processing); Artificial intelligence; Machine learning; Multivariate statistics; Energy consumption; Mean absolute percentage error; Data mining; Econometrics; Statistics; Artificial neural network; Mathematics; Engineering","score_opus":0.0515206301022517,"score_gpt":0.25466496531700444,"score_spread":0.20314433521475275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013162446","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.5915954,0.00012773742,0.4062755,0.000049789545,0.0009403359,0.00015470643,0.000005456107,0.00038563996,0.00046541425],"genre_scores_gemma":[0.9694812,0.0000036266883,0.029327035,0.000050388324,0.0010141152,0.000011457523,0.000038921356,0.000063863954,0.000009340648],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986454,0.000035250927,0.0004999619,0.00030087153,0.00011574686,0.00040273377],"domain_scores_gemma":[0.99952924,0.0001365294,0.00010649299,0.000109145636,0.000042341817,0.00007625969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022477566,0.00021070559,0.00023766868,0.00009533857,0.00019808068,0.000064785156,0.00012311352,0.00009750012,0.000007168347],"category_scores_gemma":[0.00019890183,0.00023974423,0.0000611984,0.00032171773,0.000025298972,0.0003542754,0.00006822742,0.0001751033,4.7274008e-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.00002614357,0.000007002308,0.0063099014,0.00027465448,0.000025137466,0.000010345803,0.002632682,0.93489033,0.009599365,0.00024762852,0.000017578914,0.04595925],"study_design_scores_gemma":[0.00041343804,0.000054960416,0.0013866656,0.0004439799,0.000012988199,0.0000271433,0.00013762273,0.98587966,0.011200621,0.00006178933,0.00015826784,0.000222878],"about_ca_topic_score_codex":0.000043114356,"about_ca_topic_score_gemma":0.000018152274,"teacher_disagreement_score":0.37788585,"about_ca_system_score_codex":0.000119505494,"about_ca_system_score_gemma":0.000023731642,"threshold_uncertainty_score":0.97764856},"labels":[],"label_agreement":null},{"id":"W3013316335","doi":"10.29007/h71z","title":"On relationships between imbalance and overlapping of datasets","year":2020,"lang":"en","type":"article","venue":"EPiC series in computing","topic":"Imbalanced Data Classification 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":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; King Abdulaziz City for Science and Technology","keywords":"Support vector machine; Computer science; Precision and recall; Decision tree; Artificial intelligence; Data mining; Machine learning; Recall; k-nearest neighbors algorithm; Pattern recognition (psychology)","score_opus":0.05639342327698976,"score_gpt":0.2835915093782327,"score_spread":0.22719808610124292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013316335","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16275787,0.000077281846,0.8313447,0.0043281703,0.00008851292,0.00019444955,0.000054237258,0.0002848907,0.0008698624],"genre_scores_gemma":[0.9019071,0.0000069961184,0.097840525,0.00016731267,0.00003649841,0.0000016240068,0.00003369065,0.000004452423,0.0000017977104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.999016,0.000103218474,0.00030368072,0.00030425147,0.00013736055,0.00013548743],"domain_scores_gemma":[0.99893695,0.00046824798,0.00015568962,0.00037304213,0.000019429239,0.000046646976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037108126,0.00008551565,0.00017022404,0.00006399094,0.000071989365,0.00004150329,0.00048638813,0.000043715772,0.0000020483244],"category_scores_gemma":[0.00056999014,0.00009273428,0.000012184257,0.0003919026,0.000059828726,0.0003938381,0.00035766116,0.00022273244,0.0000036215931],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023730081,0.000045845383,0.33224043,0.00022741828,0.000024439354,0.00001781096,0.008971783,0.00058848923,0.0025849768,0.59945273,0.0037123852,0.05210996],"study_design_scores_gemma":[0.00060658966,0.00025732393,0.84355277,0.00038293176,0.0000047935573,0.000010804634,0.00035327248,0.11230428,0.009860438,0.028298937,0.0038952257,0.000472637],"about_ca_topic_score_codex":0.000005001274,"about_ca_topic_score_gemma":7.811503e-7,"teacher_disagreement_score":0.7391492,"about_ca_system_score_codex":0.000020163878,"about_ca_system_score_gemma":0.000020042306,"threshold_uncertainty_score":0.3781594},"labels":[],"label_agreement":null},{"id":"W3111321218","doi":"10.29007/mx3f","title":"A Robust Controlled Backward Reach Tube with (Almost) Analytic Solution for Two Dubins Cars","year":2020,"lang":"en","type":"article","venue":"EPiC series in computing","topic":"Guidance and Control Systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Reachability; Benchmark (surveying); Set (abstract data type); Computer science; Nonlinear system; Mathematical optimization; Pursuit-evasion; Mathematics; Algorithm","score_opus":0.02531251039226548,"score_gpt":0.22270590411975444,"score_spread":0.19739339372748896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3111321218","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.6437679,0.0013554639,0.34622648,0.0013424323,0.0008522199,0.0016718438,0.000010208262,0.0007000622,0.004073403],"genre_scores_gemma":[0.9947068,0.000004766502,0.004539077,0.00013899487,0.00046579516,0.00005343758,0.000010005482,0.000040400268,0.00004074147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987263,0.00004433698,0.00043146347,0.0002606406,0.00014146026,0.0003957664],"domain_scores_gemma":[0.99946874,0.00015770525,0.00006977263,0.00017118776,0.000056546083,0.0000760445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027852217,0.00020316002,0.000558557,0.000057309044,0.000088573186,0.000055334214,0.00015615455,0.000057377787,0.000007651588],"category_scores_gemma":[0.00009761074,0.00018659343,0.00009190375,0.00028573384,0.000029603481,0.00014172602,0.000029562727,0.00016259201,0.000007721871],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046918905,0.000016193086,0.005885424,0.00025068573,0.00021310968,0.0000311777,0.0025496709,0.98123133,0.0023679072,0.0006137074,0.0007663931,0.0056051877],"study_design_scores_gemma":[0.0059546423,0.0001596307,0.0009197525,0.00013058863,0.000040257728,0.000016801147,0.0005555412,0.99073595,0.0001716722,0.00003237952,0.001060781,0.00022203391],"about_ca_topic_score_codex":0.00007397189,"about_ca_topic_score_gemma":0.0001690329,"teacher_disagreement_score":0.3509389,"about_ca_system_score_codex":0.00010676564,"about_ca_system_score_gemma":0.000033173255,"threshold_uncertainty_score":0.7609059},"labels":[],"label_agreement":null},{"id":"W3194302642","doi":"10.29007/f1mf","title":"Determining Anti-Curve-Flattening Behaviors for COVID-19 in the United States","year":2021,"lang":"en","type":"article","venue":"EPiC series in computing","topic":"COVID-19 epidemiological studies","field":"Mathematics","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":"Pandemic; Coronavirus disease 2019 (COVID-19); Workforce; Recreation; Dimension (graph theory); Personal protective equipment; Severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2); Key (lock); Business; 2019-20 coronavirus outbreak; Demographic economics; Economic growth; Socioeconomics; Psychology; Geography; Political science; Economics; Computer science; Medicine; Computer security; Mathematics","score_opus":0.3073435332083431,"score_gpt":0.47028494183967784,"score_spread":0.16294140863133472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3194302642","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.96924436,0.00012971269,0.025020821,0.004845773,0.00019538948,0.00037000998,0.0000075729104,0.00011515455,0.000071209775],"genre_scores_gemma":[0.9661008,0.000033992128,0.029044284,0.004592493,0.00010018141,0.00004604375,0.00003207606,0.00002273718,0.000027410708],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9974884,0.0006282982,0.000754133,0.00042460658,0.00017579482,0.000528811],"domain_scores_gemma":[0.97733665,0.021990616,0.0002242706,0.0003190044,0.00007255184,0.00005691084],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0030669959,0.0002200238,0.00053178135,0.00013028926,0.00037002828,0.000063218424,0.0003397447,0.00009773385,0.00002325315],"category_scores_gemma":[0.025096701,0.0001704098,0.0000994532,0.00077901606,0.00014188341,0.00007655479,0.00038115185,0.00033548044,0.0000013592618],"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.000029503324,0.00014983818,0.94445086,0.00047485915,0.00003674452,0.00037314097,0.024078226,0.015518525,0.00008600782,0.009932287,0.0011898534,0.00368018],"study_design_scores_gemma":[0.00482836,0.00050660153,0.3905072,0.0012097848,0.0001644077,0.00026685948,0.09249079,0.1376347,0.00070998893,0.32479817,0.04497688,0.0019062777],"about_ca_topic_score_codex":0.00027096143,"about_ca_topic_score_gemma":0.00060692045,"teacher_disagreement_score":0.55394363,"about_ca_system_score_codex":0.00020392897,"about_ca_system_score_gemma":0.00009009186,"threshold_uncertainty_score":0.9831153},"labels":[],"label_agreement":null},{"id":"W3199146973","doi":"10.29007/s6vh","title":"A Generic Model of the World and Intelligence","year":2019,"lang":"en","type":"article","venue":"EPiC series in computing","topic":"AI-based Problem Solving and Planning","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":"Athabasca University","funders":"","keywords":"Computer science; Analogy; Artificial intelligence; Object (grammar); Identity (music); Artificial general intelligence; Human intelligence; Symbolic artificial intelligence; Cognitive science; Computational intelligence; Epistemology; Psychology","score_opus":0.023353025890957932,"score_gpt":0.24088109727323753,"score_spread":0.2175280713822796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199146973","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.60614854,0.0003271987,0.38964298,0.0004999715,0.00037157186,0.00010781355,4.2582144e-7,0.000046342633,0.002855183],"genre_scores_gemma":[0.91761374,0.00000344416,0.08180846,0.00018325083,0.000014547099,6.581113e-7,1.3231485e-7,0.0000036166005,0.00037217012],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992785,0.00005099009,0.00019660719,0.00020093762,0.000109111454,0.00016385366],"domain_scores_gemma":[0.99934626,0.00019969192,0.00009115896,0.00032370165,0.000019852276,0.000019368294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003482891,0.000075833326,0.00012034977,0.00006264775,0.000064918975,0.000037025857,0.00051478634,0.000022723596,0.00000395756],"category_scores_gemma":[0.000030663752,0.00005924979,0.000022459724,0.00047263887,0.000045092693,0.00014012863,0.00045725226,0.0001400841,0.0000025104416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005924665,0.000014820053,0.119734794,0.000086694905,0.000007562632,0.0000021133083,0.0054560937,0.7394076,0.0007663508,0.07137022,0.00008464268,0.06306317],"study_design_scores_gemma":[0.00004296465,0.000016356904,0.002439902,0.00012985518,8.485074e-7,0.000007174011,0.00004652257,0.98958397,0.0015276249,0.006034554,0.000093194656,0.0000770059],"about_ca_topic_score_codex":0.000022773065,"about_ca_topic_score_gemma":0.000016209027,"teacher_disagreement_score":0.3114652,"about_ca_system_score_codex":0.000014097803,"about_ca_system_score_gemma":0.00004169765,"threshold_uncertainty_score":0.24161363},"labels":[],"label_agreement":null},{"id":"W3202113264","doi":"10.29007/8d9g","title":"Improved Algorithm for the Incremental Assignment Problem","year":2021,"lang":"en","type":"article","venue":"EPiC series in computing","topic":"Graph Theory 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":"Nipissing University; Laurentian University","funders":"","keywords":"Bipartite graph; Assignment problem; Hungarian algorithm; 3-dimensional matching; Matching (statistics); Algorithm; Blossom algorithm; Generalized assignment problem; Mathematics; Weapon target assignment problem; Graph; Quadratic assignment problem; Mathematical optimization; Computer science; Optimization problem; Combinatorics","score_opus":0.013691028802653672,"score_gpt":0.24790459229866338,"score_spread":0.23421356349600972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202113264","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024350036,0.0003194239,0.99431145,0.0011840113,0.0009459887,0.000299263,0.000002499761,0.000083964056,0.000418377],"genre_scores_gemma":[0.29754835,0.000010758845,0.7013317,0.0005783228,0.0002238936,0.00004344221,0.000004751938,0.000011285161,0.0002475141],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987819,0.00010687213,0.00027165635,0.00035524584,0.00014618048,0.00033813211],"domain_scores_gemma":[0.9990016,0.00044750946,0.0000817854,0.00037606954,0.00005610736,0.00003689188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008287977,0.00012785845,0.00014659647,0.000036498197,0.00033482016,0.00018202551,0.0006101018,0.000037390204,0.000012099674],"category_scores_gemma":[0.000044033666,0.000101262085,0.00007475558,0.00035962785,0.00006009872,0.00023961088,0.0005330121,0.0001493321,0.0000021695612],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000405803,0.0000708984,0.00019058182,0.000018769946,0.000036830177,0.00002456304,0.0016287414,0.00050666335,0.001055622,0.062032707,0.00010189735,0.9343287],"study_design_scores_gemma":[0.0007171787,0.000118022486,0.0005380735,0.000052779855,0.000006557155,0.00007218202,0.0010100317,0.9389655,0.01816041,0.03674424,0.0033751316,0.00023987867],"about_ca_topic_score_codex":0.000010395789,"about_ca_topic_score_gemma":0.000007563146,"teacher_disagreement_score":0.93845886,"about_ca_system_score_codex":0.000050142797,"about_ca_system_score_gemma":0.00006600224,"threshold_uncertainty_score":0.4129348},"labels":[],"label_agreement":null},{"id":"W4200324797","doi":"10.29007/xwl1","title":"ARCH-COMP 2021 Category Report: Falsification with Validation of Results","year":2021,"lang":"en","type":"article","venue":"EPiC series in computing","topic":"Physical Unclonable Functions (PUFs) and Hardware Security","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":"McMaster University","funders":"JST-Mirai Program; Core Research for Evolutional Science and Technology; Exploratory Research for Advanced Technology; National Science Foundation; Division of Civil, Mechanical and Manufacturing Innovation; Division of Industrial Innovation and Partnerships; Defense Advanced Research Projects Agency; ACT-X; Japan Society for the Promotion of Science; European Commission","keywords":"Novelty; Computer science; Competition (biology); Arch; Work (physics); Artificial intelligence; Software engineering; Engineering; Psychology","score_opus":0.0166020675808463,"score_gpt":0.2502045175981701,"score_spread":0.23360245001732377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200324797","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.5138463,0.00012138764,0.47121558,0.0016352824,0.00075944775,0.00017577385,0.0000052178875,0.00011854723,0.012122512],"genre_scores_gemma":[0.9726507,0.000008973596,0.026883762,0.0000380403,0.00014133655,0.0000043140776,0.00006308453,0.0000068329114,0.00020295446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99829596,0.0001579156,0.0005179859,0.00050582946,0.00029659495,0.00022570377],"domain_scores_gemma":[0.99836993,0.00024087644,0.00028262808,0.00074732356,0.0003108075,0.000048461872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054004474,0.00012333336,0.00023445001,0.00009749112,0.00012902416,0.00007378824,0.0003211531,0.00004733749,0.000009220465],"category_scores_gemma":[0.00032210382,0.00012006269,0.000047252375,0.0009982918,0.00007868694,0.00045710133,0.00024265952,0.0001912874,0.000006438318],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043125715,0.0026373735,0.03405776,0.00054023025,0.00021899927,0.002375664,0.024092974,0.060698614,0.016038734,0.6253725,0.0020117082,0.23152414],"study_design_scores_gemma":[0.005975002,0.0011090223,0.19827707,0.0012128211,0.000070445436,0.0019050966,0.0031904266,0.185597,0.45288914,0.11345357,0.03414891,0.0021714787],"about_ca_topic_score_codex":0.00014472968,"about_ca_topic_score_gemma":0.000057369012,"teacher_disagreement_score":0.51191896,"about_ca_system_score_codex":0.000058257454,"about_ca_system_score_gemma":0.0002186185,"threshold_uncertainty_score":0.48960143},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"bench_or_experimental","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"medium"}],"label_agreement":"split"},{"id":"W4232090923","doi":"10.29007/5sl4","title":"A One-Pass Tableau-Based Workflow Verification Framework","year":2018,"lang":"en","type":"article","venue":"EPiC series in computing","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":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":"Computer science; Debugging; Computation tree logic; Workflow; Temporal logic; Model checking; Programming language; Software engineering; Petri net; Workflow management system; Theoretical computer science; Database","score_opus":0.027899540374410888,"score_gpt":0.2546036855642765,"score_spread":0.2267041451898656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232090923","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.5143164,0.00021257317,0.4719147,0.004135053,0.0012384141,0.00018117522,6.578083e-7,0.0005179034,0.0074830996],"genre_scores_gemma":[0.97121084,0.0000033943222,0.024236528,0.0017865764,0.002657038,0.000007759434,0.00001863784,0.00002959493,0.00004961872],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861604,0.00001429675,0.00037273712,0.0003982589,0.00023854239,0.00036012704],"domain_scores_gemma":[0.999066,0.00007752508,0.000227117,0.00034672467,0.00027182684,0.000010810805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004959395,0.00017397238,0.00025880933,0.00029741062,0.000346105,0.00035286037,0.00031689188,0.00011540831,0.00017993999],"category_scores_gemma":[0.00039446217,0.00019232083,0.00006020454,0.0015882441,0.000117201474,0.00064342096,0.00011987861,0.00021498896,0.00016383371],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037751463,0.0006694771,0.2520255,0.001393849,0.00015001632,0.00002397433,0.0009949063,0.10707775,0.0006157835,0.08071671,0.0012962793,0.55465823],"study_design_scores_gemma":[0.00044265788,0.000013719175,0.01947044,0.0008468815,0.00005974023,7.009386e-7,0.00026250724,0.9332196,0.00020477516,0.035306625,0.009664149,0.00050816475],"about_ca_topic_score_codex":0.00030806215,"about_ca_topic_score_gemma":0.000073402225,"teacher_disagreement_score":0.8261419,"about_ca_system_score_codex":0.0000381603,"about_ca_system_score_gemma":0.000032949127,"threshold_uncertainty_score":0.7842616},"labels":[],"label_agreement":null},{"id":"W4311273059","doi":"10.29007/f57w","title":"Two Simulink Models with Requirements for a Simple Controller of a Pacemaker Device","year":2022,"lang":"en","type":"article","venue":"EPiC series in computing","topic":"Formal Methods in Verification","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":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Benchmark (surveying); Computer science; Controller (irrigation); Simple (philosophy); Software; Embedded system; Reliability engineering; Programming language; Engineering","score_opus":0.07123724100950812,"score_gpt":0.34587019364010924,"score_spread":0.2746329526306011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311273059","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.077019274,0.00006199288,0.92130846,0.00015995392,0.00021707789,0.0005256446,0.000003818294,0.0000650659,0.0006387208],"genre_scores_gemma":[0.5508987,4.864151e-7,0.44883707,0.00017006043,0.00002046393,0.000045163626,0.0000019018624,0.000007648812,0.000018514564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843156,0.00021015646,0.00042323835,0.00033971365,0.00030417443,0.00029113158],"domain_scores_gemma":[0.9988231,0.0003498123,0.00028396823,0.00040424144,0.00010733451,0.000031565825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001424897,0.00012217504,0.0002619104,0.00010579158,0.00022421767,0.000036639394,0.0004984554,0.000020700007,0.000007159815],"category_scores_gemma":[0.00013084593,0.00011938886,0.000043100983,0.0005261884,0.00004923559,0.00046107653,0.00049706607,0.00013970447,4.314993e-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.00026263113,0.00009499523,0.0013549202,0.000073979005,0.00003583141,0.000006674528,0.004449142,0.70255405,0.00028204705,0.26989746,0.000050583665,0.020937664],"study_design_scores_gemma":[0.001509059,0.0003141313,0.00022477341,0.000023061843,0.000004825083,0.000015708847,0.0004272547,0.9751215,0.00070589106,0.020709202,0.0008042854,0.00014028914],"about_ca_topic_score_codex":0.000032583066,"about_ca_topic_score_gemma":0.000009255398,"teacher_disagreement_score":0.4738794,"about_ca_system_score_codex":0.000103469276,"about_ca_system_score_gemma":0.000073455594,"threshold_uncertainty_score":0.48685366},"labels":[],"label_agreement":null},{"id":"W4311273067","doi":"10.29007/fhnk","title":"ARCH-COMP 2022 Category Report: Falsification with Ubounded Resources","year":2022,"lang":"en","type":"article","venue":"EPiC series in computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"JST-Mirai Program; Core Research for Evolutional Science and Technology; Exploratory Research for Advanced Technology; National Science Foundation; Division of Civil, Mechanical and Manufacturing Innovation; ACT-X; Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; Division of Industrial Innovation and Partnerships; Defense Advanced Research Projects Agency","keywords":"Comparability; Competition (biology); Arch; Computer science; Work (physics); Data science; Software engineering; Engineering; Civil engineering; Mathematics; Mechanical engineering","score_opus":0.02085790349343988,"score_gpt":0.2712023298882709,"score_spread":0.25034442639483107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311273067","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35892314,0.00025568838,0.6338502,0.0008161234,0.00090763,0.0002953535,9.0974646e-7,0.00033131812,0.0046195965],"genre_scores_gemma":[0.66837645,0.0000026829434,0.33111548,0.00013082824,0.00006784115,0.000030110874,0.000010236177,0.000013282045,0.00025306526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752617,0.00049114396,0.00047530117,0.000617688,0.00053637486,0.00035330295],"domain_scores_gemma":[0.99832004,0.00017157446,0.00038889062,0.0010053947,0.000062371095,0.000051725303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024305175,0.00015544168,0.00020735043,0.00018626516,0.0007432938,0.00013848003,0.0011920802,0.000034684377,0.0000486499],"category_scores_gemma":[0.0001627642,0.00016726927,0.00003633729,0.0009564,0.00014038154,0.00043951554,0.00075527595,0.00045180897,0.0000075944076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028654994,0.00071852456,0.050857548,0.00018949152,0.000089042274,0.0012875496,0.09557209,0.098191485,0.003011927,0.39055356,0.0018227925,0.35741943],"study_design_scores_gemma":[0.0015129299,0.001085465,0.15052804,0.00009058703,0.0000149843645,0.0043787197,0.0093983635,0.7032407,0.0025534637,0.03780273,0.08804655,0.0013474457],"about_ca_topic_score_codex":0.0002373543,"about_ca_topic_score_gemma":0.000036811936,"teacher_disagreement_score":0.60504925,"about_ca_system_score_codex":0.00019911467,"about_ca_system_score_gemma":0.00010425388,"threshold_uncertainty_score":0.6821043},"labels":[],"label_agreement":null},{"id":"W4353031949","doi":"10.29007/bbg7","title":"3D Objects Detection and Recognition from Color and LiDAR Data for Autonomous Driving","year":2023,"lang":"en","type":"article","venue":"EPiC series in computing","topic":"Advanced Neural Network Applications","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 Ottawa","funders":"","keywords":"Lidar; Computer vision; Computer science; Detector; Point cloud; Artificial intelligence; RGB color model; Object detection; Object (grammar); Field of view; Remote sensing; Geography; Pattern recognition (psychology)","score_opus":0.04800009858700535,"score_gpt":0.2942359108278875,"score_spread":0.24623581224088217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4353031949","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.58449954,0.00006573948,0.41439486,0.00026116462,0.00024080338,0.0002419858,0.000008930302,0.00025462735,0.000032359538],"genre_scores_gemma":[0.8185481,0.000035354176,0.1811279,0.0000701724,0.00013873572,0.000022568052,0.000037261987,0.000008740061,0.000011157815],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990451,0.000034546516,0.0001810052,0.00048422543,0.000058958693,0.00019617047],"domain_scores_gemma":[0.99867195,0.0008168686,0.000081553015,0.0003715568,0.00002245759,0.00003563264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024411482,0.00008772568,0.00011636942,0.00007198119,0.00024695354,0.00010374769,0.00028902738,0.00004051104,6.662836e-7],"category_scores_gemma":[0.00018788489,0.000100047444,0.000007729023,0.00039073807,0.000041354528,0.0005263636,0.00076240307,0.0000907045,0.0000035337246],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008253293,0.000008902391,0.0014725752,0.000021407628,0.000007624997,0.0000052095857,0.0010703178,0.0009235257,0.002231481,0.00034669373,0.000038702696,0.9938653],"study_design_scores_gemma":[0.00024154561,0.00005064214,0.018560817,0.000050338454,0.000004074163,0.000014384213,0.0001222772,0.9603505,0.0011092407,0.018333457,0.0010177457,0.00014498651],"about_ca_topic_score_codex":0.000025626621,"about_ca_topic_score_gemma":0.00017189958,"teacher_disagreement_score":0.9937203,"about_ca_system_score_codex":0.000025526757,"about_ca_system_score_gemma":0.0000144523165,"threshold_uncertainty_score":0.40798163},"labels":[],"label_agreement":null},{"id":"W4367595762","doi":"10.29007/2qhl","title":"An Association Analysis of Breast Cancer with Carotenoids.","year":2023,"lang":"en","type":"article","venue":"EPiC series in computing","topic":"Cancer, Lipids, and Metabolism","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":"MacEwan University; University of Alberta","funders":"","keywords":"Exposome; Breast cancer; Cancer; Medicine; Carcinogenesis; Oncology; Bioinformatics; Environmental health; Biology; Internal medicine","score_opus":0.006437992204812796,"score_gpt":0.2669787566759119,"score_spread":0.26054076447109914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367595762","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.99812925,0.00018733327,0.00023136515,0.00012298413,0.0010450357,0.000053600535,0.000049641167,0.000016939346,0.00016387842],"genre_scores_gemma":[0.99721295,0.00015898628,0.00023525048,0.000061690545,0.0020386707,0.0000053108,0.000109265944,0.000009579836,0.00016831646],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99933267,0.000045939276,0.00015360984,0.00019219065,0.00010787184,0.00016774448],"domain_scores_gemma":[0.99960285,0.000012830611,0.000108489025,0.00017201941,0.000076898,0.000026887848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023804513,0.00007287397,0.0001882787,0.000112341775,0.000038509086,0.000010187138,0.00009156714,0.00006484293,0.000013401442],"category_scores_gemma":[0.000023727505,0.00006901879,0.000049093054,0.0007010851,0.000026020587,0.000004812657,0.000039907667,0.00004885326,4.834455e-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.000097843564,0.000032192645,0.860467,0.000026350855,0.0005863387,2.5434252e-7,0.000879755,0.050616194,0.07213891,0.00006905112,0.0015464262,0.013539654],"study_design_scores_gemma":[0.00034028516,0.000062006795,0.9803339,0.000018038836,0.00015463342,0.0000017946295,0.00048504415,0.0036803845,0.004504334,0.000011752663,0.010264596,0.00014320691],"about_ca_topic_score_codex":0.0006980066,"about_ca_topic_score_gemma":0.0019077512,"teacher_disagreement_score":0.1198669,"about_ca_system_score_codex":0.000030926778,"about_ca_system_score_gemma":0.000058040772,"threshold_uncertainty_score":0.28145045},"labels":[],"label_agreement":null},{"id":"W4387735129","doi":"10.29007/6nqs","title":"ARCH-COMP23 Category Report: Falsification","year":2023,"lang":"en","type":"article","venue":"EPiC series in computing","topic":"Physical Unclonable Functions (PUFs) and Hardware Security","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"JST-Mirai Program; Core Research for Evolutional Science and Technology; ACT-X; Japan Society for the Promotion of Science; European Commission; Natural Sciences and Engineering Research Council of Canada; Defense Advanced Research Projects Agency; Electronic Components and Systems for European Leadership; Exploratory Research for Advanced Technology; Division of Civil, Mechanical and Manufacturing Innovation; National Science Foundation","keywords":"Benchmark (surveying); Arch; Computer science; Competition (biology); Temporal logic; Cyber-physical system; Software engineering; Data science; Artificial intelligence; Theoretical computer science; Engineering; Civil engineering","score_opus":0.024435908305366693,"score_gpt":0.27451885958359873,"score_spread":0.25008295127823205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387735129","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.5327868,0.00013509463,0.43070427,0.004845433,0.004313786,0.00042681184,0.0000033186886,0.0024639259,0.024320591],"genre_scores_gemma":[0.99324864,0.000011449843,0.005672498,0.0001417596,0.00030868954,0.000012696805,0.000027280174,0.0000115862385,0.0005654016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982181,0.00010747286,0.00041617983,0.00054490654,0.00028213594,0.00043119106],"domain_scores_gemma":[0.99871033,0.0002646872,0.00013344285,0.0007329353,0.0000821133,0.00007648501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007229895,0.00014946879,0.00021602854,0.00023173833,0.00027182561,0.00012452669,0.0006591649,0.000058880007,0.0000100823945],"category_scores_gemma":[0.00023960635,0.00015625088,0.00007015654,0.0016655372,0.000078903795,0.0005052234,0.0005194773,0.00026647997,0.00018349249],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021779826,0.00037778416,0.01532503,0.00014557724,0.000043824017,0.0011733915,0.008516927,0.0094790505,0.001570305,0.7733496,0.00939415,0.1806026],"study_design_scores_gemma":[0.00086577394,0.00019569631,0.18727355,0.0001490493,0.00000981173,0.00038943108,0.0007489095,0.46305326,0.0026220025,0.2529877,0.090694115,0.001010674],"about_ca_topic_score_codex":0.000161377,"about_ca_topic_score_gemma":0.000041757485,"teacher_disagreement_score":0.52036184,"about_ca_system_score_codex":0.00007815353,"about_ca_system_score_gemma":0.00008971426,"threshold_uncertainty_score":0.6371726},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"not_applicable","genre":"other","about_ca_system":false,"about_ca_topic":false,"confidence":"high"},{"model":"gpt","categories":[],"domain":null,"study_design":"design_other","genre":"other","about_ca_system":false,"about_ca_topic":false,"confidence":"low"}],"label_agreement":"split"},{"id":"W4393028968","doi":"10.29007/8cqg","title":"Data Security in the Cloud Using pTree-based Homomorphic Intrinsic Data Encryption System (pHIDES)","year":2024,"lang":"en","type":"article","venue":"EPiC series in computing","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":"University of Windsor","funders":"","keywords":"Homomorphic encryption; Computer science; Encryption; Cloud computing; Client-side encryption; Data security; Computer security; On-the-fly encryption; Operating system","score_opus":0.080960305153916,"score_gpt":0.3143764751420236,"score_spread":0.2334161699881076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393028968","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38139972,0.002839469,0.6090039,0.0015396719,0.0034364334,0.0005413642,0.00028965282,0.0007329748,0.00021678556],"genre_scores_gemma":[0.9750351,0.000016271779,0.024018673,0.0001560284,0.000486557,0.0000032039084,0.00026815268,0.000015832507,2.122162e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967776,0.0005880431,0.00060320814,0.0011271121,0.0004381569,0.0004658817],"domain_scores_gemma":[0.9951167,0.0008516371,0.00011676168,0.003831539,0.00003178582,0.00005157029],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.004247686,0.00024023135,0.00028714252,0.00034984213,0.0002474725,0.00083745405,0.0055886065,0.000102674116,0.0000064437254],"category_scores_gemma":[0.00019827743,0.00020542029,0.00004453047,0.00236541,0.00014308719,0.0019912876,0.0033704455,0.00064559263,0.0000166956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075797594,0.0004048818,0.020807182,0.0021038167,0.0000834784,0.0023233078,0.0130429985,0.0040772036,0.0001202677,0.8633246,0.0037500907,0.08988639],"study_design_scores_gemma":[0.00025709212,0.00002923635,0.0020244916,0.00072549365,0.000013250562,0.00016204239,0.00082889816,0.98486197,0.000021837966,0.005990329,0.0048275953,0.00025775647],"about_ca_topic_score_codex":0.00064636744,"about_ca_topic_score_gemma":0.0009091435,"teacher_disagreement_score":0.9807848,"about_ca_system_score_codex":0.00011832097,"about_ca_system_score_gemma":0.00021760809,"threshold_uncertainty_score":0.9997916},"labels":[],"label_agreement":null},{"id":"W4393057924","doi":"10.29007/zx61","title":"Bike sharing systems via birth-death process and simulation modelling","year":2024,"lang":"en","type":"article","venue":"EPiC series in computing","topic":"Transportation and Mobility Innovations","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":"Trent University; Ontario Tech University","funders":"","keywords":"Process (computing); Computer science; Operating system","score_opus":0.023927820477129387,"score_gpt":0.27270394397977177,"score_spread":0.2487761235026424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393057924","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.5748601,0.00048523082,0.4233313,0.00001630168,0.00040783774,0.000097682685,0.0000019083548,0.00041574173,0.00038392722],"genre_scores_gemma":[0.99866927,0.00001442948,0.0011531565,0.000007164351,0.00008368538,0.000006969972,0.000010715418,0.000021038011,0.000033602333],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993398,0.0000051677503,0.00027672164,0.0001676136,0.00007565617,0.00013501043],"domain_scores_gemma":[0.99978924,0.0000668088,0.000013207925,0.00008184781,0.000027762973,0.000021132568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015890483,0.00009196856,0.000102230035,0.00014350095,0.00005708493,0.00009894215,0.000048948532,0.000044772485,0.0000057567113],"category_scores_gemma":[0.0000065552445,0.000101856436,0.000012975605,0.00034039564,0.000012952102,0.00023316499,0.000008552148,0.00013764019,0.0000024172655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011775292,0.0000026114412,0.004382555,0.0005215249,0.000009356766,0.0000038438707,0.001985089,0.9863365,0.00004476553,0.004504289,8.6019935e-7,0.0022073868],"study_design_scores_gemma":[0.0000609772,0.000005142736,0.0015010951,0.00022330058,0.0000039354686,0.000004687694,0.0002520245,0.996543,0.000048699294,0.0008341224,0.0004191384,0.0001038933],"about_ca_topic_score_codex":0.000022989514,"about_ca_topic_score_gemma":0.000009897405,"teacher_disagreement_score":0.42380914,"about_ca_system_score_codex":0.000035964855,"about_ca_system_score_gemma":0.000008803208,"threshold_uncertainty_score":0.41535848},"labels":[],"label_agreement":null},{"id":"W4399036736","doi":"10.29007/c1jg","title":"A Tool for Reasoning about Trust and Belief","year":2024,"lang":"en","type":"article","venue":"EPiC series in computing","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":"British Columbia Institute of Technology","funders":"","keywords":"Computer science; Trustworthiness; Formalism (music); Belief revision; Focus (optics); Iterated function; Software; Human–computer interaction; Software engineering; Artificial intelligence; Computer security; Programming language; Mathematics","score_opus":0.012455717373192414,"score_gpt":0.2668661751472123,"score_spread":0.2544104577740199,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399036736","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37816,0.009358132,0.59258324,0.0008996958,0.0030532226,0.00045194398,0.0000026599348,0.0007978965,0.014693189],"genre_scores_gemma":[0.9125726,0.000033831268,0.08616111,0.00013241918,0.00039123464,0.000014381291,0.0000015184761,0.0000144760015,0.00067839114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987513,0.00004216327,0.00025216735,0.000480481,0.000104973326,0.0003689045],"domain_scores_gemma":[0.9991822,0.0004421575,0.00004209263,0.0002484015,0.000036236914,0.000048877126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064719503,0.00015137505,0.00020064991,0.00010716519,0.0002047301,0.00044438487,0.00036982808,0.00006757496,0.000006729971],"category_scores_gemma":[0.00028529306,0.0001393285,0.00005490761,0.0003550798,0.00006172581,0.00029485225,0.00036725882,0.00016374323,0.000008975442],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000086088285,0.000020869653,0.00782983,0.0002317745,0.0000213022,0.000057238594,0.008892435,0.00015913522,0.000059030284,0.6546722,0.00078860886,0.32725894],"study_design_scores_gemma":[0.0005602352,0.00021731947,0.016390169,0.0008072596,0.000010862661,0.00022072793,0.00026753175,0.9010716,0.00046586382,0.03161891,0.047847632,0.0005218712],"about_ca_topic_score_codex":0.000014631298,"about_ca_topic_score_gemma":0.000013698688,"teacher_disagreement_score":0.90091246,"about_ca_system_score_codex":0.000050496576,"about_ca_system_score_gemma":0.000070329945,"threshold_uncertainty_score":0.5681652},"labels":[],"label_agreement":null},{"id":"W4399036954","doi":"10.29007/rdbb","title":"Efficient Simulation for Hardware Model Checking","year":2024,"lang":"en","type":"article","venue":"EPiC series in computing","topic":"Software Testing and Debugging 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":"University of Waterloo","funders":"","keywords":"Computer science; Correctness; Executable; Model checking; Semantics (computer science); Programming language; Formal verification; Set (abstract data type); Speedup; Symbolic trajectory evaluation; Computer engineering; Parallel computing; Theoretical computer science","score_opus":0.043641389716917105,"score_gpt":0.33103879876707565,"score_spread":0.28739740905015854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399036954","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016612459,0.0002620738,0.9742263,0.00029301184,0.0005556115,0.00020223307,9.618702e-7,0.007550149,0.0002972265],"genre_scores_gemma":[0.6183277,4.2993486e-7,0.38147867,0.00006501054,0.00007270491,0.000009358452,0.0000012112852,0.000009817826,0.00003512056],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893534,0.000024103561,0.00025373788,0.00038445115,0.0001414533,0.0002608941],"domain_scores_gemma":[0.99871325,0.00088329025,0.000041820127,0.00028037225,0.000052987314,0.000028292487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006220936,0.0001183306,0.00013054551,0.00015713715,0.00013463646,0.00024288536,0.00035765575,0.000052232797,8.8864573e-7],"category_scores_gemma":[0.00046629156,0.000119058845,0.000057409856,0.00038554883,0.00002242156,0.00013070359,0.00022452835,0.0001266535,0.0000028314282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026127268,0.000008012116,0.00017933639,0.00006581711,0.0000027522806,0.0000061700284,0.0014033864,0.91815317,0.000012505134,0.011333442,0.00027315094,0.06855967],"study_design_scores_gemma":[0.00009481988,0.00002573935,0.00009207541,0.00030253603,0.0000019048289,0.000007871607,0.000006648887,0.9559586,0.00015396712,0.04293624,0.00028570642,0.00013386387],"about_ca_topic_score_codex":0.000008032932,"about_ca_topic_score_gemma":8.6483584e-7,"teacher_disagreement_score":0.6017152,"about_ca_system_score_codex":0.000085414045,"about_ca_system_score_gemma":0.00005961048,"threshold_uncertainty_score":0.48550788},"labels":[],"label_agreement":null},{"id":"W4403289443","doi":"10.29007/hgfv","title":"ARCH-COMP 2024 Category Report: Falsification","year":2024,"lang":"en","type":"article","venue":"EPiC series in computing","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":7,"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":"ACT-X; JST-Mirai Program; Exploratory Research for Advanced Technology; Electronic Components and Systems for European Leadership; Defense Advanced Research Projects Agency; Universität Salzburg; Alliance de recherche numérique du Canada; Japan Society for the Promotion of Science; Austrian Science Fund; Division of Civil, Mechanical and Manufacturing Innovation; European Commission; Technische Universität Wien; Core Research for Evolutional Science and Technology; National Science Foundation","keywords":"Benchmark (surveying); Arch; Competition (biology); Computer science; Software engineering; Data science; Artificial intelligence; Engineering; Civil engineering; Geography","score_opus":0.016761438070993426,"score_gpt":0.29554506268939496,"score_spread":0.2787836246184015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403289443","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023310808,0.00068768294,0.9537005,0.0021822976,0.0052808984,0.00015083792,3.344815e-7,0.00074397103,0.01394268],"genre_scores_gemma":[0.92166394,0.000008701184,0.07662903,0.000090184854,0.00047488842,0.000006391669,0.000006393703,0.000021493977,0.0010990025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979203,0.00017221434,0.0005233354,0.0007043467,0.00030041506,0.00037942565],"domain_scores_gemma":[0.9986911,0.00044147501,0.00011273317,0.0006538398,0.000043722765,0.00005717254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012439842,0.00018522545,0.00021357911,0.00027337656,0.0001751,0.00034217452,0.0008060817,0.00008011295,0.000027639402],"category_scores_gemma":[0.0003785394,0.00019071915,0.00006658433,0.00097032345,0.00008608417,0.00069447904,0.00061595556,0.0005988058,0.00006982544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009788376,0.00006791383,0.015203727,0.00027259166,0.000047240414,0.0033037812,0.00975739,0.122666225,0.00027480893,0.50921416,0.00203677,0.3371456],"study_design_scores_gemma":[0.00014353688,0.000042053045,0.005645029,0.00020950261,0.000005229732,0.0006687283,0.00023946023,0.9449988,0.00016994777,0.02661945,0.020932673,0.00032557797],"about_ca_topic_score_codex":0.00014330792,"about_ca_topic_score_gemma":0.000012828632,"teacher_disagreement_score":0.8983531,"about_ca_system_score_codex":0.00014016106,"about_ca_system_score_gemma":0.00013117693,"threshold_uncertainty_score":0.7777301},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"not_applicable","genre":"other","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":[],"domain":null,"study_design":"design_other","genre":"other","about_ca_system":false,"about_ca_topic":false,"confidence":"low"}],"label_agreement":"split"}]}