{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027307512,0.000047944293,0.9656186,0.00024974154,0.0001207434,0.00010573634,0.00038822123,0.017157588,0.013580578],"genre_scores_gemma":[0.124885716,0.00017364517,0.8347144,0.00074959465,0.00010876929,0.0005421645,0.002636493,0.010438457,0.025750646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99808514,0.00059457106,0.00019774224,0.0002811795,0.00062867225,0.00021265548],"domain_scores_gemma":[0.9979551,0.0007230178,0.00008166608,0.0008167145,0.00036118392,0.00006238863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002288598,0.00080270827,0.000519419,0.0010656711,0.0007113466,0.0024336583,0.0024264927,0.0009849834,0.02498026],"category_scores_gemma":[0.0056763957,0.00055910734,0.001291583,0.00067262235,0.001388288,0.0044377325,0.0033965688,0.0024189926,0.006633963],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046415135,0.00017249351,0.00078653474,0.00060688396,0.00006181989,0.00048423532,0.00088490313,0.015064658,0.00944224,0.6286503,0.0424613,0.30092043],"study_design_scores_gemma":[0.00018510326,0.00018568688,0.00025129376,0.00020275885,0.000097186465,0.0005463669,0.00028144076,0.17969,0.04347647,0.41476315,0.36023736,0.000083195795],"about_ca_topic_score_codex":0.0011561568,"about_ca_topic_score_gemma":0.0019209444,"teacher_disagreement_score":0.02498026,"about_ca_system_score_codex":0.00077719527,"about_ca_system_score_gemma":0.0014885722,"threshold_uncertainty_score":0.08356726},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006113223,0.00006492478,0.9699706,0.00020570416,0.000051329367,0.00016576593,0.00033847996,0.021458251,0.0016317427],"genre_scores_gemma":[0.12595592,0.00027987774,0.8557513,0.0003804247,0.00006215666,0.00035786701,0.0020890362,0.011275729,0.0038478079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99362034,0.00174479,0.0009873098,0.0007589738,0.0023082595,0.00058035005],"domain_scores_gemma":[0.9645505,0.01834213,0.0023508472,0.008262169,0.005909035,0.0005854041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009399225,0.0010488024,0.0010496306,0.0027698735,0.0012658078,0.006283093,0.0042564375,0.001623821,0.013741074],"category_scores_gemma":[0.030467905,0.002047631,0.002767218,0.00238672,0.002766976,0.009729772,0.005452377,0.0030844235,0.0040656636],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005545963,0.0006957812,0.004711102,0.0019678401,0.00026697604,0.0012128142,0.003615967,0.05468378,0.035210732,0.638599,0.01777206,0.24070944],"study_design_scores_gemma":[0.0004928243,0.00021623989,0.0011701178,0.0004977591,0.00024366193,0.0011571578,0.0008188757,0.35129595,0.16648473,0.2638179,0.21339366,0.00041110403],"about_ca_topic_score_codex":0.006182314,"about_ca_topic_score_gemma":0.0057537695,"teacher_disagreement_score":0.013741074,"about_ca_system_score_codex":0.0028363438,"about_ca_system_score_gemma":0.004948521,"threshold_uncertainty_score":0.049708426},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057071145,0.0016978312,0.9574679,0.003279992,0.0007886061,0.00014938052,0.0006138851,0.0009178218,0.029377485],"genre_scores_gemma":[0.23978108,0.0026949514,0.73795885,0.0028569703,0.0015357779,0.001007793,0.0018082905,0.0012763904,0.01107999],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944131,0.0019352157,0.0007732823,0.00070655457,0.0016672232,0.0005047264],"domain_scores_gemma":[0.990724,0.0052791615,0.00067088497,0.0013174337,0.0017444125,0.00026419605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054746303,0.0013869156,0.0011803657,0.0038372108,0.0025976445,0.007916825,0.0028473157,0.0028384093,0.010223901],"category_scores_gemma":[0.024616212,0.0011072446,0.002805231,0.0035355908,0.007507358,0.019962844,0.0050919903,0.0074059996,0.0028315452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071897534,0.0000056697672,0.000058920592,0.000051501553,0.0000058796904,0.000067247536,0.00024254997,0.0005288296,0.00019689633,0.99159735,0.0014706271,0.0057672844],"study_design_scores_gemma":[0.000009795882,0.0000072126436,0.0000328026,0.000049732702,0.000013823502,0.000079788704,0.000066586654,0.003739798,0.00044105403,0.9797515,0.015795752,0.000012123336],"about_ca_topic_score_codex":0.0015135183,"about_ca_topic_score_gemma":0.0016766032,"teacher_disagreement_score":0.010223901,"about_ca_system_score_codex":0.0029348652,"about_ca_system_score_gemma":0.0018574065,"threshold_uncertainty_score":0.034202337},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08299109,0.0016226901,0.835854,0.0067307143,0.0005134357,0.00012780499,0.00005854531,0.0023631523,0.069738485],"genre_scores_gemma":[0.79971355,0.00095539575,0.18866327,0.0007912944,0.00014649902,0.00018571405,0.000053055195,0.00024449022,0.009246661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999218,0.0002403007,0.000036598125,0.00013080119,0.0002574996,0.000116844574],"domain_scores_gemma":[0.9986456,0.00046150017,0.00008027961,0.000510492,0.0001370232,0.00016520527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012056195,0.00039112254,0.00034032747,0.00049982534,0.0010774697,0.002809195,0.0011747355,0.0014488872,0.002195815],"category_scores_gemma":[0.0039927675,0.0003180626,0.00043230684,0.00040725467,0.0055118273,0.0055869524,0.0031792843,0.0027664562,0.00048457115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009324846,0.000037247646,0.0005040262,0.00007095444,0.000016036338,0.0001778471,0.00082261465,0.019469181,0.006292531,0.9362487,0.0023065233,0.03396112],"study_design_scores_gemma":[0.00006143396,0.00017237583,0.00048449833,0.0000937978,0.000028700057,0.00034384456,0.0004281805,0.18875712,0.015523905,0.69012874,0.10390739,0.00007011089],"about_ca_topic_score_codex":0.0011627,"about_ca_topic_score_gemma":0.0007433234,"teacher_disagreement_score":0.002809195,"about_ca_system_score_codex":0.001090715,"about_ca_system_score_gemma":0.00095948495,"threshold_uncertainty_score":0.007913768},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41682106,0.011244763,0.4808237,0.0023793078,0.0011505932,0.00081648503,0.0030735286,0.05554081,0.02814977],"genre_scores_gemma":[0.47846472,0.0016931819,0.5036344,0.0007484093,0.00020354555,0.0004514314,0.0054241735,0.0058530043,0.0035271177],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9946051,0.0018070607,0.00064882525,0.0011903016,0.0011773546,0.0005714115],"domain_scores_gemma":[0.9828919,0.010544079,0.00085143064,0.004105806,0.0013046812,0.0003020794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037529508,0.0031644579,0.0016790847,0.0025053082,0.0007801418,0.002812443,0.0034466756,0.0020446535,0.012626928],"category_scores_gemma":[0.024370542,0.0012664691,0.00212763,0.003630066,0.0011611013,0.004922833,0.0024178387,0.004814596,0.005246538],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032607776,0.0013899528,0.005221515,0.0037746204,0.00056362763,0.0004938172,0.0003650021,0.22473569,0.07724642,0.013199311,0.026830748,0.64291865],"study_design_scores_gemma":[0.0011299584,0.0017971379,0.0034890098,0.0005249996,0.00056646694,0.0007374484,0.0005303029,0.7283712,0.18972225,0.034251776,0.038629387,0.00025009704],"about_ca_topic_score_codex":0.0015776204,"about_ca_topic_score_gemma":0.0028741346,"teacher_disagreement_score":0.012626928,"about_ca_system_score_codex":0.0010202485,"about_ca_system_score_gemma":0.0026580063,"threshold_uncertainty_score":0.042241216},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053614765,0.0005640286,0.9192846,0.0009594898,0.00017958987,0.0002761057,0.00064293033,0.006639011,0.017839432],"genre_scores_gemma":[0.2774155,0.00021141325,0.7118306,0.0005809306,0.000048958766,0.00020013952,0.00095101865,0.0006221733,0.0081392545],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984276,0.00047646233,0.00010243195,0.00026232455,0.0004905234,0.00024066954],"domain_scores_gemma":[0.995654,0.0024155115,0.00018312229,0.00091652176,0.00066511956,0.00016567642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013959875,0.0008042499,0.0007739415,0.0012164621,0.0006848495,0.0014945576,0.0017107943,0.0012107048,0.009414186],"category_scores_gemma":[0.00590654,0.0005292716,0.0008498572,0.0020863723,0.0014411398,0.0022777696,0.002294913,0.0022222088,0.0012104788],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005544418,0.00058747083,0.0023417813,0.00059445493,0.000084940904,0.00033307413,0.000292447,0.36792108,0.015237289,0.12387916,0.01974449,0.4684294],"study_design_scores_gemma":[0.0003396354,0.00015172713,0.0002528637,0.000055259567,0.000052062376,0.00012693027,0.0000921371,0.8548134,0.014006723,0.11470421,0.015364571,0.000040519622],"about_ca_topic_score_codex":0.0056033237,"about_ca_topic_score_gemma":0.018809492,"teacher_disagreement_score":0.009414186,"about_ca_system_score_codex":0.0012971052,"about_ca_system_score_gemma":0.0037189035,"threshold_uncertainty_score":0.031493604},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36836058,0.007196546,0.38605055,0.0072294027,0.00068140466,0.0001159267,0.00089163025,0.00038247457,0.22909151],"genre_scores_gemma":[0.94430524,0.0020546438,0.03769587,0.00051323767,0.0006006526,0.00011336351,0.00029129337,0.00005174493,0.014373976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860126,0.0004249479,0.000106370695,0.00029441406,0.000417841,0.00015513213],"domain_scores_gemma":[0.9980683,0.0008576114,0.00014532651,0.00030299075,0.00032169552,0.00030411518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017667506,0.0004685886,0.00061278784,0.0011752392,0.0016566347,0.0038594182,0.0005692128,0.0008501018,0.0036123353],"category_scores_gemma":[0.002535941,0.00032011754,0.00088403677,0.0010480868,0.0055195536,0.006967256,0.003714038,0.0017683231,0.0004962473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072811713,0.000002704717,0.00013232711,0.000019280207,0.0000029553003,0.000027941276,0.00018811118,0.00028776465,0.00025834548,0.997486,0.0003045584,0.0012826599],"study_design_scores_gemma":[0.000006098909,0.000019750103,0.00031637136,0.000010378226,0.0000046524824,0.00008419091,0.000119365366,0.0015459965,0.00030198903,0.9910793,0.006501661,0.000010286048],"about_ca_topic_score_codex":0.00062311237,"about_ca_topic_score_gemma":0.00048262152,"teacher_disagreement_score":0.0038594182,"about_ca_system_score_codex":0.0014300492,"about_ca_system_score_gemma":0.0005994813,"threshold_uncertainty_score":0.012084484},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008725524,0.0037287422,0.9252786,0.003205857,0.0011274897,0.00017610115,0.00038838753,0.001593484,0.055775855],"genre_scores_gemma":[0.33700868,0.0019711177,0.626122,0.0028813903,0.0011398483,0.0004781234,0.0006681895,0.00081690936,0.02891376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99626714,0.0011068038,0.00022719768,0.00077500823,0.0013235821,0.00030027417],"domain_scores_gemma":[0.9921749,0.004222912,0.0004030728,0.0016757877,0.0011333174,0.00038996356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036863238,0.00068992644,0.0005624833,0.002010277,0.0018929193,0.0036554034,0.0017838412,0.0019286374,0.012632821],"category_scores_gemma":[0.011164184,0.0007264671,0.0013472781,0.0012231289,0.005831661,0.0075987936,0.004783415,0.005256951,0.0027464426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016911381,0.000007010031,0.00004800168,0.00005590358,0.000004048406,0.000043166776,0.00014903414,0.00035440378,0.00051274005,0.9892167,0.0014626945,0.008129542],"study_design_scores_gemma":[0.000012790328,0.000016972377,0.000059577764,0.00004992719,0.0000103414395,0.000121883146,0.00003593971,0.00318429,0.0010665435,0.9495132,0.045914304,0.000014281274],"about_ca_topic_score_codex":0.0014728653,"about_ca_topic_score_gemma":0.0011400203,"teacher_disagreement_score":0.012632821,"about_ca_system_score_codex":0.002553611,"about_ca_system_score_gemma":0.001543121,"threshold_uncertainty_score":0.042261004},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041452837,0.00025892784,0.98106766,0.0020066458,0.00011495619,0.00007666297,0.0001792679,0.00035008157,0.011800478],"genre_scores_gemma":[0.29284582,0.00087967,0.6941772,0.0017378078,0.00047478697,0.00043357778,0.0005855368,0.00018189497,0.008683746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99801195,0.0007168108,0.00016540902,0.00031895342,0.00059576787,0.00019112356],"domain_scores_gemma":[0.9978503,0.0010495015,0.00021909481,0.0002574141,0.00039602444,0.0002276434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003625998,0.00067787484,0.0006434614,0.0016225808,0.0019058735,0.0041303025,0.0024892571,0.0015841578,0.004906704],"category_scores_gemma":[0.005466298,0.00062109914,0.0026731014,0.0015081363,0.005651909,0.009953588,0.0057088784,0.0047445423,0.0014083143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010834712,0.000016096708,0.00007305676,0.000043383512,0.0000064347455,0.00006358157,0.00021100377,0.0027131885,0.00037806644,0.99036133,0.00066742266,0.005455585],"study_design_scores_gemma":[0.000015277901,0.000018412873,0.0000420076,0.00002089911,0.0000113649685,0.0000619847,0.000084667794,0.020525968,0.00045530617,0.9684854,0.010264726,0.000014073669],"about_ca_topic_score_codex":0.0036509652,"about_ca_topic_score_gemma":0.0027643773,"teacher_disagreement_score":0.004906704,"about_ca_system_score_codex":0.002569582,"about_ca_system_score_gemma":0.0020726102,"threshold_uncertainty_score":0.019176364},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047683874,0.0003727988,0.97328985,0.0030532847,0.00008216847,0.00009027781,0.00017744768,0.0005051747,0.017660618],"genre_scores_gemma":[0.12969218,0.0008265192,0.859529,0.0010816534,0.00024219963,0.0003422426,0.0005230704,0.0001872486,0.0075759143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964813,0.0013243455,0.00021303173,0.0004312665,0.0012904535,0.00025965192],"domain_scores_gemma":[0.9968238,0.00168609,0.00016159442,0.0006871363,0.0004625254,0.00017890931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062735844,0.0010512322,0.00090196094,0.0016381042,0.0015056088,0.0050922898,0.0037013823,0.0024704824,0.004459137],"category_scores_gemma":[0.0067878678,0.0011712232,0.0027506838,0.0015299808,0.008858999,0.008712801,0.005922343,0.008308306,0.0013963066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006145105,0.000013845144,0.00005913938,0.000045775265,0.000005810644,0.000049665276,0.0002224171,0.006388281,0.0003656949,0.9871622,0.0007794366,0.0049016443],"study_design_scores_gemma":[0.00001143821,0.000009826484,0.000025976466,0.000041891773,0.0000069664125,0.000031205724,0.0000923957,0.040680733,0.00040508222,0.9455976,0.013088254,0.0000085913525],"about_ca_topic_score_codex":0.0040711197,"about_ca_topic_score_gemma":0.0036507049,"teacher_disagreement_score":0.0062735844,"about_ca_system_score_codex":0.003414586,"about_ca_system_score_gemma":0.002931712,"threshold_uncertainty_score":0.03317827},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010924788,0.001653946,0.8597693,0.0014482988,0.00033846867,0.00019189522,0.0006467027,0.0008057446,0.124220856],"genre_scores_gemma":[0.39033893,0.0020744165,0.5579329,0.0015025239,0.00091098103,0.00074668456,0.0017628723,0.00039619068,0.044334404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99454606,0.0014352271,0.0004756347,0.0011311405,0.002018432,0.0003934383],"domain_scores_gemma":[0.9979113,0.000574577,0.00023657785,0.00035669663,0.00067797984,0.00024289663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003566167,0.0006484576,0.0008092013,0.0024407476,0.0024342523,0.0056350026,0.0021250087,0.0010548974,0.014396301],"category_scores_gemma":[0.0034897963,0.0006307227,0.0017941146,0.0037780292,0.0045174435,0.008667378,0.00514898,0.0036872993,0.0023629463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009414705,0.000009114818,0.000056565914,0.00003634727,0.000010302666,0.000040726274,0.00012672429,0.0004442125,0.00029378533,0.9923304,0.0007897973,0.00585275],"study_design_scores_gemma":[0.000022517708,0.000024359199,0.00011210137,0.000031298237,0.000027541531,0.00015480186,0.00010756847,0.009531293,0.000979829,0.9404902,0.048495296,0.000023293638],"about_ca_topic_score_codex":0.0023628867,"about_ca_topic_score_gemma":0.0020139702,"teacher_disagreement_score":0.014396301,"about_ca_system_score_codex":0.0024545032,"about_ca_system_score_gemma":0.0021812515,"threshold_uncertainty_score":0.048160434},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032876175,0.0005575981,0.9391212,0.0012189883,0.0002365171,0.00014872258,0.00060104055,0.0041286172,0.02111115],"genre_scores_gemma":[0.6242487,0.00061651994,0.36400738,0.00097447867,0.000325359,0.00018814503,0.0012443248,0.0010067341,0.007388405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9936452,0.0015210236,0.0007395514,0.0011277081,0.0022049625,0.0007616034],"domain_scores_gemma":[0.9843163,0.0069450433,0.0007551045,0.005341569,0.002152414,0.0004897134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059523494,0.00075821974,0.00092470756,0.0022929932,0.0014329691,0.0040241387,0.0031538876,0.0010283431,0.009721697],"category_scores_gemma":[0.014578385,0.0009308042,0.0023258387,0.0014924628,0.003541265,0.011923928,0.007979244,0.0031257248,0.0015784152],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000101398335,0.000048725607,0.0007195954,0.00021903627,0.000055131262,0.00041031776,0.0006098178,0.0021117756,0.0058353385,0.9442852,0.0022844903,0.04331918],"study_design_scores_gemma":[0.000081997394,0.00009756134,0.00041861946,0.00014732727,0.00012604802,0.0006790242,0.00026442014,0.029709827,0.022426277,0.8856831,0.060312543,0.00005315955],"about_ca_topic_score_codex":0.00096942624,"about_ca_topic_score_gemma":0.0010392126,"teacher_disagreement_score":0.009721697,"about_ca_system_score_codex":0.0013101764,"about_ca_system_score_gemma":0.0020785993,"threshold_uncertainty_score":0.03252232},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029063284,0.001682691,0.9016178,0.0024932371,0.00018673047,0.00025041736,0.0018038821,0.0017261751,0.061175797],"genre_scores_gemma":[0.3643856,0.003121116,0.613207,0.00032895504,0.00008363523,0.0007378738,0.001975622,0.00028863165,0.015871586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955887,0.00016379064,0.000028721855,0.00008024291,0.000113854956,0.000054429293],"domain_scores_gemma":[0.99936885,0.0003922645,0.00006304394,0.00008090449,0.00005834471,0.000036581245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064682035,0.00079955236,0.00042014243,0.00063175533,0.00066615996,0.0016478326,0.001541995,0.0012739811,0.004632943],"category_scores_gemma":[0.0019111943,0.0005268531,0.001079194,0.0010739026,0.0018296594,0.0017801159,0.0014062392,0.0011300471,0.0006406069],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027762293,0.0000241111,0.00022472355,0.00014018198,0.000011734361,0.000085333595,0.00008224511,0.7634425,0.00058589556,0.22082862,0.001482074,0.013064796],"study_design_scores_gemma":[0.00004290827,0.00002397911,0.000109597895,0.000036894187,0.000014859476,0.00004525365,0.000069421665,0.7758993,0.0014935387,0.19307104,0.029178655,0.000014624331],"about_ca_topic_score_codex":0.019800965,"about_ca_topic_score_gemma":0.021956403,"teacher_disagreement_score":0.019800965,"about_ca_system_score_codex":0.0020547095,"about_ca_system_score_gemma":0.0028600092,"threshold_uncertainty_score":0.03937143},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047756184,0.000247265,0.86083066,0.000496055,0.00026218305,0.00047716196,0.0013998474,0.071837686,0.016692959],"genre_scores_gemma":[0.3505546,0.00020378851,0.6209667,0.0005462184,0.00008641664,0.0005454007,0.0032282812,0.013499551,0.010369054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954668,0.00089420425,0.00032272565,0.0004946997,0.002399846,0.00042160158],"domain_scores_gemma":[0.9931636,0.002842583,0.00034290174,0.002483607,0.0009327314,0.00023464377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030964615,0.00062126043,0.0006556351,0.0011676607,0.00092349196,0.0022414033,0.0024036705,0.0010114566,0.011863642],"category_scores_gemma":[0.010695877,0.0007617485,0.0014086645,0.0007611872,0.0019682222,0.0040999427,0.0038582857,0.0035660246,0.003027265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002580676,0.0011614836,0.00651752,0.0018952545,0.00020545431,0.00095929933,0.00246598,0.03773665,0.089997105,0.43650037,0.047231767,0.37274846],"study_design_scores_gemma":[0.00059689867,0.0007928203,0.0017261808,0.0002536519,0.0001645574,0.0010312328,0.00048872805,0.32893005,0.3252487,0.15798321,0.18257594,0.00020805636],"about_ca_topic_score_codex":0.0012218481,"about_ca_topic_score_gemma":0.001807419,"teacher_disagreement_score":0.011863642,"about_ca_system_score_codex":0.0011937647,"about_ca_system_score_gemma":0.0023406902,"threshold_uncertainty_score":0.039687872},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4754834,0.0011039551,0.44278845,0.005197965,0.0003732704,0.00061478734,0.009912844,0.0022107558,0.06231458],"genre_scores_gemma":[0.915816,0.00026106063,0.07294387,0.0002558131,0.000036732,0.00030070025,0.0019441367,0.00012569803,0.008316135],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947995,0.0001859221,0.00002926713,0.00008033389,0.00013632195,0.000088220855],"domain_scores_gemma":[0.9964587,0.0025651916,0.00017177143,0.00015428904,0.00052993203,0.000120183235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011526429,0.0008633804,0.00066192204,0.00047294365,0.00067994883,0.0012691729,0.0010528568,0.002235914,0.007748282],"category_scores_gemma":[0.0071685896,0.0003444489,0.00074545265,0.0004724908,0.00060228753,0.0008572829,0.00071480894,0.0014403475,0.0005017208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000113726295,0.00008624268,0.00096563593,0.00012224879,0.00002052626,0.00022923619,0.000039210136,0.9811379,0.00057340565,0.0091264425,0.0021881822,0.005397323],"study_design_scores_gemma":[0.00004836654,0.000047519065,0.00028492438,0.000010037739,0.0000094373745,0.000031485077,0.000022530832,0.9944997,0.00062716077,0.0031339517,0.0012779532,0.0000068859736],"about_ca_topic_score_codex":0.024308726,"about_ca_topic_score_gemma":0.01136854,"teacher_disagreement_score":0.024308726,"about_ca_system_score_codex":0.0014327167,"about_ca_system_score_gemma":0.0022036582,"threshold_uncertainty_score":0.04833448},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015817836,0.000105820734,0.9778471,0.00047026484,0.00003996744,0.00011709234,0.00008851095,0.0010502639,0.004463236],"genre_scores_gemma":[0.5472808,0.00042040314,0.4445056,0.00077650754,0.00019513829,0.0005133718,0.0003758789,0.00093887455,0.004993337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9850627,0.004785087,0.001123624,0.0030130108,0.004949792,0.0010657919],"domain_scores_gemma":[0.95651275,0.028763197,0.0019256312,0.009137384,0.0028752752,0.0007857773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010388721,0.0009921025,0.0011362053,0.0014957594,0.0019305724,0.003103054,0.0022052096,0.0013664126,0.004429692],"category_scores_gemma":[0.0412915,0.001503976,0.0032935212,0.0011102454,0.0073977215,0.011397125,0.010848653,0.0053783604,0.0010517841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016024543,0.00012767609,0.0011735262,0.0002671696,0.00009655161,0.0003612497,0.0012445145,0.011031615,0.007982466,0.93956804,0.0012629157,0.036724035],"study_design_scores_gemma":[0.000096940836,0.00008827439,0.00029223054,0.00006270741,0.00010308419,0.0004079739,0.00011962608,0.05158261,0.031489275,0.9061494,0.009551709,0.000056225785],"about_ca_topic_score_codex":0.0013308529,"about_ca_topic_score_gemma":0.0008133166,"teacher_disagreement_score":0.010388721,"about_ca_system_score_codex":0.0014888084,"about_ca_system_score_gemma":0.0029044335,"threshold_uncertainty_score":0.054941416},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.124454096,0.005495015,0.65534514,0.002926005,0.0018730407,0.000072563394,0.00021854107,0.00050059764,0.20911503],"genre_scores_gemma":[0.832687,0.0028694621,0.13864176,0.0011509745,0.0006018506,0.00013757742,0.00014362259,0.00012428053,0.023643507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998047,0.000038266284,0.000016755737,0.00004275195,0.000063171115,0.000034401597],"domain_scores_gemma":[0.99978215,0.000051101084,0.00003198025,0.00007442698,0.00004098404,0.000019400039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025851192,0.00042468111,0.00029433827,0.00058397796,0.00072412123,0.0016384544,0.0005312088,0.0009024681,0.0036640498],"category_scores_gemma":[0.0007033019,0.00019029008,0.0006085833,0.00028926344,0.0014960656,0.0030314384,0.0012135244,0.0011330778,0.00094581774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034948257,0.0000057974685,0.000045450055,0.000019450903,0.0000017752141,0.000045588535,0.000083984116,0.0013554854,0.0018821392,0.99313354,0.00042352153,0.0029996939],"study_design_scores_gemma":[0.000004615898,0.000039088285,0.0002385686,0.000024997325,0.0000048159372,0.0002795458,0.00006138394,0.01682564,0.003127758,0.94735277,0.03202103,0.000019781868],"about_ca_topic_score_codex":0.00027095847,"about_ca_topic_score_gemma":0.00027263223,"teacher_disagreement_score":0.0036640498,"about_ca_system_score_codex":0.0005763914,"about_ca_system_score_gemma":0.00021491274,"threshold_uncertainty_score":0.012257457},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038507964,0.00069433684,0.855122,0.0004056699,0.00043751745,0.00025461506,0.0014917937,0.09116041,0.011925702],"genre_scores_gemma":[0.15479447,0.00043209235,0.8274221,0.00029828862,0.000059203827,0.00040122587,0.003045004,0.006930817,0.006616812],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999676,0.00004324794,0.000014395021,0.00009011539,0.00011941902,0.000056792636],"domain_scores_gemma":[0.99964166,0.000093776514,0.000030349953,0.000083618164,0.000114816656,0.000035765486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051388814,0.0013639156,0.00068931293,0.0005417071,0.00051218097,0.00077758636,0.0020681196,0.00070105447,0.0071390904],"category_scores_gemma":[0.0017211188,0.00046312687,0.0007918831,0.0009352085,0.00036626696,0.00065092265,0.00095418515,0.0011622842,0.00263229],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012778036,0.0003551745,0.008425546,0.0010399165,0.00042811222,0.00043551807,0.00040125402,0.19626904,0.069395304,0.029744225,0.14751177,0.5447163],"study_design_scores_gemma":[0.00015818051,0.0000806909,0.00090125954,0.000020478132,0.00003643759,0.00011045285,0.000022659964,0.9404629,0.019102573,0.0046622506,0.034404304,0.000037809397],"about_ca_topic_score_codex":0.018993316,"about_ca_topic_score_gemma":0.019103346,"teacher_disagreement_score":0.018993316,"about_ca_system_score_codex":0.0009115465,"about_ca_system_score_gemma":0.0017292671,"threshold_uncertainty_score":0.037765503},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026752593,0.000040184455,0.96896523,0.000087939916,0.000012756394,0.00008348183,0.00021485522,0.0028359483,0.0010069816],"genre_scores_gemma":[0.5445611,0.00013049094,0.45178127,0.0000671049,0.000028239438,0.00033293947,0.00091112865,0.00053581654,0.001651923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99739194,0.00076142035,0.0001440134,0.00033091803,0.0011565915,0.00021503368],"domain_scores_gemma":[0.99404657,0.003799014,0.00042859564,0.001090178,0.0005660684,0.00006952565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017479339,0.0008044492,0.00060710014,0.0012775041,0.00083311123,0.0013532941,0.001142898,0.00090348255,0.0031713801],"category_scores_gemma":[0.008448223,0.0005881856,0.0019024035,0.00044753167,0.0013407328,0.0019121979,0.0017705356,0.0012680794,0.000374644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010795415,0.00013164953,0.0031184496,0.00020572633,0.00007716142,0.0004767123,0.0003740122,0.78784907,0.020166399,0.122599736,0.0014400695,0.06345307],"study_design_scores_gemma":[0.000012402331,0.000015820855,0.000166268,0.00001537526,0.000011972928,0.000030591502,0.000017631168,0.9530467,0.006515957,0.03896445,0.00119412,0.000008874374],"about_ca_topic_score_codex":0.0039338525,"about_ca_topic_score_gemma":0.0043260823,"teacher_disagreement_score":0.0039338525,"about_ca_system_score_codex":0.0012373568,"about_ca_system_score_gemma":0.002674298,"threshold_uncertainty_score":0.010609329},"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":"dataset","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060666878,0.067638524,0.13376044,0.025367822,0.030360641,0.012125682,0.26259375,0.20778093,0.19970527],"genre_scores_gemma":[0.038959295,0.005305135,0.104405545,0.005562577,0.0037980753,0.0044135656,0.7802992,0.013879731,0.043376982],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.96604276,0.010033994,0.002192189,0.0045986488,0.013428652,0.003703776],"domain_scores_gemma":[0.9643918,0.0065141246,0.00088016194,0.0067731626,0.015773596,0.005667115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.028978122,0.005845866,0.0044808784,0.017769033,0.005292596,0.013668068,0.010414809,0.0061076414,0.048843566],"category_scores_gemma":[0.045907527,0.0020652893,0.0038999263,0.012884654,0.0020468272,0.013192668,0.013376384,0.007318138,0.06528703],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00089794694,0.0010796405,0.0015148458,0.0017933722,0.0002961533,0.0001617215,0.00020698072,0.0024086682,0.0033859706,0.0025570875,0.8830244,0.1026733],"study_design_scores_gemma":[0.00080589013,0.00068592536,0.0041623083,0.0004788668,0.00024244147,0.00050107646,0.00042570158,0.019262653,0.008314131,0.006548439,0.9583176,0.0002549488],"about_ca_topic_score_codex":0.03258332,"about_ca_topic_score_gemma":0.054525435,"teacher_disagreement_score":0.048843566,"about_ca_system_score_codex":0.0061165052,"about_ca_system_score_gemma":0.0131021505,"threshold_uncertainty_score":0.16339797},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04320721,0.0013362282,0.8410518,0.013343174,0.0018198534,0.0009564604,0.0010213703,0.01128293,0.08598095],"genre_scores_gemma":[0.6396599,0.0010642123,0.30910268,0.004984403,0.002813168,0.0015761869,0.0034813338,0.005442688,0.031875417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9636646,0.009292623,0.0026014312,0.0072895302,0.012894062,0.004257655],"domain_scores_gemma":[0.9156056,0.0508673,0.0035943543,0.019452486,0.007671869,0.002808415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016877053,0.001549132,0.0021972354,0.0046529453,0.0040456136,0.010331902,0.0055338056,0.0067408984,0.03470284],"category_scores_gemma":[0.11365013,0.0020474137,0.0036734005,0.0050506326,0.013953125,0.03157539,0.018550284,0.009987789,0.0067911125],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060107635,0.0001482778,0.00269357,0.00039283582,0.00010754323,0.000839558,0.0013504061,0.008670279,0.0013647641,0.9131056,0.01576303,0.054963015],"study_design_scores_gemma":[0.000084293446,0.000053512154,0.00024940833,0.00010072646,0.000055934706,0.00021157383,0.00036121343,0.05016283,0.0023784041,0.9317231,0.014580598,0.000038263],"about_ca_topic_score_codex":0.0059532444,"about_ca_topic_score_gemma":0.0053979247,"teacher_disagreement_score":0.03470284,"about_ca_system_score_codex":0.0025324912,"about_ca_system_score_gemma":0.0067762886,"threshold_uncertainty_score":0.11609256},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14624931,0.0010605801,0.8223335,0.0009744574,0.00025778392,0.0003529034,0.00043997006,0.018489351,0.009842088],"genre_scores_gemma":[0.52432543,0.00030106583,0.4701031,0.00039218596,0.000065790846,0.00027939267,0.0008623962,0.0009375665,0.0027329715],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99736685,0.0008947984,0.00019137708,0.00042704525,0.00074331136,0.00037658212],"domain_scores_gemma":[0.98932916,0.005336556,0.00080979685,0.0032252944,0.0010317778,0.00026736807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002452307,0.0014223108,0.0011485323,0.001633613,0.0008231339,0.001579961,0.0040435814,0.0010233456,0.009236298],"category_scores_gemma":[0.018919913,0.0011283101,0.0011623717,0.0018507597,0.0014129754,0.004698896,0.004284681,0.0028035212,0.001883764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018865684,0.0004549293,0.007873099,0.0010097211,0.00021158466,0.00039029086,0.0006555647,0.14542764,0.058715243,0.06520959,0.0144136315,0.70375216],"study_design_scores_gemma":[0.0004011214,0.00069239613,0.00095395965,0.00010628927,0.00019801928,0.00024284396,0.00019969573,0.82776606,0.07753012,0.08024389,0.011591158,0.00007436225],"about_ca_topic_score_codex":0.00239424,"about_ca_topic_score_gemma":0.0053341277,"teacher_disagreement_score":0.009236298,"about_ca_system_score_codex":0.0011302114,"about_ca_system_score_gemma":0.0029755405,"threshold_uncertainty_score":0.030898511},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.998944,0.000054822656,0.00036668868,0.000015008863,0.0000017983901,0.000016249433,0.00017164026,0.00001968009,0.00041010886],"genre_scores_gemma":[0.9987739,0.000031467247,0.000569181,0.0000069377706,0.0000022366999,0.00002219407,0.00041036287,0.0000096680415,0.0001740987],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9957694,0.0012839002,0.00046687905,0.0005069533,0.0015989516,0.00037394426],"domain_scores_gemma":[0.89916474,0.080527216,0.0077621173,0.003408885,0.007920199,0.0012169253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032459265,0.0005171859,0.0003701284,0.0017315833,0.00030663368,0.0009153917,0.00065465353,0.00059363147,0.0012362441],"category_scores_gemma":[0.03469907,0.00027737409,0.00041479804,0.0026256295,0.00061999314,0.0017770207,0.0005698541,0.0006516352,0.00026497146],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019692616,0.002657322,0.8858658,0.00049906847,0.00031543933,0.00040883565,0.0009283797,0.03563078,0.01215749,0.0004548429,0.000987137,0.058125608],"study_design_scores_gemma":[0.00002747565,0.002477097,0.92642826,0.000031925818,0.000108241635,0.00027510402,0.0011766693,0.059380185,0.009036747,0.00024322176,0.00077140704,0.000043658732],"about_ca_topic_score_codex":0.0025991376,"about_ca_topic_score_gemma":0.0031442526,"teacher_disagreement_score":0.0032459265,"about_ca_system_score_codex":0.00064263004,"about_ca_system_score_gemma":0.00032844648,"threshold_uncertainty_score":0.017166257},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9826974,0.00070844404,0.009570971,0.00023763126,0.00005900889,0.00003069114,0.0018400578,0.0012087757,0.0036469768],"genre_scores_gemma":[0.9775262,0.00025717638,0.016181208,0.000055373934,0.000023361114,0.00003806408,0.0050249957,0.0001864708,0.0007072084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862933,0.0002955408,0.00007563201,0.00042593246,0.00035237335,0.00022123082],"domain_scores_gemma":[0.9951186,0.0029503934,0.00050011865,0.0006417769,0.0006237048,0.00016533516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014171622,0.0007924088,0.00042147224,0.0010569849,0.00035962914,0.0009192637,0.0011736193,0.00064085115,0.0020057],"category_scores_gemma":[0.009021695,0.000508918,0.00063513435,0.002268468,0.0005224175,0.0011930651,0.00047432314,0.0010923237,0.00055617874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048335633,0.00016264383,0.035719022,0.00021810319,0.00015451752,0.00016281112,0.00007157895,0.9037925,0.0052859657,0.002126691,0.008378781,0.043444082],"study_design_scores_gemma":[0.00003999852,0.00020462618,0.014876895,0.000017333676,0.000033630393,0.000051032333,0.000060423787,0.97427183,0.006707371,0.0018870402,0.0018336319,0.000016223308],"about_ca_topic_score_codex":0.006401822,"about_ca_topic_score_gemma":0.009421757,"teacher_disagreement_score":0.006401822,"about_ca_system_score_codex":0.0012403246,"about_ca_system_score_gemma":0.00083140936,"threshold_uncertainty_score":0.012729168},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037369449,0.000108254,0.9942154,0.00013820922,0.00001661589,0.00003977655,0.000042639964,0.00017562578,0.0015265482],"genre_scores_gemma":[0.26811308,0.0010285872,0.7271978,0.00023657233,0.00015729581,0.00048407938,0.00034275436,0.00023226115,0.0022075078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955734,0.0018109428,0.00031243367,0.0004099657,0.0015164132,0.000376762],"domain_scores_gemma":[0.984861,0.010990224,0.0009271909,0.0013407614,0.0017094138,0.00017141193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077188364,0.0012497511,0.0006470892,0.0021337902,0.00073553884,0.002990741,0.0023621786,0.0010606651,0.0027073708],"category_scores_gemma":[0.017550694,0.0006916852,0.0033316368,0.001271083,0.003831428,0.0032744624,0.0022086452,0.0026588447,0.00065254717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029188344,0.00009729263,0.0007350963,0.00033037437,0.000055681518,0.00042815637,0.00047253788,0.31946847,0.004610797,0.6493096,0.000953201,0.02350965],"study_design_scores_gemma":[0.000022929677,0.00003412155,0.00017078112,0.000103403065,0.000042085092,0.00009297392,0.00006350267,0.6241963,0.0044934712,0.36531857,0.0054371934,0.000024665631],"about_ca_topic_score_codex":0.0033742017,"about_ca_topic_score_gemma":0.0018545832,"teacher_disagreement_score":0.0077188364,"about_ca_system_score_codex":0.0023815164,"about_ca_system_score_gemma":0.002781101,"threshold_uncertainty_score":0.040821552},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083406106,0.0004572298,0.90746105,0.00024764787,0.000090837864,0.0001596981,0.00003618795,0.0042811534,0.0038601286],"genre_scores_gemma":[0.45065176,0.00035392548,0.5435884,0.0001424433,0.000058930702,0.00019944225,0.00013349546,0.00020469293,0.0046669827],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997217,0.00004558223,0.000031240404,0.000048382946,0.00010190669,0.000051215276],"domain_scores_gemma":[0.99931693,0.0001288234,0.00010119925,0.00014953184,0.00022290213,0.0000805583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004917556,0.00043197605,0.0003405303,0.00062061247,0.00059568294,0.0009287011,0.00149848,0.00063925143,0.0016085875],"category_scores_gemma":[0.0011784812,0.00040162745,0.00032968973,0.00047184993,0.00059038313,0.00080222887,0.0007595989,0.00071808073,0.0005048359],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000608596,0.00027007898,0.0047187386,0.0005655888,0.00017040946,0.0010355124,0.0008720338,0.26653478,0.22329204,0.074188985,0.009313401,0.41842985],"study_design_scores_gemma":[0.00015959184,0.0009393779,0.0017250029,0.000067127745,0.00016869284,0.0005301602,0.00013262236,0.89309746,0.05374661,0.015574541,0.033791382,0.00006748283],"about_ca_topic_score_codex":0.0025049949,"about_ca_topic_score_gemma":0.0045901933,"teacher_disagreement_score":0.0025049949,"about_ca_system_score_codex":0.0006026553,"about_ca_system_score_gemma":0.0013904183,"threshold_uncertainty_score":0.0053812265},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39759102,0.0068987263,0.50959456,0.0046287286,0.0034547918,0.0004521319,0.004477348,0.04406158,0.028841227],"genre_scores_gemma":[0.6809331,0.0009245788,0.2878215,0.0018386585,0.00029141217,0.00029186567,0.007877603,0.0030156497,0.017005652],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921167,0.00016873187,0.00006914316,0.0002158021,0.00019467092,0.00014001096],"domain_scores_gemma":[0.9982486,0.0006448047,0.00012599489,0.00051408337,0.00035821303,0.000108370514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013858658,0.0012547361,0.0006228897,0.0007082951,0.00062232243,0.0012357469,0.002048734,0.0009093419,0.011166553],"category_scores_gemma":[0.007227363,0.00044617627,0.0005349503,0.00072352553,0.00094739196,0.003588617,0.0013524372,0.001684662,0.0035452126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023242556,0.0003977002,0.008737935,0.00091899396,0.00024234154,0.00092993147,0.00045384062,0.06348788,0.033002045,0.028451798,0.09378138,0.76727194],"study_design_scores_gemma":[0.0002458958,0.001026282,0.0034763087,0.0002572938,0.00017190979,0.00072664855,0.00042550077,0.75582606,0.09058056,0.058653466,0.08850267,0.000107452084],"about_ca_topic_score_codex":0.0050464147,"about_ca_topic_score_gemma":0.01612796,"teacher_disagreement_score":0.011166553,"about_ca_system_score_codex":0.0007230631,"about_ca_system_score_gemma":0.0015034819,"threshold_uncertainty_score":0.03735578},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054483738,0.000540368,0.93983066,0.0006173374,0.00020755445,0.000044610897,0.00022305087,0.002797602,0.0012550005],"genre_scores_gemma":[0.77343214,0.00040758267,0.22202824,0.00020751594,0.00017789792,0.0001054671,0.000698205,0.00035711992,0.0025858323],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989961,0.00026719095,0.0000688156,0.0001996109,0.00037581826,0.000092445334],"domain_scores_gemma":[0.99290574,0.0045479904,0.00041303496,0.0007971067,0.0012191115,0.00011688825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030580056,0.0012258372,0.00091249635,0.0007131766,0.0006076197,0.0009427906,0.0011133093,0.00095891056,0.0021864832],"category_scores_gemma":[0.01236647,0.00054239173,0.0007194047,0.0009231753,0.0005601029,0.0021676372,0.0012457168,0.0025786636,0.0007075995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036925616,0.00013936585,0.0053249053,0.00008575753,0.00010789466,0.00013374502,0.00011988746,0.79543346,0.006394868,0.004328337,0.0039261817,0.18363632],"study_design_scores_gemma":[0.0000046691,0.000017913873,0.0004330142,0.000005640556,0.0000056827844,0.000010844651,0.000008624411,0.99620545,0.0014773522,0.0015360569,0.00029034598,0.0000043579025],"about_ca_topic_score_codex":0.013632065,"about_ca_topic_score_gemma":0.013345853,"teacher_disagreement_score":0.013632065,"about_ca_system_score_codex":0.0008241353,"about_ca_system_score_gemma":0.0013797625,"threshold_uncertainty_score":0.02710545},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6588987,0.025890037,0.28726703,0.006903618,0.0007475497,0.00040441263,0.0016388899,0.0008840668,0.017365742],"genre_scores_gemma":[0.95572996,0.004248972,0.036632154,0.00047097701,0.00080751406,0.00016696495,0.0010239466,0.000118424774,0.00080103474],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9789619,0.0077457456,0.0015652217,0.0037088336,0.006988555,0.0010297656],"domain_scores_gemma":[0.51991343,0.42340815,0.033781823,0.008032373,0.013259016,0.0016052042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.023824869,0.0011383849,0.0015018878,0.008425708,0.0016356162,0.005268331,0.0011409683,0.0014593906,0.0012821254],"category_scores_gemma":[0.21737394,0.00063725165,0.0007161143,0.009774987,0.0029703535,0.012799969,0.0032735455,0.0024828552,0.0002811985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014910396,0.00032432567,0.57066745,0.0009734253,0.00070943293,0.00175989,0.0018340949,0.07116405,0.002186189,0.04814918,0.0076258425,0.2931151],"study_design_scores_gemma":[0.00009835586,0.0011961355,0.1897836,0.00097481476,0.0008812179,0.0073334253,0.0045346175,0.46979538,0.00699025,0.30208394,0.016026756,0.00030151417],"about_ca_topic_score_codex":0.0014602419,"about_ca_topic_score_gemma":0.0013195876,"teacher_disagreement_score":0.023824869,"about_ca_system_score_codex":0.002116668,"about_ca_system_score_gemma":0.0011871329,"threshold_uncertainty_score":0.12599945},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21619482,0.0002715543,0.7530537,0.001334407,0.00008653231,0.00015801616,0.00037124683,0.0003672014,0.028162532],"genre_scores_gemma":[0.9440742,0.000091704766,0.046800364,0.00010745859,0.00001690041,0.00014372585,0.0002067541,0.000056932095,0.008501891],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996631,0.00009283795,0.000011068061,0.00007703256,0.00008459113,0.00007138344],"domain_scores_gemma":[0.9989956,0.00057245686,0.00012153269,0.000055809018,0.00013166733,0.00012278669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069762545,0.00080562214,0.0006291743,0.00057694677,0.0007714825,0.0012516928,0.00092015974,0.0026319155,0.0033583401],"category_scores_gemma":[0.0029037693,0.0003106472,0.00064412656,0.00023517551,0.001764957,0.0009287423,0.0021468543,0.0012775151,0.00024411082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086809894,0.000034880064,0.00054599054,0.000067401925,0.0000161051,0.0003022779,0.0001037894,0.9055489,0.0021543086,0.08696128,0.0008253017,0.0033529631],"study_design_scores_gemma":[0.000013062054,0.000035184334,0.00008903364,0.000010413401,0.0000030821109,0.00003181733,0.00004072935,0.98182136,0.00072333607,0.016519427,0.00070311414,0.0000095381565],"about_ca_topic_score_codex":0.0055018333,"about_ca_topic_score_gemma":0.0022702126,"teacher_disagreement_score":0.0055018333,"about_ca_system_score_codex":0.001324408,"about_ca_system_score_gemma":0.0012379433,"threshold_uncertainty_score":0.01123476},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.997537,0.000058638692,0.000500806,0.00015497582,0.0000073047463,0.000023381608,0.001072623,0.000009628739,0.00063575536],"genre_scores_gemma":[0.9980926,0.00004600286,0.0006714587,0.000045425262,0.0000043150103,0.000018082797,0.0009606143,0.0000041003664,0.00015738448],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916744,0.00035939005,0.00007696353,0.00016085523,0.00011013168,0.0001252657],"domain_scores_gemma":[0.99098957,0.0038056332,0.002783491,0.0006802301,0.0011823734,0.0005586111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028416773,0.0002280098,0.00019062386,0.0013843271,0.00075536605,0.0007186061,0.0004330354,0.00046926696,0.0020069745],"category_scores_gemma":[0.012564286,0.00017320178,0.00044512126,0.0013620452,0.0003564359,0.00054220174,0.00049821736,0.00079082587,0.0003256056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002361012,0.00005655634,0.99714905,0.0000046954306,0.000016797452,0.000012880636,0.00012823268,0.00015662807,0.00003436065,0.000045186986,0.0003695217,0.0020023992],"study_design_scores_gemma":[0.0000028574002,0.00005865479,0.99252456,0.000019194502,0.000020081336,0.000046356017,0.0012200013,0.005484754,0.00009210198,0.00012372182,0.00040197888,0.0000059135323],"about_ca_topic_score_codex":0.04937785,"about_ca_topic_score_gemma":0.08307622,"teacher_disagreement_score":0.04937785,"about_ca_system_score_codex":0.00048235818,"about_ca_system_score_gemma":0.0007122549,"threshold_uncertainty_score":0.09818089},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019788003,0.0019588028,0.8119889,0.0062724627,0.00022845506,0.00032035797,0.0011110342,0.00088875735,0.15744317],"genre_scores_gemma":[0.44133466,0.0029541429,0.52415204,0.001847865,0.00037035096,0.0008918485,0.0018463923,0.00021988338,0.026382793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985336,0.00043301572,0.0001292843,0.00037629847,0.00034755006,0.00018025596],"domain_scores_gemma":[0.99903935,0.0002035468,0.00009048267,0.00036191102,0.00016099267,0.00014364407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014792335,0.0006711355,0.0005494496,0.0014423034,0.0014381915,0.0042049023,0.0018203425,0.0020269125,0.00560944],"category_scores_gemma":[0.0016002923,0.00042701227,0.0013573703,0.0015503746,0.0060258317,0.0076176403,0.002534628,0.0022661996,0.0011609243],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025962077,0.000004624834,0.00007922602,0.000019287923,0.0000034163304,0.000024386336,0.00013861622,0.0011130073,0.00013823497,0.99600935,0.0005374076,0.0019298043],"study_design_scores_gemma":[0.000014170265,0.000023380959,0.00028497534,0.000055682587,0.000015361973,0.00013585518,0.00020288996,0.014545558,0.00023229019,0.9162167,0.06825536,0.000017691273],"about_ca_topic_score_codex":0.005639312,"about_ca_topic_score_gemma":0.0044346643,"teacher_disagreement_score":0.005639312,"about_ca_system_score_codex":0.0018698223,"about_ca_system_score_gemma":0.0021434624,"threshold_uncertainty_score":0.01876551},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036845834,0.0001944793,0.9894035,0.00017800515,0.00011804602,0.00012645166,0.00010173155,0.00073409243,0.005459045],"genre_scores_gemma":[0.07752409,0.00030735924,0.9129355,0.00021338784,0.00013247442,0.00046933218,0.0007477546,0.00028006642,0.0073900498],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986009,0.00033096797,0.00009293294,0.00031016607,0.00043541653,0.0002296014],"domain_scores_gemma":[0.99881315,0.000366237,0.000075422045,0.00023137656,0.00044824177,0.00006555324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010494195,0.0011420018,0.0011577052,0.0014744751,0.0011363779,0.0012685987,0.003196075,0.0013588448,0.012992401],"category_scores_gemma":[0.0037655872,0.00044348682,0.0011059954,0.0020392498,0.0007117141,0.002617294,0.0023827222,0.0023465178,0.0033744916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031794247,0.0002573916,0.00077072106,0.00033809475,0.000076729426,0.0002423058,0.00022532459,0.21677913,0.0056342976,0.1276084,0.03358217,0.6141676],"study_design_scores_gemma":[0.00012856048,0.00012750734,0.00025195995,0.000035945282,0.000048386086,0.0003344132,0.0000669036,0.89743793,0.0031868755,0.06638978,0.03195076,0.000040947965],"about_ca_topic_score_codex":0.0032753542,"about_ca_topic_score_gemma":0.0030262936,"teacher_disagreement_score":0.012992401,"about_ca_system_score_codex":0.0008763336,"about_ca_system_score_gemma":0.0022895008,"threshold_uncertainty_score":0.043463945},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11091497,0.0065962276,0.27102938,0.02340113,0.031618398,0.004749195,0.121464536,0.1275637,0.30266252],"genre_scores_gemma":[0.32959372,0.0014997126,0.20771785,0.006508431,0.003010457,0.0036029539,0.26273838,0.04820253,0.13712601],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9219511,0.021028059,0.0033400217,0.0062201074,0.041747473,0.005713278],"domain_scores_gemma":[0.81362253,0.04778877,0.005156309,0.05052072,0.074230604,0.008680977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.06261049,0.00352644,0.0019046963,0.0058096554,0.004252432,0.014195696,0.0060095885,0.0060951496,0.05426424],"category_scores_gemma":[0.09574836,0.0011834094,0.002579872,0.0032711164,0.0036171575,0.005367197,0.010105658,0.005877451,0.044016615],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034212752,0.0010072998,0.005457134,0.001216473,0.00024207584,0.0006874319,0.0007659822,0.009972168,0.006781883,0.029929636,0.84824735,0.09227125],"study_design_scores_gemma":[0.0009446104,0.0020039664,0.007133042,0.000738492,0.00017429309,0.0012202673,0.0012499975,0.03326058,0.05138672,0.032625835,0.8688669,0.00039526497],"about_ca_topic_score_codex":0.0070085893,"about_ca_topic_score_gemma":0.0065530124,"teacher_disagreement_score":0.06261049,"about_ca_system_score_codex":0.006168898,"about_ca_system_score_gemma":0.009123452,"threshold_uncertainty_score":0.3311199},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015996506,0.00003936553,0.99482465,0.00011193403,0.000018394332,0.00012511521,0.00008772834,0.0015155113,0.0016776372],"genre_scores_gemma":[0.09296913,0.00015992498,0.9024741,0.00013434504,0.000027413535,0.00026235412,0.00030962276,0.00027081952,0.0033923218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968388,0.00076606753,0.00026309828,0.00063166895,0.0011741368,0.00032621986],"domain_scores_gemma":[0.99619436,0.0021816895,0.00024587195,0.0006424026,0.00062702846,0.00010869044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042656534,0.0010497016,0.00082605093,0.0015660475,0.0013316186,0.0033409835,0.0031907733,0.0014061695,0.0068663335],"category_scores_gemma":[0.0076470384,0.001054246,0.002504217,0.0010032108,0.003480815,0.0036359485,0.0017680033,0.0023263863,0.0016987313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015352189,0.0001514855,0.00057748414,0.00030621127,0.00007414056,0.00072232645,0.0005758304,0.18570502,0.011022923,0.7121521,0.002521314,0.086037666],"study_design_scores_gemma":[0.00007632027,0.00011022742,0.000106461586,0.00009851967,0.000083943334,0.00018655391,0.000059884078,0.6998055,0.018417945,0.26231894,0.018664401,0.000071209375],"about_ca_topic_score_codex":0.017820798,"about_ca_topic_score_gemma":0.013093639,"teacher_disagreement_score":0.017820798,"about_ca_system_score_codex":0.00347457,"about_ca_system_score_gemma":0.007936406,"threshold_uncertainty_score":0.035434127},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44392458,0.0004458794,0.5187839,0.0004603195,0.00019742362,0.00046612308,0.0025073101,0.0068845414,0.026329916],"genre_scores_gemma":[0.93901247,0.00012203866,0.054023776,0.000069490714,0.000009256624,0.00026176052,0.0012234935,0.00026210924,0.0050154952],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998684,0.0003499118,0.00009958562,0.00018898121,0.00053953694,0.00013803868],"domain_scores_gemma":[0.99782205,0.0012179473,0.00025430435,0.00026827917,0.00036644243,0.00007096674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007396054,0.001146888,0.00039410213,0.0005579556,0.00028159018,0.00083706283,0.0012282231,0.0011802871,0.0047243475],"category_scores_gemma":[0.0033296992,0.0002937896,0.000658791,0.00022399331,0.00042224396,0.00065512076,0.00045669082,0.0008120783,0.0005387273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015496396,0.0004941577,0.0037985859,0.0010134489,0.00011932473,0.0013450854,0.0007270874,0.85748845,0.0654236,0.031226946,0.002556402,0.03425728],"study_design_scores_gemma":[0.0002849872,0.000739221,0.0013738362,0.00006998346,0.00009469557,0.00030494528,0.00010973957,0.9215575,0.05612641,0.0039081154,0.015390622,0.00004002923],"about_ca_topic_score_codex":0.0035238774,"about_ca_topic_score_gemma":0.0032873438,"teacher_disagreement_score":0.0047243475,"about_ca_system_score_codex":0.00055851165,"about_ca_system_score_gemma":0.0007592215,"threshold_uncertainty_score":0.01580453},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09424745,0.006164929,0.17153668,0.017442927,0.02623155,0.0026756318,0.16486493,0.12362336,0.3932126],"genre_scores_gemma":[0.25835255,0.0015483015,0.14766318,0.0049348935,0.0019974334,0.0023045053,0.38044694,0.036322642,0.16642955],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9670776,0.007140775,0.0013383682,0.0030694187,0.017894467,0.0034793746],"domain_scores_gemma":[0.9327696,0.016147673,0.0017914502,0.018336726,0.025647126,0.0053074234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.026384315,0.0026856202,0.0017627002,0.005952384,0.003740003,0.012320133,0.0049367035,0.004163505,0.06295916],"category_scores_gemma":[0.04131593,0.00091566565,0.002367787,0.0036370025,0.0025554844,0.0060948404,0.008365132,0.005161822,0.04791172],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025232644,0.00076333486,0.0034282652,0.00088665297,0.0001381156,0.00033024608,0.000321315,0.006499574,0.004299442,0.032259297,0.8742803,0.07427027],"study_design_scores_gemma":[0.0008442702,0.0015186324,0.0050899433,0.00049341936,0.00013506938,0.00085699034,0.0010386286,0.031496227,0.039036956,0.03695839,0.88227594,0.00025555122],"about_ca_topic_score_codex":0.009884736,"about_ca_topic_score_gemma":0.011269022,"teacher_disagreement_score":0.06295916,"about_ca_system_score_codex":0.005271978,"about_ca_system_score_gemma":0.0067266994,"threshold_uncertainty_score":0.21061939},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09390471,0.0007871634,0.8988382,0.00020819437,0.00009690602,0.00008959471,0.00029322391,0.0043682386,0.0014137431],"genre_scores_gemma":[0.46327877,0.00050792226,0.5335338,0.00014376204,0.00002768348,0.000088265675,0.00069805526,0.00018679028,0.0015348752],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996333,0.000038602815,0.000011750076,0.00006089302,0.0002152314,0.000040122053],"domain_scores_gemma":[0.99962056,0.00008722204,0.000036001606,0.000038750415,0.00019229288,0.000025162792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048717659,0.0005480708,0.0005107365,0.0014170241,0.00024466234,0.0006631397,0.0007536548,0.00067366066,0.0011752408],"category_scores_gemma":[0.00081904733,0.0004539804,0.0004864979,0.0008576979,0.00021397976,0.00077225704,0.00056600623,0.00045079787,0.0008623452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025378366,0.00017039041,0.005496149,0.00014804397,0.00009800583,0.00019699166,0.00013931989,0.044333823,0.24678472,0.0018227884,0.0041686315,0.69638735],"study_design_scores_gemma":[0.000012695241,0.00008851046,0.0048370636,0.00001432526,0.000027521592,0.000237944,0.000055173754,0.8789911,0.10953229,0.0012167179,0.0049453713,0.00004128786],"about_ca_topic_score_codex":0.0042719566,"about_ca_topic_score_gemma":0.005581447,"teacher_disagreement_score":0.0042719566,"about_ca_system_score_codex":0.0004185241,"about_ca_system_score_gemma":0.00069523905,"threshold_uncertainty_score":0.008494198},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9656563,0.0044941027,0.01514707,0.00085338444,0.00018503141,0.00009586156,0.008392831,0.00015388464,0.005021501],"genre_scores_gemma":[0.9853849,0.0010196884,0.007851289,0.00008619862,0.000037302918,0.000047948488,0.0024076134,0.00001902064,0.0031460458],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99887687,0.0005321135,0.000068356174,0.00019525486,0.00025921522,0.00006823249],"domain_scores_gemma":[0.99721825,0.001693087,0.0003726845,0.00030730455,0.00025875837,0.00014990044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001929189,0.00018857059,0.00027501181,0.0017680336,0.00036713164,0.00045934774,0.00022571484,0.00022215482,0.0031269584],"category_scores_gemma":[0.0044225436,0.00013616598,0.0013324998,0.002133914,0.00015961062,0.0001750021,0.00035566927,0.00043177741,0.00036821526],"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.00084391184,0.0001233493,0.9593289,0.00013149435,0.001750281,0.0005147078,0.00009397979,0.00083446864,0.004780826,0.00060078275,0.0013478344,0.029649397],"study_design_scores_gemma":[0.00004455863,0.00045446726,0.9840842,0.000021442806,0.0013797784,0.0012648203,0.00015761967,0.002708564,0.0023832137,0.0009671088,0.00651713,0.000017063543],"about_ca_topic_score_codex":0.005323106,"about_ca_topic_score_gemma":0.007804179,"teacher_disagreement_score":0.005323106,"about_ca_system_score_codex":0.00021760978,"about_ca_system_score_gemma":0.0007465898,"threshold_uncertainty_score":0.010584235},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07165765,0.0058636605,0.18259285,0.02421292,0.023848617,0.002762308,0.22981416,0.10486669,0.3543811],"genre_scores_gemma":[0.24391453,0.0021355895,0.09673135,0.0068821767,0.0026075093,0.0019907611,0.4821198,0.023189897,0.14042845],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9733925,0.006268633,0.0010771686,0.0026447084,0.014424291,0.0021927168],"domain_scores_gemma":[0.9162331,0.023431428,0.0024750384,0.020609101,0.03300473,0.0042466335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019641304,0.0029539217,0.0016006497,0.00440285,0.0034238852,0.009612543,0.005081551,0.0050396672,0.076015994],"category_scores_gemma":[0.045069534,0.0009388309,0.0026603003,0.003190147,0.0021617594,0.006853102,0.0067871353,0.0053478857,0.05132535],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021546464,0.0007161994,0.002770971,0.0010118663,0.00013358302,0.00033874626,0.00017957347,0.012734863,0.0032410906,0.03279,0.89185065,0.052077893],"study_design_scores_gemma":[0.00089257315,0.0013373201,0.003124783,0.0005007471,0.00014605463,0.000960791,0.0007356043,0.056441337,0.031261366,0.059759643,0.84459203,0.00024779706],"about_ca_topic_score_codex":0.012545097,"about_ca_topic_score_gemma":0.011092086,"teacher_disagreement_score":0.076015994,"about_ca_system_score_codex":0.0064267595,"about_ca_system_score_gemma":0.0077390233,"threshold_uncertainty_score":0.2542988},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09852886,0.0018063834,0.88324463,0.00089781557,0.00017696091,0.00031141512,0.00031285704,0.0013541107,0.013367014],"genre_scores_gemma":[0.820536,0.0012388405,0.17239577,0.00022736672,0.000054726024,0.00013449673,0.0002906138,0.000046986046,0.0050752605],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990452,0.00021375694,0.00008901839,0.00013411914,0.00037395707,0.00014398395],"domain_scores_gemma":[0.99913687,0.00015994474,0.00013461917,0.00035799746,0.00016446607,0.00004615907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006452368,0.00026929448,0.00037780698,0.0005201579,0.00059688545,0.0012714906,0.0006767536,0.00045324836,0.0015830639],"category_scores_gemma":[0.0013703828,0.00014827131,0.00048702842,0.0007082111,0.0006305721,0.002824369,0.0014063477,0.00082700554,0.00054549164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012550859,0.00033213408,0.0063188,0.0007134673,0.00020744972,0.0018932128,0.0010657654,0.04634337,0.20171428,0.28649437,0.0139697725,0.43969226],"study_design_scores_gemma":[0.00023048946,0.0012624217,0.0039700554,0.00022319137,0.00011049016,0.0069032293,0.00066600804,0.49684608,0.3247381,0.0689186,0.09593754,0.00019378428],"about_ca_topic_score_codex":0.0007071058,"about_ca_topic_score_gemma":0.0006804049,"teacher_disagreement_score":0.0015830639,"about_ca_system_score_codex":0.00071196345,"about_ca_system_score_gemma":0.0009244089,"threshold_uncertainty_score":0.0052958727},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30032226,0.00112182,0.67964685,0.00079346076,0.000121383804,0.00018742647,0.0002824618,0.00034356426,0.01718085],"genre_scores_gemma":[0.9737916,0.0005816696,0.020819517,0.00006694404,0.000032366497,0.00014997492,0.00010778374,0.000035234734,0.0044148555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989862,0.00051327486,0.00004295913,0.00011244827,0.00019350747,0.00015159171],"domain_scores_gemma":[0.9972378,0.002087403,0.00023894577,0.00013596528,0.0002083528,0.00009151743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00127686,0.00078188896,0.0012017613,0.0008222606,0.0009867704,0.0017960148,0.0014138159,0.001758962,0.0029235915],"category_scores_gemma":[0.004894232,0.00047705421,0.00091706956,0.00094615616,0.0011184056,0.002224845,0.0014882527,0.0011790375,0.00032496333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026037234,0.000024058423,0.000530148,0.00001673588,0.000016952108,0.00006335891,0.00006547014,0.9826089,0.00035480357,0.01503415,0.00008391195,0.0011754506],"study_design_scores_gemma":[0.0000043301684,0.000011570529,0.00007758346,0.0000035150345,0.0000042968804,0.000014831188,0.000019072268,0.9965109,0.00011003849,0.003067229,0.0001704113,0.0000061799005],"about_ca_topic_score_codex":0.014140875,"about_ca_topic_score_gemma":0.0063325693,"teacher_disagreement_score":0.014140875,"about_ca_system_score_codex":0.001298238,"about_ca_system_score_gemma":0.0010390849,"threshold_uncertainty_score":0.02811712},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00091959717,0.0000613499,0.9918608,0.00021738028,0.00004323748,0.000097113574,0.00024463926,0.005423148,0.0011327512],"genre_scores_gemma":[0.043533094,0.00014603783,0.95194274,0.00020455073,0.000071995775,0.00032285939,0.00076143164,0.0007701064,0.0022471063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9918107,0.0023674478,0.0013886676,0.001340276,0.0025846632,0.0005082823],"domain_scores_gemma":[0.97841966,0.013837209,0.0015454234,0.003619911,0.0019906955,0.000587157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00906287,0.0017203449,0.0017149795,0.0045590536,0.0024099513,0.00831664,0.00462497,0.0034778388,0.013717932],"category_scores_gemma":[0.036075003,0.0021369073,0.00468559,0.0032212392,0.0036896595,0.012079655,0.006099435,0.0049969805,0.003398301],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048733436,0.0002306584,0.0035418419,0.0010707771,0.0003930498,0.0021767665,0.0031518037,0.043300018,0.0047047916,0.68005806,0.02499348,0.23589145],"study_design_scores_gemma":[0.00021366411,0.00014621721,0.00051214045,0.00033550145,0.00026171448,0.0012223403,0.00042648322,0.31797186,0.00951161,0.5510153,0.11822822,0.0001548222],"about_ca_topic_score_codex":0.0057950765,"about_ca_topic_score_gemma":0.00534626,"teacher_disagreement_score":0.013717932,"about_ca_system_score_codex":0.0017601219,"about_ca_system_score_gemma":0.0026411996,"threshold_uncertainty_score":0.047929645},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064917053,0.00017109563,0.979795,0.00019062302,0.000057159752,0.00008706434,0.0002701724,0.008296305,0.0046408726],"genre_scores_gemma":[0.24241823,0.00045783902,0.7481264,0.00020620016,0.00005477037,0.0005494094,0.0014990348,0.002451925,0.004236292],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975979,0.00094364263,0.00015801404,0.0002713821,0.00079199544,0.00023705249],"domain_scores_gemma":[0.9962065,0.0023213718,0.00017899097,0.0008514181,0.00037769866,0.0000640187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015741347,0.0014660927,0.0009698684,0.0008126705,0.00054163823,0.0015919995,0.0018109953,0.0010350054,0.014760561],"category_scores_gemma":[0.0076785157,0.0007782766,0.0020993263,0.0007584008,0.0012463619,0.0027613516,0.0018178758,0.0023507422,0.0026700648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034526133,0.00014432117,0.0015766132,0.0006541754,0.00010931732,0.00025014204,0.00018028553,0.67333627,0.015997449,0.20679152,0.008060624,0.09255403],"study_design_scores_gemma":[0.000045287812,0.000038821894,0.00008053002,0.000048512604,0.000018790988,0.000049671195,0.000019068328,0.92138237,0.0092173815,0.059455097,0.009628903,0.000015566766],"about_ca_topic_score_codex":0.0032026584,"about_ca_topic_score_gemma":0.0046680504,"teacher_disagreement_score":0.014760561,"about_ca_system_score_codex":0.0014997906,"about_ca_system_score_gemma":0.0021305142,"threshold_uncertainty_score":0.04937899},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04772394,0.006665145,0.31729403,0.027925706,0.044188034,0.0046829972,0.10608173,0.07858473,0.3668536],"genre_scores_gemma":[0.2099287,0.0019559483,0.16102524,0.010220561,0.0045701372,0.0035213483,0.38322595,0.029828178,0.19572397],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.95524836,0.010420979,0.0018106563,0.0044788686,0.023663096,0.0043780813],"domain_scores_gemma":[0.90998447,0.019941045,0.0020044912,0.01880201,0.04326984,0.005998238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.04038029,0.0037419293,0.0021802098,0.0040755495,0.0041164397,0.012219649,0.0070833275,0.0075402865,0.08704304],"category_scores_gemma":[0.051238634,0.0010854267,0.002862496,0.0020995212,0.0028747907,0.006864425,0.010575292,0.00728207,0.069268346],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018185101,0.0004961974,0.0012769754,0.00073157443,0.00011712761,0.00023398471,0.00015969372,0.0066896286,0.004297707,0.02168701,0.90212774,0.0603639],"study_design_scores_gemma":[0.00068152836,0.0012196032,0.0020381177,0.0004625808,0.000107188476,0.00064512057,0.00046673496,0.031216005,0.028434519,0.035789907,0.8987275,0.00021125944],"about_ca_topic_score_codex":0.008075395,"about_ca_topic_score_gemma":0.009432658,"teacher_disagreement_score":0.08704304,"about_ca_system_score_codex":0.004851815,"about_ca_system_score_gemma":0.008237901,"threshold_uncertainty_score":0.291188},"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"}]}