{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":45,"total_is_capped":false,"direct_labels_cover":3,"predictions_cover":45,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"81f72d4dcd75","filters":{"venue":"EPiC series in computing"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.006140681895732632,"gpt":0.2380729585410363,"spread":0.2319322766453037,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.006694468,0.0004532666,0.0004796549,0.00007976405,0.004269489,0.0009701123,0.002947161,0.0000891049,0.000002740272],"category_scores_gemma":[0.002177858,0.0002358393,0.0001425432,0.001529779,0.002113134,0.0002131575,0.004976035,0.001238394,0.000003972739],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001651388,"about_ca_system_score_gemma":0.00009786579,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000578033,"about_ca_topic_score_gemma":0.001145437,"domain_scores_codex":[0.9948739,0.001497922,0.0009246443,0.0009149192,0.0006405427,0.001148094],"domain_scores_gemma":[0.9895201,0.008377553,0.0004077809,0.001411195,0.0001811147,0.0001022786],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001556939,0.00003413095,0.01474525,0.00004663045,0.00007730083,0.00002148058,0.03655098,0.1009027,0.00001678014,0.03548384,0.0001170053,0.8118482],"study_design_scores_gemma":[0.0008429452,0.0001576724,0.03331548,0.0001295893,0.00001150608,0.0003465877,0.0005842848,0.8666534,0.00007451025,0.09585916,0.001628442,0.0003963577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3293954,0.002025204,0.6534512,0.01118979,0.002263998,0.0007568544,0.000001143067,0.0003801948,0.0005362538],"genre_scores_gemma":[0.9566902,0.00001086881,0.04122872,0.0004590098,0.001563504,0.000008959484,0.00000203377,0.00002392304,0.00001281698],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8114519,"threshold_uncertainty_score":0.9970268,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0166020675808463,"gpt":0.2502045175981701,"spread":0.2336024500173238,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005400447,0.0001233334,0.00023445,0.00009749112,0.0001290242,0.00007378824,0.0003211531,0.00004733749,0.000009220465],"category_scores_gemma":[0.0003221038,0.0001200627,0.00004725238,0.0009982918,0.00007868694,0.0004571013,0.0002426595,0.0001912874,0.000006438318],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005825745,"about_ca_system_score_gemma":0.0002186185,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001447297,"about_ca_topic_score_gemma":0.00005736901,"domain_scores_codex":[0.998296,0.0001579156,0.0005179859,0.0005058295,0.000296595,0.0002257038],"domain_scores_gemma":[0.9983699,0.0002408764,0.0002826281,0.0007473236,0.0003108075,0.00004846187],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0004312572,0.002637374,0.03405776,0.0005402302,0.0002189993,0.002375664,0.02409297,0.06069861,0.01603873,0.6253725,0.002011708,0.2315241],"study_design_scores_gemma":[0.005975002,0.001109022,0.1982771,0.001212821,0.00007044544,0.001905097,0.003190427,0.185597,0.4528891,0.1134536,0.03414891,0.002171479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5138463,0.0001213876,0.4712156,0.001635282,0.0007594478,0.0001757739,0.000005217888,0.0001185472,0.01212251],"genre_scores_gemma":[0.9726507,0.000008973596,0.02688376,0.0000380403,0.0001413366,0.000004314078,0.00006308453,0.000006832911,0.0002029545],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.511919,"threshold_uncertainty_score":0.4896014,"prediction_status":"machine_predicted_unvalidated"},"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":"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02443590830536669,"gpt":0.2745188595835987,"spread":0.250082951278232,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007229895,0.0001494688,0.0002160285,0.0002317383,0.0002718256,0.0001245267,0.0006591649,0.00005888001,0.00001008239],"category_scores_gemma":[0.0002396064,0.0001562509,0.00007015654,0.001665537,0.00007890379,0.0005052234,0.0005194773,0.00026648,0.0001834925],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007815353,"about_ca_system_score_gemma":0.00008971426,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000161377,"about_ca_topic_score_gemma":0.00004175748,"domain_scores_codex":[0.9982181,0.0001074729,0.0004161798,0.0005449065,0.0002821359,0.0004311911],"domain_scores_gemma":[0.9987103,0.0002646872,0.0001334429,0.0007329353,0.0000821133,0.00007648501],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002177983,0.0003777842,0.01532503,0.0001455772,0.00004382402,0.001173391,0.008516927,0.009479051,0.001570305,0.7733496,0.00939415,0.1806026],"study_design_scores_gemma":[0.0008657739,0.0001956963,0.1872735,0.0001490493,0.00000981173,0.0003894311,0.0007489095,0.4630533,0.002622003,0.2529877,0.09069411,0.001010674],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5327868,0.0001350946,0.4307043,0.004845433,0.004313786,0.0004268118,0.000003318689,0.002463926,0.02432059],"genre_scores_gemma":[0.9932486,0.00001144984,0.005672498,0.0001417596,0.0003086895,0.00001269681,0.00002728017,0.00001158624,0.0005654016],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5203618,"threshold_uncertainty_score":0.6371726,"prediction_status":"machine_predicted_unvalidated"},"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":"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.08135760093089604,"gpt":0.3317747509200041,"spread":0.2504171499891081,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004292226,0.00008239611,0.000177306,0.00007200451,0.00007060052,0.00003467869,0.0007268271,0.00003853764,0.00001843583],"category_scores_gemma":[0.00008842827,0.00008463184,0.00003080828,0.0002831329,0.00008327836,0.0002372608,0.0005106573,0.00008562148,0.0000171422],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002680478,"about_ca_system_score_gemma":0.00004769672,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005960265,"about_ca_topic_score_gemma":0.00002977656,"domain_scores_codex":[0.9990187,0.00005332443,0.000305493,0.0002512805,0.0001521889,0.0002189829],"domain_scores_gemma":[0.9991729,0.00009384071,0.0001128733,0.0005259699,0.00006510806,0.00002933361],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001437714,0.00008849409,0.02930154,0.0002475293,0.00002704218,0.00004406902,0.01225221,0.001883989,0.0007468303,0.6173054,0.00133734,0.3367512],"study_design_scores_gemma":[0.0007873254,0.0002853576,0.03902278,0.0006801572,0.000005057138,0.00009094391,0.0002321884,0.8928713,0.008367153,0.04314824,0.01399261,0.0005168467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3631476,0.0006964172,0.618722,0.0006054249,0.001653869,0.000131499,4.386278e-7,0.000129226,0.01491358],"genre_scores_gemma":[0.8705374,0.00001393932,0.1290037,0.0001802391,0.0001877235,7.941092e-7,1.781134e-7,0.00000406428,0.00007194451],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8909873,"threshold_uncertainty_score":0.3451186,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02085790349343988,"gpt":0.2712023298882709,"spread":0.2503444263948311,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002430517,0.0001554417,0.0002073504,0.0001862652,0.0007432938,0.00013848,0.00119208,0.00003468438,0.0000486499],"category_scores_gemma":[0.0001627642,0.0001672693,0.00003633729,0.0009564,0.0001403815,0.0004395155,0.0007552759,0.000451809,0.000007594408],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001991147,"about_ca_system_score_gemma":0.0001042539,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002373543,"about_ca_topic_score_gemma":0.00003681194,"domain_scores_codex":[0.9975262,0.000491144,0.0004753012,0.000617688,0.0005363749,0.000353303],"domain_scores_gemma":[0.99832,0.0001715745,0.0003888906,0.001005395,0.00006237109,0.0000517253],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002865499,0.0007185246,0.05085755,0.0001894915,0.00008904227,0.00128755,0.09557209,0.09819148,0.003011927,0.3905536,0.001822792,0.3574194],"study_design_scores_gemma":[0.00151293,0.001085465,0.150528,0.00009058703,0.00001498436,0.00437872,0.009398364,0.7032407,0.002553464,0.03780273,0.08804655,0.001347446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3589231,0.0002556884,0.6338502,0.0008161234,0.00090763,0.0002953535,9.097465e-7,0.0003313181,0.004619597],"genre_scores_gemma":[0.6683764,0.000002682943,0.3311155,0.0001308282,0.00006784115,0.00003011087,0.00001023618,0.00001328205,0.0002530653],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6050493,"threshold_uncertainty_score":0.6821043,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02501857068454738,"gpt":0.2827003861352207,"spread":0.2576818154506733,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000360996,0.0001441113,0.0002892382,0.0000655995,0.000163515,0.00001667751,0.00007088078,0.00007851964,0.0000484859],"category_scores_gemma":[0.00007785735,0.0001317041,0.00004099969,0.0001005028,0.0004113616,0.00007619085,0.00004207937,0.0001022639,0.000004717041],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004144793,"about_ca_system_score_gemma":0.00008594956,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001329866,"about_ca_topic_score_gemma":0.00001025964,"domain_scores_codex":[0.9989918,0.00003837339,0.0002917244,0.0002849649,0.0001111813,0.0002819032],"domain_scores_gemma":[0.999437,0.0001557449,0.00007628673,0.0001460249,0.000107638,0.00007731496],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.005287411,0.0006071916,0.6231833,0.001612047,0.0003317795,0.0007805406,0.03198771,0.001011538,0.003139419,0.04069907,0.006427197,0.2849328],"study_design_scores_gemma":[0.01253103,0.00367894,0.4283116,0.002469496,0.0002500348,0.00427601,0.005658719,0.498817,0.00201001,0.01712261,0.02342847,0.001446014],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9854134,0.0001013169,0.008501723,0.001111542,0.00003658607,0.0005924219,0.00000164725,0.00004517219,0.004196215],"genre_scores_gemma":[0.9490511,0.00001647359,0.04930462,0.001059485,0.0001542583,0.000008487459,0.00001473078,0.00001662219,0.0003742612],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4978055,"threshold_uncertainty_score":0.5370736,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02047545171841846,"gpt":0.2535248274359482,"spread":0.2330493757175297,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003553632,0.0001449346,0.0002123028,0.00004130355,0.0002099224,0.0001429936,0.0005529327,0.00007754136,0.00005766654],"category_scores_gemma":[0.0005852241,0.0001432455,0.00001960035,0.0003187193,0.00009678853,0.0002740093,0.0006121675,0.0001452442,0.0000104747],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000036803,"about_ca_system_score_gemma":0.0000482939,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002160279,"about_ca_topic_score_gemma":0.00001250475,"domain_scores_codex":[0.9988397,0.00003802986,0.0002556357,0.0004016252,0.0001267555,0.0003382826],"domain_scores_gemma":[0.9992411,0.0002468617,0.00005555243,0.0003568093,0.00005319906,0.00004654902],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001328261,0.0003070436,0.2222209,0.001138851,0.0003078517,0.001004431,0.100107,0.01373571,0.1175722,0.01837389,0.0005974175,0.5245019],"study_design_scores_gemma":[0.0001672817,0.00002969807,0.002902807,0.0002164774,0.000005445271,0.0001550917,0.001497294,0.9714831,0.02029715,0.002876598,0.00007627194,0.0002928353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7102782,0.0002871246,0.2874819,0.0002552251,0.0003035105,0.00003570892,9.24539e-8,0.0001907064,0.001167455],"genre_scores_gemma":[0.9572561,0.000009970561,0.04232092,0.000107701,0.0002594095,0.000001292824,2.148695e-7,0.00001040136,0.00003399579],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9577473,"threshold_uncertainty_score":0.5841383,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.04062794395109122,"gpt":0.3368461936602954,"spread":0.2962182497092042,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009464468,0.00009200773,0.0002515169,0.0004057289,0.00007247903,0.00004208862,0.0006739578,0.00004647396,0.00001109418],"category_scores_gemma":[0.0001287691,0.00009431362,0.00005309456,0.002642358,0.000125552,0.0005684345,0.0002794062,0.00007668576,0.00000470934],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004675474,"about_ca_system_score_gemma":0.00003470956,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006361508,"about_ca_topic_score_gemma":0.00002180482,"domain_scores_codex":[0.9987306,0.0001581764,0.0004232802,0.0002750378,0.0001926464,0.0002202443],"domain_scores_gemma":[0.9989665,0.0001149747,0.000187138,0.0005654118,0.0001357785,0.00003018677],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003254148,0.0001124058,0.00912293,0.00005806709,0.0003714024,0.000009360995,0.01950656,0.3848823,0.001356616,0.4586418,0.0001496341,0.1257564],"study_design_scores_gemma":[0.00007656387,0.00005584094,0.01539273,0.00001695728,0.00001589197,0.000001980392,0.00006205602,0.9761841,0.004001794,0.004050183,0.00005066969,0.00009126231],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2360523,0.00001858463,0.7608136,0.00003904338,0.0003278364,0.00005434427,9.120695e-7,0.0002823375,0.002411025],"genre_scores_gemma":[0.5352801,0.000001665851,0.4646555,0.00002990744,0.00001832475,8.444571e-7,0.000001269698,0.000002830936,0.000009576761],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5913018,"threshold_uncertainty_score":0.3845998,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01676143807099343,"gpt":0.295545062689395,"spread":0.2787836246184015,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001243984,0.0001852254,0.0002135791,0.0002733766,0.0001751,0.0003421745,0.0008060817,0.00008011295,0.0000276394],"category_scores_gemma":[0.0003785394,0.0001907191,0.00006658433,0.0009703235,0.00008608417,0.000694479,0.0006159556,0.0005988058,0.00006982544],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001401611,"about_ca_system_score_gemma":0.0001311769,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001433079,"about_ca_topic_score_gemma":0.00001282863,"domain_scores_codex":[0.9979203,0.0001722143,0.0005233354,0.0007043467,0.0003004151,0.0003794256],"domain_scores_gemma":[0.9986911,0.000441475,0.0001127332,0.0006538398,0.00004372276,0.00005717254],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009788376,0.00006791383,0.01520373,0.0002725917,0.00004724041,0.003303781,0.00975739,0.1226662,0.0002748089,0.5092142,0.00203677,0.3371456],"study_design_scores_gemma":[0.0001435369,0.00004205305,0.005645029,0.0002095026,0.000005229732,0.0006687283,0.0002394602,0.9449988,0.0001699478,0.02661945,0.02093267,0.000325578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02331081,0.0006876829,0.9537005,0.002182298,0.005280898,0.0001508379,3.344815e-7,0.000743971,0.01394268],"genre_scores_gemma":[0.9216639,0.000008701184,0.07662903,0.00009018485,0.0004748884,0.000006391669,0.000006393703,0.00002149398,0.001099003],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8983531,"threshold_uncertainty_score":0.7777301,"prediction_status":"machine_predicted_unvalidated"},"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"},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0180842090583107,"gpt":0.2764689635167606,"spread":0.2583847544584499,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001403327,0.0000909939,0.0001248355,0.00004741632,0.000253915,0.00006299836,0.0005978823,0.00003656383,0.000002821804],"category_scores_gemma":[0.0003577229,0.00007530049,0.00001361015,0.0003738177,0.0002645253,0.0005444863,0.0004212235,0.0001360449,0.000001853635],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002285939,"about_ca_system_score_gemma":0.00002721513,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001927512,"about_ca_topic_score_gemma":0.000001983713,"domain_scores_codex":[0.9989859,0.00009254442,0.0002943292,0.0002559724,0.0001531842,0.0002180721],"domain_scores_gemma":[0.9991118,0.0002295398,0.0002004623,0.0003623182,0.00007329218,0.00002263668],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006790992,0.00006110483,0.1283091,0.00046184,0.00003542161,0.000002719092,0.06052584,0.001922494,0.02226089,0.03984707,0.0004098581,0.7460957],"study_design_scores_gemma":[0.0001692681,0.0001722367,0.01512221,0.0001767524,0.000002479645,0.00002670467,0.0005180171,0.9229252,0.05941252,0.0004581897,0.0008660395,0.0001503955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7999752,0.0001320881,0.1978222,0.0001380634,0.0002987097,0.00009361086,2.436429e-7,0.0000553141,0.001484605],"genre_scores_gemma":[0.7482294,0.000009339074,0.251598,0.00007430284,0.00005349488,0.000001966184,2.447416e-7,0.000004459071,0.00002877887],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9210027,"threshold_uncertainty_score":0.3070665,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04765700939063607,"gpt":0.3343177444501004,"spread":0.2866607350594644,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029428,0.0001621403,0.0003788449,0.000335953,0.000201342,0.00007475469,0.001023912,0.0000929728,0.00001251173],"category_scores_gemma":[0.0009101435,0.0001604025,0.0000844138,0.003004983,0.0002485703,0.0007714145,0.0008288057,0.0001796247,0.000001695433],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001611844,"about_ca_system_score_gemma":0.0001304155,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003677187,"about_ca_topic_score_gemma":0.00008588325,"domain_scores_codex":[0.9978915,0.0002879342,0.0006724714,0.0004277002,0.0003040936,0.0004162285],"domain_scores_gemma":[0.9980752,0.0002226771,0.0003685378,0.0009000401,0.0003847358,0.00004877696],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008806067,0.0001770586,0.07201093,0.0003511526,0.0002183662,0.000008273035,0.02644663,0.1757872,0.001613654,0.5844699,0.000006819469,0.138822],"study_design_scores_gemma":[0.0001013763,0.00008125393,0.05179651,0.00004593684,0.00004138561,0.000006165777,0.0002807275,0.9394465,0.004906699,0.003098372,0.00003983519,0.0001552365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3525937,0.00001124343,0.6459313,0.00007538972,0.0003292792,0.0001116691,0.000001846868,0.00006975701,0.0008758305],"genre_scores_gemma":[0.5271624,9.887571e-7,0.4726872,0.00007473123,0.00006389924,0.000001045161,0.000001803965,0.000004794407,0.00000310452],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7636594,"threshold_uncertainty_score":0.6541026,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.05639342327698976,"gpt":0.2835915093782327,"spread":0.2271980861012429,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003710813,0.00008551565,0.000170224,0.00006399094,0.00007198937,0.00004150329,0.0004863881,0.00004371577,0.000002048324],"category_scores_gemma":[0.0005699901,0.00009273428,0.00001218426,0.0003919026,0.00005982873,0.0003938381,0.0003576612,0.0002227324,0.000003621593],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002016388,"about_ca_system_score_gemma":0.00002004231,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005001274,"about_ca_topic_score_gemma":7.811503e-7,"domain_scores_codex":[0.999016,0.0001032185,0.0003036807,0.0003042515,0.0001373605,0.0001354874],"domain_scores_gemma":[0.998937,0.000468248,0.0001556896,0.0003730421,0.00001942924,0.00004664698],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00002373008,0.00004584538,0.3322404,0.0002274183,0.00002443935,0.00001781096,0.008971783,0.0005884892,0.002584977,0.5994527,0.003712385,0.05210996],"study_design_scores_gemma":[0.0006065897,0.0002573239,0.8435528,0.0003829318,0.000004793557,0.00001080463,0.0003532725,0.1123043,0.009860438,0.02829894,0.003895226,0.000472637],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1627579,0.00007728185,0.8313447,0.00432817,0.00008851292,0.0001944495,0.00005423726,0.0002848907,0.0008698624],"genre_scores_gemma":[0.9019071,0.000006996118,0.09784053,0.0001673127,0.00003649841,0.000001624007,0.00003369065,0.000004452423,0.00000179771],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7391492,"threshold_uncertainty_score":0.3781594,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01170210460895693,"gpt":0.2700041866828466,"spread":0.2583020820738897,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001067361,0.0001075013,0.0001229046,0.00007293219,0.0002756711,0.000171515,0.0002813967,0.00007035015,0.000001230979],"category_scores_gemma":[0.00008727968,0.0001146344,0.000008252819,0.0002617538,0.0001306504,0.0009174157,0.0004076131,0.0001795063,0.000001817701],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005464529,"about_ca_system_score_gemma":0.00002671928,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003531545,"about_ca_topic_score_gemma":0.000006027617,"domain_scores_codex":[0.9989763,0.000060265,0.0002360795,0.0003461456,0.0001587514,0.0002224971],"domain_scores_gemma":[0.9994298,0.0001116519,0.0001141088,0.0002353469,0.00006233204,0.00004682083],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007123966,0.0001975574,0.2165262,0.0005109223,0.00004329173,0.00002999456,0.03114483,0.0006179074,0.02191416,0.2687121,0.0001324603,0.4600993],"study_design_scores_gemma":[0.0002422912,0.0001341141,0.03038272,0.000108193,0.000002855627,0.0001248774,0.0001825855,0.9491022,0.01631648,0.00296657,0.0002026909,0.000234484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5969828,0.0000934932,0.4020767,0.00008351073,0.0002136189,0.0001001354,2.717383e-7,0.0001227894,0.000326623],"genre_scores_gemma":[0.6143087,0.00001067649,0.3855728,0.00005135009,0.00004656872,0.000001571819,5.14717e-7,0.000003758702,0.000004043215],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9484842,"threshold_uncertainty_score":0.4674655,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02531251039226548,"gpt":0.2227059041197544,"spread":0.197393393727489,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002785222,0.00020316,0.000558557,0.00005730904,0.00008857319,0.00005533421,0.0001561546,0.00005737779,0.000007651588],"category_scores_gemma":[0.00009761074,0.0001865934,0.00009190375,0.0002857338,0.00002960348,0.000141726,0.00002956273,0.000162592,0.000007721871],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001067656,"about_ca_system_score_gemma":0.00003317326,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007397189,"about_ca_topic_score_gemma":0.0001690329,"domain_scores_codex":[0.9987263,0.00004433698,0.0004314635,0.0002606406,0.0001414603,0.0003957664],"domain_scores_gemma":[0.9994687,0.0001577052,0.00006977263,0.0001711878,0.00005654608,0.0000760445],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000469189,0.00001619309,0.005885424,0.0002506857,0.0002131097,0.0000311777,0.002549671,0.9812313,0.002367907,0.0006137074,0.0007663931,0.005605188],"study_design_scores_gemma":[0.005954642,0.0001596307,0.0009197525,0.0001305886,0.00004025773,0.00001680115,0.0005555412,0.9907359,0.0001716722,0.00003237952,0.001060781,0.0002220339],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6437679,0.001355464,0.3462265,0.001342432,0.0008522199,0.001671844,0.00001020826,0.0007000622,0.004073403],"genre_scores_gemma":[0.9947068,0.000004766502,0.004539077,0.0001389949,0.0004657952,0.00005343758,0.00001000548,0.00004040027,0.00004074147],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3509389,"threshold_uncertainty_score":0.7609059,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0164611457732456,"gpt":0.2527593542021823,"spread":0.2362982084289367,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000475065,0.0001787501,0.0001752864,0.0001354753,0.0002891972,0.000174704,0.0007687495,0.00007065337,0.00001802346],"category_scores_gemma":[0.00009740292,0.0001597173,0.00002325239,0.000501064,0.0001746004,0.000733145,0.0002969549,0.0002375604,0.000008811713],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009964316,"about_ca_system_score_gemma":0.0001084522,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000276956,"about_ca_topic_score_gemma":0.00002686942,"domain_scores_codex":[0.9984594,0.0001032224,0.0003089698,0.0004536286,0.00026448,0.0004102822],"domain_scores_gemma":[0.9989857,0.00007383042,0.0002025561,0.0005872561,0.0001036408,0.00004702451],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002671224,0.0001183321,0.07622325,0.0004806591,0.00004252121,0.00001503085,0.009898669,0.01673159,0.01063077,0.03422773,0.00005575534,0.8513086],"study_design_scores_gemma":[0.0004460023,0.0003876358,0.03208929,0.0001492982,0.00000373121,0.00001654392,0.0000494773,0.8946862,0.07129196,0.0002544113,0.0003340734,0.0002914207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4719849,0.000008315819,0.5266193,0.00004446189,0.0007630757,0.0001088211,3.311883e-7,0.000125263,0.0003455278],"genre_scores_gemma":[0.5522311,3.293207e-7,0.4474902,0.00007454335,0.000183972,0.000001958316,0.000001441684,0.000008323914,0.000008108411],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8779545,"threshold_uncertainty_score":0.6513081,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05207422924053338,"gpt":0.2835855990373055,"spread":0.2315113697967721,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000709547,0.0002014108,0.0002717976,0.0001510581,0.0004488382,0.00048569,0.0008824596,0.0000551115,0.00005893374],"category_scores_gemma":[0.0001669355,0.000196542,0.00005106554,0.0009523007,0.0001438308,0.000674389,0.0003473499,0.000186213,0.00009829902],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004710216,"about_ca_system_score_gemma":0.0001141646,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005905313,"about_ca_topic_score_gemma":0.00005096659,"domain_scores_codex":[0.9978121,0.000115247,0.0006325312,0.0005792279,0.0002533761,0.0006075548],"domain_scores_gemma":[0.9988211,0.0001588751,0.0002040351,0.0005661047,0.0001372497,0.0001126232],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000009829217,0.00006651072,0.01618544,0.00006564899,0.00002076987,0.00004194678,0.01703603,0.0002005429,0.0002719043,0.7370001,0.0007692259,0.228332],"study_design_scores_gemma":[0.002150743,0.001706278,0.05018377,0.000309195,0.00002935233,0.0004186177,0.00406218,0.1125339,0.0230424,0.2471645,0.5551341,0.003265027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02593153,0.0001673004,0.9370088,0.003834564,0.002341778,0.0005344434,7.550308e-7,0.0006377738,0.02954305],"genre_scores_gemma":[0.8622633,6.718624e-7,0.1361688,0.0002713585,0.0007543167,0.00001435678,0.000003614859,0.00001750656,0.0005060896],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8363318,"threshold_uncertainty_score":0.8014749,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0782508513794713,"gpt":0.3721633954823368,"spread":0.2939125441028655,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006582383,0.0001299996,0.0001812331,0.00007283178,0.0001858032,0.0001623669,0.0005576373,0.00009961445,0.00005159528],"category_scores_gemma":[0.0007372998,0.0001086557,0.00003366109,0.000244083,0.0002456286,0.0008974369,0.0004612434,0.0002123641,0.00003339411],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004296551,"about_ca_system_score_gemma":0.00007494458,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003063345,"about_ca_topic_score_gemma":0.00003373975,"domain_scores_codex":[0.9984768,0.0003287677,0.0002395976,0.0004178817,0.0001980023,0.0003389249],"domain_scores_gemma":[0.9989158,0.0004014044,0.00009709012,0.0004482967,0.00007491467,0.00006250921],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008657097,0.0001468489,0.005237876,0.00001561659,0.00001512201,0.0001703229,0.00627302,0.00007121942,0.0007078415,0.7079543,0.0003739524,0.2789473],"study_design_scores_gemma":[0.001235939,0.002062257,0.1735292,0.0001873215,0.00001672164,0.001083328,0.01210269,0.1826765,0.03605397,0.5824413,0.007481169,0.001129557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3580563,0.00003814732,0.6321449,0.001160449,0.001277576,0.00008260647,1.549641e-7,0.0002822565,0.006957526],"genre_scores_gemma":[0.8471971,0.000004105056,0.1518958,0.0004028016,0.0004580339,0.00000252068,6.301694e-7,0.000004994756,0.00003405346],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4891407,"threshold_uncertainty_score":0.4430852,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.07123724100950812,"gpt":0.3458701936401092,"spread":0.2746329526306011,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001424897,0.000122175,0.0002619104,0.0001057916,0.0002242177,0.00003663939,0.0004984554,0.00002070001,0.000007159815],"category_scores_gemma":[0.0001308459,0.0001193889,0.00004310098,0.0005261884,0.00004923559,0.0004610765,0.0004970661,0.0001397045,4.314993e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001034693,"about_ca_system_score_gemma":0.00007345559,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003258307,"about_ca_topic_score_gemma":0.000009255398,"domain_scores_codex":[0.9984316,0.0002101565,0.0004232384,0.0003397136,0.0003041744,0.0002911316],"domain_scores_gemma":[0.9988231,0.0003498123,0.0002839682,0.0004042414,0.0001073345,0.00003156583],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002626311,0.00009499523,0.00135492,0.000073979,0.00003583141,0.000006674528,0.004449142,0.702554,0.0002820471,0.2698975,0.00005058367,0.02093766],"study_design_scores_gemma":[0.001509059,0.0003141313,0.0002247734,0.00002306184,0.000004825083,0.00001570885,0.0004272547,0.9751215,0.0007058911,0.0207092,0.0008042854,0.0001402891],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07701927,0.00006199288,0.9213085,0.0001599539,0.0002170779,0.0005256446,0.000003818294,0.0000650659,0.0006387208],"genre_scores_gemma":[0.5508987,4.864151e-7,0.4488371,0.0001700604,0.00002046393,0.00004516363,0.000001901862,0.000007648812,0.00001851456],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4738794,"threshold_uncertainty_score":0.4868537,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04035383119222104,"gpt":0.3012005958831883,"spread":0.2608467646909673,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007738355,0.0001327554,0.0002281769,0.00007353766,0.0002078561,0.0001431321,0.0007145739,0.0000716584,0.00001389535],"category_scores_gemma":[0.0000868455,0.0001170408,0.00005369838,0.0002919654,0.0001134562,0.0002431006,0.0003273146,0.00009659406,0.00003435746],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004284166,"about_ca_system_score_gemma":0.00005126985,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003889322,"about_ca_topic_score_gemma":0.00007997661,"domain_scores_codex":[0.9986717,0.00006587316,0.0003350719,0.0003674301,0.0001422336,0.0004177006],"domain_scores_gemma":[0.999176,0.000139286,0.0001309746,0.0004160444,0.00008804684,0.00004962529],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001498897,0.00007173476,0.01497965,0.00009194375,0.00001398943,0.00002364607,0.003715459,0.0000465042,0.00005132099,0.8300765,0.001428231,0.149486],"study_design_scores_gemma":[0.001874006,0.003324345,0.00934657,0.00005749768,0.000011649,0.0003115269,0.0006128719,0.1313182,0.008344479,0.5466754,0.2969956,0.001127864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009459944,0.00008525771,0.9699897,0.0005034974,0.002362727,0.0005280882,3.591512e-7,0.0002642352,0.01680625],"genre_scores_gemma":[0.9584247,7.132506e-7,0.04023504,0.0003323355,0.0005103129,0.00001681022,0.000003065958,0.000009218107,0.0004678447],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9489647,"threshold_uncertainty_score":0.4772786,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03108864312804124,"gpt":0.290305685783355,"spread":0.2592170426553138,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006230723,0.0001215419,0.0001778742,0.00009477922,0.0002090324,0.0001739993,0.0004275673,0.00006762628,0.000006710563],"category_scores_gemma":[0.0001675143,0.0001120527,0.00005225197,0.00035123,0.00005256951,0.0002905609,0.0001033782,0.00007561329,0.00002536734],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005153981,"about_ca_system_score_gemma":0.0000491891,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003799349,"about_ca_topic_score_gemma":0.00003890379,"domain_scores_codex":[0.9988087,0.00008351114,0.0002861048,0.0003521387,0.0001505827,0.0003189583],"domain_scores_gemma":[0.9991322,0.0002037669,0.0001457392,0.0003730879,0.0001023549,0.00004283229],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000565597,0.0001662237,0.02419511,0.0002313307,0.00004257941,0.00002604649,0.006376336,0.001753228,0.0005714341,0.6732785,0.001281568,0.2920212],"study_design_scores_gemma":[0.001253482,0.0008053119,0.009168833,0.00004340939,0.000009892674,0.00003179406,0.0001409292,0.822845,0.01180258,0.0619117,0.09143889,0.0005481314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01917685,0.00007897495,0.9761785,0.0006182538,0.00177586,0.0003734934,1.872134e-7,0.0002040364,0.001593887],"genre_scores_gemma":[0.9358893,3.349043e-7,0.06334677,0.0001722232,0.0004631345,0.00001694315,0.00000286483,0.000009095054,0.00009930536],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9167125,"threshold_uncertainty_score":0.4569375,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01534114920150511,"gpt":0.2653032240207558,"spread":0.2499620748192507,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006353575,0.0001355064,0.0002505154,0.0001027493,0.0001555403,0.00008622229,0.0008505255,0.0000638836,0.00003964761],"category_scores_gemma":[0.0001748734,0.0001305053,0.00004380376,0.000385778,0.0003345217,0.0003717637,0.0003644654,0.0001323714,0.00001618064],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003445161,"about_ca_system_score_gemma":0.00008725494,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000402328,"about_ca_topic_score_gemma":0.00004629388,"domain_scores_codex":[0.9986847,0.0001153503,0.0003590297,0.0003465221,0.0001506086,0.0003438015],"domain_scores_gemma":[0.9989646,0.0001893266,0.0001526178,0.0004930517,0.0001287575,0.00007163209],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002133298,0.0001978007,0.04529994,0.00005748328,0.00002426455,0.00003753709,0.020803,0.0001182071,0.002461258,0.8166534,0.0002148799,0.1141108],"study_design_scores_gemma":[0.002540356,0.002844316,0.109048,0.0005458638,0.00001320154,0.0002024813,0.002508605,0.7345785,0.04609805,0.09862231,0.001798072,0.001200214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.698991,0.00009345984,0.2764641,0.0001515409,0.001252486,0.0001239015,4.861715e-7,0.00021503,0.02270804],"genre_scores_gemma":[0.9384776,0.000002135573,0.06116752,0.0001073761,0.0002039761,0.000001073131,0.000001013879,0.000007204883,0.00003212399],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7344603,"threshold_uncertainty_score":0.5321852,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0515206301022517,"gpt":0.2546649653170044,"spread":0.2031443352147528,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002247757,0.0002107056,0.0002376687,0.00009533857,0.0001980807,0.00006478516,0.0001231135,0.00009750012,0.000007168347],"category_scores_gemma":[0.0001989018,0.0002397442,0.0000611984,0.0003217177,0.00002529897,0.0003542754,0.00006822742,0.0001751033,4.727401e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001195055,"about_ca_system_score_gemma":0.00002373164,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004311436,"about_ca_topic_score_gemma":0.00001815227,"domain_scores_codex":[0.9986454,0.00003525093,0.0004999619,0.0003008715,0.0001157469,0.0004027338],"domain_scores_gemma":[0.9995292,0.0001365294,0.000106493,0.0001091456,0.00004234182,0.00007625969],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002614357,0.000007002308,0.006309901,0.0002746545,0.00002513747,0.0000103458,0.002632682,0.9348903,0.009599365,0.0002476285,0.00001757891,0.04595925],"study_design_scores_gemma":[0.000413438,0.00005496042,0.001386666,0.0004439799,0.0000129882,0.0000271433,0.0001376227,0.9858797,0.01120062,0.00006178933,0.0001582678,0.000222878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5915954,0.0001277374,0.4062755,0.00004978955,0.0009403359,0.0001547064,0.000005456107,0.00038564,0.0004654143],"genre_scores_gemma":[0.9694812,0.000003626688,0.02932703,0.00005038832,0.001014115,0.00001145752,0.00003892136,0.00006386395,0.000009340648],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3778858,"threshold_uncertainty_score":0.9776486,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03928011398027974,"gpt":0.3384955252649146,"spread":0.2992154112846348,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006302911,0.00008631207,0.0001176141,0.00007579427,0.00005054639,0.00001209868,0.00009439377,0.00005653341,0.00007718699],"category_scores_gemma":[0.0002392009,0.00008838817,0.00001818303,0.0001237308,0.0000833166,0.0001228997,0.00002953491,0.00009055105,0.000002003834],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000111393,"about_ca_system_score_gemma":0.00002731556,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004236434,"about_ca_topic_score_gemma":0.000175427,"domain_scores_codex":[0.9991872,0.0001226727,0.0001848737,0.0001496341,0.000207495,0.0001480654],"domain_scores_gemma":[0.9994546,0.0001027552,0.00002736482,0.0002591809,0.0001267202,0.00002944605],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.0001301508,0.0001528745,0.4403875,0.0003200651,0.00003357594,0.000008319792,0.005154359,0.1149765,0.0009484087,0.001711925,0.00146346,0.4347129],"study_design_scores_gemma":[0.0005553968,0.0002272961,0.5449758,0.0001061261,0.00001695382,0.000007187705,0.0005005361,0.4421026,0.008528332,0.00232688,0.0004265329,0.0002262957],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9890871,0.0001006141,0.009816663,0.00001966802,0.0003392496,0.00007300278,0.000003290327,0.0001102108,0.0004502135],"genre_scores_gemma":[0.9967575,0.000002742163,0.003012578,0.00002957203,0.0001529431,0.000002861108,0.00002670006,0.00001012878,0.000004964915],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4344866,"threshold_uncertainty_score":0.3604365,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0207503520892636,"gpt":0.3285817336613172,"spread":0.3078313815720536,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009417741,0.0001770648,0.0002345816,0.0001870509,0.0002581355,0.0002117283,0.001084673,0.00008238565,0.00004195097],"category_scores_gemma":[0.000191182,0.000182641,0.00005868741,0.0006526608,0.0000997358,0.000383903,0.0007468494,0.0002128612,0.00008926322],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005799415,"about_ca_system_score_gemma":0.00007044159,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008343315,"about_ca_topic_score_gemma":0.000005262207,"domain_scores_codex":[0.998249,0.0001975224,0.0003942061,0.0005082682,0.0002415873,0.0004094166],"domain_scores_gemma":[0.9988731,0.0002239709,0.000153745,0.0005552901,0.0001176332,0.00007624378],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006210321,0.0002410007,0.01134093,0.00005964229,0.00004800798,0.0002092543,0.02289065,0.02633039,0.001187104,0.2552069,0.003603229,0.6788207],"study_design_scores_gemma":[0.0004180194,0.0003589464,0.003375685,0.000190162,0.000003055129,0.0002483675,0.00006481013,0.9366058,0.01390054,0.03289667,0.01148078,0.000457181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02218326,0.0001121564,0.9639319,0.0006069336,0.0006724193,0.0001120038,2.101055e-7,0.000734942,0.01164619],"genre_scores_gemma":[0.3615825,0.000005332236,0.6371315,0.000688885,0.000269105,0.000002561995,5.009849e-7,0.000009802472,0.0003098417],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9102754,"threshold_uncertainty_score":0.7447885,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematical proof; Computer science; Geometry; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02623357963717576,"gpt":0.2901355418962448,"spread":0.263901962259069,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004084653,0.0001041753,0.0001655578,0.00007449892,0.0001636271,0.00009949348,0.0006782628,0.00005159728,0.000004848991],"category_scores_gemma":[0.0002514243,0.00009837685,0.00004277289,0.0002639873,0.0001074293,0.0002600758,0.0002894642,0.00006864081,0.00001584279],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002950253,"about_ca_system_score_gemma":0.00004836184,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001764868,"about_ca_topic_score_gemma":0.00002320854,"domain_scores_codex":[0.9989531,0.00003643241,0.0002209117,0.0003334289,0.0001128906,0.0003432323],"domain_scores_gemma":[0.9992471,0.000191739,0.00006538029,0.0003918167,0.00007381744,0.00003009417],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004161864,0.0001353374,0.05000855,0.0002382316,0.00005422424,0.00008180503,0.014156,0.0003092641,0.001278611,0.4418932,0.00468457,0.4871185],"study_design_scores_gemma":[0.00213104,0.001141263,0.08663182,0.0003638555,0.00001379667,0.0002623742,0.001080967,0.554164,0.03364024,0.2219172,0.09741212,0.001241319],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1471565,0.0002139261,0.8450826,0.001410172,0.001736676,0.0002705282,3.258418e-7,0.000286249,0.003843044],"genre_scores_gemma":[0.8348137,0.000001706788,0.1644114,0.0003368805,0.0003212849,0.000007298845,5.603467e-7,0.000006018841,0.0001011306],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6876572,"threshold_uncertainty_score":0.4011692,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04750061519743814,"gpt":0.2975682831097751,"spread":0.2500676679123369,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001769504,0.0001650869,0.0002318584,0.00007964161,0.0001217631,0.00008217152,0.0008931375,0.00005202054,0.0000196956],"category_scores_gemma":[0.0001029009,0.0001881987,0.00003875162,0.001417143,0.00005232696,0.0004476087,0.0006956835,0.0003427557,0.00004751521],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000695633,"about_ca_system_score_gemma":0.00004192802,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002955425,"about_ca_topic_score_gemma":0.00007680472,"domain_scores_codex":[0.998295,0.00006217969,0.0004482526,0.0005918886,0.0001805167,0.0004221353],"domain_scores_gemma":[0.9990746,0.0002545012,0.0001212748,0.0004299665,0.00002717305,0.00009244026],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004332042,0.0001580624,0.08455097,0.0001739598,0.00003237773,0.0003678432,0.06239902,0.3906187,0.001314677,0.1042813,0.02107772,0.334982],"study_design_scores_gemma":[0.0006079558,0.00008320646,0.01012436,0.0002210589,0.00000252563,0.00003293253,0.0005699591,0.936155,0.001191808,0.01099312,0.03943029,0.0005877644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09925201,0.0002517189,0.8508224,0.04437744,0.0003762051,0.0003624983,0.00000105932,0.0002785523,0.004278048],"genre_scores_gemma":[0.889936,0.0000269753,0.1005275,0.009267651,0.0001519685,0.00001027264,0.000001597361,0.00001275839,0.00006523442],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.790684,"threshold_uncertainty_score":0.7674518,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02310364717064647,"gpt":0.2643554549334236,"spread":0.2412518077627771,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001714588,0.0001258012,0.0001401323,0.00006228703,0.0002506624,0.0001602455,0.0002665883,0.0000431201,0.00003400402],"category_scores_gemma":[0.00004483081,0.0001214717,0.00001914269,0.0005059686,0.0001744732,0.0008490403,0.0001736952,0.0001407006,0.000009218137],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005776392,"about_ca_system_score_gemma":0.00006565299,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006315216,"about_ca_topic_score_gemma":0.0001976225,"domain_scores_codex":[0.9989469,0.00005967923,0.0002235939,0.0003403828,0.0001542042,0.0002752445],"domain_scores_gemma":[0.9994439,0.00008589712,0.0001032265,0.0002434358,0.00009070664,0.00003277265],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006424054,0.00004473735,0.122523,0.00003649057,0.00004146603,0.0000682699,0.02443906,0.03633096,0.0002401277,0.1336837,0.00003874108,0.6824892],"study_design_scores_gemma":[0.001941436,0.0005128704,0.1308771,0.0005125302,0.00001221281,0.0006064584,0.004425218,0.835173,0.01255355,0.009197466,0.003061419,0.001126701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2704308,0.00001041986,0.7248498,0.0002528772,0.0005320736,0.00007995863,1.816285e-7,0.0001443629,0.003699499],"genre_scores_gemma":[0.7526261,0.000002292642,0.2470771,0.0001126675,0.0001600353,0.000001675452,6.524458e-7,0.000007065583,0.00001234677],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7988421,"threshold_uncertainty_score":0.4953473,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01851711838278403,"gpt":0.2428922872821545,"spread":0.2243751688993704,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001342799,0.00009370852,0.0001428252,0.00005391436,0.0000297065,0.00001232645,0.00007437937,0.00005666589,0.0000774516],"category_scores_gemma":[0.00001602816,0.00009900191,0.00001166686,0.0001547819,0.00001799843,0.0000937814,0.00006294347,0.00007824719,0.00001963781],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006195468,"about_ca_system_score_gemma":0.000005227554,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001158851,"about_ca_topic_score_gemma":0.00003986576,"domain_scores_codex":[0.999383,0.00001332854,0.0001996747,0.0001215992,0.00005391152,0.0002284854],"domain_scores_gemma":[0.9997937,0.00002806718,0.00001882569,0.0001253018,0.00001231219,0.00002178279],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001716908,0.0001314981,0.005086574,0.0007230378,0.00004735255,0.0003310285,0.00827132,0.1346905,0.5775971,0.112706,0.001324096,0.1589198],"study_design_scores_gemma":[0.00283102,0.0005049771,0.0158002,0.001252554,0.00001165649,0.00005710598,0.0007610855,0.1899663,0.6391025,0.04580073,0.102311,0.001600827],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9883382,0.000135077,0.00452177,0.00003984331,0.003611726,0.00007423837,6.045654e-7,0.0002020569,0.003076539],"genre_scores_gemma":[0.9861042,0.00001856677,0.01338324,0.00004784282,0.0003479786,0.000001808162,0.00000159011,0.00002079826,0.00007393596],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1573189,"threshold_uncertainty_score":0.4037181,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01369102880265367,"gpt":0.2479045922986634,"spread":0.2342135634960097,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008287977,0.0001278585,0.0001465965,0.0000364982,0.0003348202,0.0001820255,0.0006101018,0.0000373902,0.00001209967],"category_scores_gemma":[0.00004403367,0.0001012621,0.00007475558,0.0003596279,0.00006009872,0.0002396109,0.0005330121,0.0001493321,0.000002169561],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000501428,"about_ca_system_score_gemma":0.00006600224,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001039579,"about_ca_topic_score_gemma":0.000007563146,"domain_scores_codex":[0.9987819,0.0001068721,0.0002716563,0.0003552458,0.0001461805,0.0003381321],"domain_scores_gemma":[0.9990016,0.0004475095,0.0000817854,0.0003760695,0.00005610736,0.00003689188],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000405803,0.0000708984,0.0001905818,0.00001876995,0.00003683018,0.00002456304,0.001628741,0.0005066633,0.001055622,0.06203271,0.0001018973,0.9343287],"study_design_scores_gemma":[0.0007171787,0.0001180225,0.0005380735,0.00005277985,0.000006557155,0.00007218202,0.001010032,0.9389655,0.01816041,0.03674424,0.003375132,0.0002398787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002435004,0.0003194239,0.9943115,0.001184011,0.0009459887,0.000299263,0.000002499761,0.00008396406,0.000418377],"genre_scores_gemma":[0.2975484,0.00001075884,0.7013317,0.0005783228,0.0002238936,0.00004344221,0.000004751938,0.00001128516,0.0002475141],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9384589,"threshold_uncertainty_score":0.4129348,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.009734830571931433,"gpt":0.2196012689335334,"spread":0.2098664383616019,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001985213,0.0001164944,0.0001309488,0.0001038012,0.0001181041,0.00009957594,0.0002860456,0.00004828033,0.00008339741],"category_scores_gemma":[0.00003421718,0.0001205,0.00003430507,0.000240861,0.00002270982,0.000385454,0.0001769069,0.0001680876,0.0001085036],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007197442,"about_ca_system_score_gemma":0.00003283377,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007080479,"about_ca_topic_score_gemma":0.000009783092,"domain_scores_codex":[0.9989827,0.00004254289,0.0002329851,0.0003180398,0.0001810848,0.0002425912],"domain_scores_gemma":[0.9994332,0.0001000901,0.00008546662,0.0003117563,0.0000325291,0.00003702603],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001225003,0.00001854991,0.5333466,0.00003559174,0.000008328483,0.00001125088,0.00142546,0.3217851,0.00007997417,0.002095442,0.00002932261,0.1411521],"study_design_scores_gemma":[0.0003070786,0.0001125242,0.08904713,0.0001228164,9.671718e-7,0.00005536378,0.00006662585,0.9085991,0.000894703,0.00007514401,0.0005464267,0.0001720581],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9455931,0.00001832041,0.04771587,0.0002236611,0.001324332,0.0001541872,5.142567e-7,0.0002172384,0.00475277],"genre_scores_gemma":[0.9854997,0.000007041747,0.01391656,0.0003210121,0.00006890729,0.000001720048,0.000002615631,0.000007935648,0.0001745416],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5868141,"threshold_uncertainty_score":0.4913847,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.006437992204812796,"gpt":0.2669787566759119,"spread":0.2605407644710991,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002380451,0.00007287397,0.0001882787,0.0001123418,0.00003850909,0.00001018714,0.00009156714,0.00006484293,0.00001340144],"category_scores_gemma":[0.00002372751,0.00006901879,0.00004909305,0.0007010851,0.00002602059,0.000004812657,0.00003990767,0.00004885326,4.834455e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003092678,"about_ca_system_score_gemma":0.00005804077,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006980066,"about_ca_topic_score_gemma":0.001907751,"domain_scores_codex":[0.9993327,0.00004593928,0.0001536098,0.0001921907,0.0001078718,0.0001677445],"domain_scores_gemma":[0.9996029,0.00001283061,0.000108489,0.0001720194,0.000076898,0.00002688785],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.00009784356,0.00003219265,0.860467,0.00002635086,0.0005863387,2.543425e-7,0.000879755,0.05061619,0.07213891,0.00006905112,0.001546426,0.01353965],"study_design_scores_gemma":[0.0003402852,0.00006200679,0.9803339,0.00001803884,0.0001546334,0.000001794629,0.0004850441,0.003680384,0.004504334,0.00001175266,0.0102646,0.0001432069],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9981292,0.0001873333,0.0002313651,0.0001229841,0.001045036,0.00005360054,0.00004964117,0.00001693935,0.0001638784],"genre_scores_gemma":[0.9972129,0.0001589863,0.0002352505,0.00006169055,0.002038671,0.0000053108,0.0001092659,0.000009579836,0.0001683165],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1198669,"threshold_uncertainty_score":0.2814505,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.04800009858700535,"gpt":0.2942359108278875,"spread":0.2462358122408822,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002441148,0.00008772568,0.0001163694,0.00007198119,0.0002469535,0.0001037477,0.0002890274,0.00004051104,6.662836e-7],"category_scores_gemma":[0.0001878849,0.0001000474,0.000007729023,0.0003907381,0.00004135453,0.0005263636,0.0007624031,0.0000907045,0.000003533725],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002552676,"about_ca_system_score_gemma":0.00001445232,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002562662,"about_ca_topic_score_gemma":0.0001718996,"domain_scores_codex":[0.9990451,0.00003454652,0.0001810052,0.0004842254,0.00005895869,0.0001961705],"domain_scores_gemma":[0.9986719,0.0008168686,0.00008155301,0.0003715568,0.00002245759,0.00003563264],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008253293,0.000008902391,0.001472575,0.00002140763,0.000007624997,0.000005209586,0.001070318,0.0009235257,0.002231481,0.0003466937,0.0000387027,0.9938653],"study_design_scores_gemma":[0.0002415456,0.00005064214,0.01856082,0.00005033845,0.000004074163,0.00001438421,0.0001222772,0.9603505,0.001109241,0.01833346,0.001017746,0.0001449865],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5844995,0.00006573948,0.4143949,0.0002611646,0.0002408034,0.0002419858,0.000008930302,0.0002546273,0.00003235954],"genre_scores_gemma":[0.8185481,0.00003535418,0.1811279,0.0000701724,0.0001387357,0.00002256805,0.00003726199,0.000008740061,0.00001115781],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9937203,"threshold_uncertainty_score":0.4079816,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02335302589095793,"gpt":0.2408810972732375,"spread":0.2175280713822796,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003482891,0.00007583333,0.0001203498,0.00006264775,0.00006491898,0.00003702586,0.0005147863,0.0000227236,0.00000395756],"category_scores_gemma":[0.00003066375,0.00005924979,0.00002245972,0.0004726389,0.00004509269,0.0001401286,0.0004572523,0.0001400841,0.000002510442],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000140978,"about_ca_system_score_gemma":0.00004169765,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002277307,"about_ca_topic_score_gemma":0.00001620903,"domain_scores_codex":[0.9992785,0.00005099009,0.0001966072,0.0002009376,0.0001091115,0.0001638537],"domain_scores_gemma":[0.9993463,0.0001996919,0.00009115896,0.0003237016,0.00001985228,0.00001936829],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005924665,0.00001482005,0.1197348,0.0000866949,0.000007562632,0.000002113308,0.005456094,0.7394076,0.0007663508,0.07137022,0.00008464268,0.06306317],"study_design_scores_gemma":[0.00004296465,0.0000163569,0.002439902,0.0001298552,8.485074e-7,0.000007174011,0.00004652257,0.989584,0.001527625,0.006034554,0.00009319466,0.0000770059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6061485,0.0003271987,0.389643,0.0004999715,0.0003715719,0.0001078135,4.258214e-7,0.00004634263,0.002855183],"genre_scores_gemma":[0.9176137,0.00000344416,0.08180846,0.0001832508,0.0000145471,6.581113e-7,1.323149e-7,0.0000036166,0.0003721701],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3114652,"threshold_uncertainty_score":0.2416136,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.080960305153916,"gpt":0.3143764751420236,"spread":0.2334161699881076,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.004247686,0.0002402314,0.0002871425,0.0003498421,0.0002474725,0.000837454,0.005588606,0.0001026741,0.000006443725],"category_scores_gemma":[0.0001982774,0.0002054203,0.00004453047,0.00236541,0.0001430872,0.001991288,0.003370445,0.0006455926,0.0000166956],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000118321,"about_ca_system_score_gemma":0.0002176081,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006463674,"about_ca_topic_score_gemma":0.0009091435,"domain_scores_codex":[0.9967776,0.0005880431,0.0006032081,0.001127112,0.0004381569,0.0004658817],"domain_scores_gemma":[0.9951167,0.0008516371,0.0001167617,0.003831539,0.00003178582,0.00005157029],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007579759,0.0004048818,0.02080718,0.002103817,0.0000834784,0.002323308,0.013043,0.004077204,0.0001202677,0.8633246,0.003750091,0.08988639],"study_design_scores_gemma":[0.0002570921,0.00002923635,0.002024492,0.0007254936,0.00001325056,0.0001620424,0.0008288982,0.984862,0.00002183797,0.005990329,0.004827595,0.0002577565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3813997,0.002839469,0.6090039,0.001539672,0.003436433,0.0005413642,0.0002896528,0.0007329748,0.0002167856],"genre_scores_gemma":[0.9750351,0.00001627178,0.02401867,0.0001560284,0.000486557,0.000003203908,0.0002681527,0.00001583251,2.122162e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9807848,"threshold_uncertainty_score":0.9997916,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01245571737319241,"gpt":0.2668661751472123,"spread":0.2544104577740199,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000647195,0.000151375,0.0002006499,0.0001071652,0.0002047301,0.0004443849,0.0003698281,0.00006757496,0.000006729971],"category_scores_gemma":[0.0002852931,0.0001393285,0.00005490761,0.0003550798,0.00006172581,0.0002948522,0.0003672588,0.0001637432,0.000008975442],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005049658,"about_ca_system_score_gemma":0.00007032994,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000146313,"about_ca_topic_score_gemma":0.00001369869,"domain_scores_codex":[0.9987513,0.00004216327,0.0002521673,0.000480481,0.0001049733,0.0003689045],"domain_scores_gemma":[0.9991822,0.0004421575,0.00004209263,0.0002484015,0.00003623691,0.00004887713],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008608828,0.00002086965,0.00782983,0.0002317745,0.0000213022,0.00005723859,0.008892435,0.0001591352,0.00005903028,0.6546722,0.0007886089,0.3272589],"study_design_scores_gemma":[0.0005602352,0.0002173195,0.01639017,0.0008072596,0.00001086266,0.0002207279,0.0002675318,0.9010716,0.0004658638,0.03161891,0.04784763,0.0005218712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.37816,0.009358132,0.5925832,0.0008996958,0.003053223,0.000451944,0.000002659935,0.0007978965,0.01469319],"genre_scores_gemma":[0.9125726,0.00003383127,0.08616111,0.0001324192,0.0003912346,0.00001438129,0.000001518476,0.000014476,0.0006783911],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9009125,"threshold_uncertainty_score":0.5681652,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01067306501312257,"gpt":0.2276986797527043,"spread":0.2170256147395817,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001775072,0.000166224,0.0001915131,0.00003098228,0.0001010394,0.0000365004,0.0001828911,0.00007450925,0.00002119247],"category_scores_gemma":[0.00003530295,0.0001500143,0.00003840346,0.0001029672,0.00005580168,0.000001715295,0.0002508033,0.0001042068,0.00001079881],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001393949,"about_ca_system_score_gemma":0.00004388984,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002865119,"about_ca_topic_score_gemma":0.00005249215,"domain_scores_codex":[0.9989904,0.00003788961,0.0002191347,0.0003625494,0.00008819725,0.0003018348],"domain_scores_gemma":[0.9995137,0.00002986604,0.00008455011,0.0002892973,0.00004824742,0.00003433104],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.0001213451,0.00004912809,0.6881686,0.00007434642,0.0001159769,0.00001279474,0.001094817,0.007208216,0.2920177,0.0007497145,0.0002568869,0.01013042],"study_design_scores_gemma":[0.005601116,0.003423351,0.5656085,0.0004713651,0.0000580273,0.0003228373,0.008270719,0.005741315,0.3130781,0.00120983,0.09346095,0.002753892],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9904624,0.0007231232,0.0002381354,0.0001153981,0.000303146,0.0001730627,0.000002252462,0.000007808301,0.007974709],"genre_scores_gemma":[0.9918396,0.00004102997,0.007169378,0.0002264721,0.0002821137,0.000005179714,0.0000113618,0.0000232815,0.0004015504],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1225601,"threshold_uncertainty_score":0.6117404,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03596283476428411,"gpt":0.2909447288713724,"spread":0.2549818941070883,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009067969,0.0001564357,0.0002571673,0.00009336279,0.0002534668,0.0001940521,0.0006365019,0.00007785561,0.00001258025],"category_scores_gemma":[0.0002435321,0.0001384393,0.00007519444,0.0003001977,0.0001007775,0.0002527899,0.0002123982,0.0001032526,0.00003935912],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005977212,"about_ca_system_score_gemma":0.00005785377,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001942195,"about_ca_topic_score_gemma":0.00001918808,"domain_scores_codex":[0.9985068,0.00005793502,0.0003865954,0.0003800003,0.0002019198,0.0004667404],"domain_scores_gemma":[0.9989181,0.0003846528,0.0001296369,0.0004014106,0.0001024254,0.00006374224],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009423499,0.00005278287,0.0008229609,0.0001239504,0.00001356393,0.00001320456,0.002948682,0.0001235986,0.00004224562,0.9107034,0.0001487349,0.08499742],"study_design_scores_gemma":[0.0005664501,0.0003640022,0.0001504586,0.00005339928,0.000004556609,0.0000444487,0.0002081095,0.7717142,0.002799051,0.2172188,0.006594128,0.0002824184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003741377,0.000036938,0.9883821,0.0002457635,0.0009969488,0.0003250582,2.565371e-7,0.0002526136,0.006018925],"genre_scores_gemma":[0.7213571,1.96408e-7,0.2780207,0.0001336743,0.0003798845,0.00001433651,0.000001219811,0.00001078855,0.0000821258],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7715905,"threshold_uncertainty_score":0.5645389,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02789954037441089,"gpt":0.2546036855642765,"spread":0.2267041451898656,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004959395,0.0001739724,0.0002588093,0.0002974106,0.000346105,0.0003528604,0.0003168919,0.0001154083,0.00017994],"category_scores_gemma":[0.0003944622,0.0001923208,0.00006020454,0.001588244,0.0001172015,0.000643421,0.0001198786,0.000214989,0.0001638337],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000381603,"about_ca_system_score_gemma":0.00003294913,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003080622,"about_ca_topic_score_gemma":0.00007340223,"domain_scores_codex":[0.998616,0.00001429675,0.0003727371,0.0003982589,0.0002385424,0.000360127],"domain_scores_gemma":[0.999066,0.00007752508,0.000227117,0.0003467247,0.0002718268,0.00001081081],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003775146,0.0006694771,0.2520255,0.001393849,0.0001500163,0.00002397433,0.0009949063,0.1070777,0.0006157835,0.08071671,0.001296279,0.5546582],"study_design_scores_gemma":[0.0004426579,0.00001371917,0.01947044,0.0008468815,0.00005974023,7.009386e-7,0.0002625072,0.9332196,0.0002047752,0.03530663,0.009664149,0.0005081648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5143164,0.0002125732,0.4719147,0.004135053,0.001238414,0.0001811752,6.578083e-7,0.0005179034,0.0074831],"genre_scores_gemma":[0.9712108,0.000003394322,0.02423653,0.001786576,0.002657038,0.000007759434,0.00001863784,0.00002959493,0.00004961872],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8261419,"threshold_uncertainty_score":0.7842616,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0436413897169171,"gpt":0.3310387987670756,"spread":0.2873974090501585,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006220936,0.0001183306,0.0001305455,0.0001571372,0.0001346365,0.0002428854,0.0003576558,0.0000522328,8.886457e-7],"category_scores_gemma":[0.0004662916,0.0001190588,0.00005740986,0.0003855488,0.00002242156,0.0001307036,0.0002245284,0.0001266535,0.000002831428],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008541405,"about_ca_system_score_gemma":0.00005961048,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008032932,"about_ca_topic_score_gemma":8.648358e-7,"domain_scores_codex":[0.9989353,0.00002410356,0.0002537379,0.0003844512,0.0001414533,0.0002608941],"domain_scores_gemma":[0.9987133,0.0008832903,0.00004182013,0.0002803722,0.00005298731,0.00002829249],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002612727,0.000008012116,0.0001793364,0.00006581711,0.000002752281,0.000006170028,0.001403386,0.9181532,0.00001250513,0.01133344,0.0002731509,0.06855967],"study_design_scores_gemma":[0.00009481988,0.00002573935,0.00009207541,0.000302536,0.000001904829,0.000007871607,0.000006648887,0.9559586,0.0001539671,0.04293624,0.0002857064,0.0001338639],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01661246,0.0002620738,0.9742263,0.0002930118,0.0005556115,0.0002022331,9.618702e-7,0.007550149,0.0002972265],"genre_scores_gemma":[0.6183277,4.299349e-7,0.3814787,0.00006501054,0.00007270491,0.000009358452,0.000001211285,0.000009817826,0.00003512056],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6017152,"threshold_uncertainty_score":0.4855079,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Trent University; Ontario Tech University","funders":"","keywords":"Process (computing); Computer science; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.02392782047712939,"gpt":0.2727039439797718,"spread":0.2487761235026424,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001589048,0.00009196856,0.00010223,0.0001435009,0.00005708493,0.00009894215,0.00004894853,0.00004477249,0.000005756711],"category_scores_gemma":[0.000006555244,0.0001018564,0.00001297561,0.0003403956,0.0000129521,0.000233165,0.000008552148,0.0001376402,0.000002417265],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003596485,"about_ca_system_score_gemma":0.000008803208,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002298951,"about_ca_topic_score_gemma":0.000009897405,"domain_scores_codex":[0.9993398,0.00000516775,0.0002767216,0.0001676136,0.00007565617,0.0001350104],"domain_scores_gemma":[0.9997892,0.0000668088,0.00001320792,0.00008184781,0.00002776297,0.00002113257],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001177529,0.000002611441,0.004382555,0.0005215249,0.000009356766,0.000003843871,0.001985089,0.9863365,0.00004476553,0.004504289,8.601993e-7,0.002207387],"study_design_scores_gemma":[0.0000609772,0.000005142736,0.001501095,0.0002233006,0.000003935469,0.000004687694,0.0002520245,0.996543,0.00004869929,0.0008341224,0.0004191384,0.0001038933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5748601,0.0004852308,0.4233313,0.00001630168,0.0004078377,0.00009768269,0.000001908355,0.0004157417,0.0003839272],"genre_scores_gemma":[0.9986693,0.00001442948,0.001153157,0.000007164351,0.00008368538,0.000006969972,0.00001071542,0.00002103801,0.00003360233],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4238091,"threshold_uncertainty_score":0.4153585,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Curse of dimensionality; Computer science; Topology (electrical circuits); Artificial intelligence; Theoretical computer science; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02401188408444463,"gpt":0.2946625806968081,"spread":0.2706506966123634,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00146034,0.0002162497,0.0003679427,0.0002159362,0.0001490905,0.00008257169,0.001166038,0.0001127547,0.00008245775],"category_scores_gemma":[0.0003709184,0.0002262815,0.00005846702,0.0008538972,0.0003738154,0.0003939653,0.001814847,0.0003464566,0.000042061],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002175771,"about_ca_system_score_gemma":0.0001135513,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004425383,"about_ca_topic_score_gemma":0.0007810741,"domain_scores_codex":[0.9973192,0.0003655296,0.0006130486,0.0007800124,0.0002730578,0.0006491097],"domain_scores_gemma":[0.9982608,0.0005643228,0.0001252116,0.0008596873,0.0001113441,0.00007866681],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005497448,0.0004810169,0.3187901,0.00006613578,0.00002660497,0.0002906824,0.00812696,0.005044269,0.0002397446,0.4466088,0.0005014436,0.2197693],"study_design_scores_gemma":[0.0009477698,0.0004054823,0.4202195,0.00008281604,0.000002116916,0.0001612753,0.0002910651,0.4503708,0.0008766614,0.1246438,0.001453455,0.0005453023],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7508739,0.0001124916,0.2388799,0.002334769,0.002454714,0.0002350944,8.404977e-7,0.0002525442,0.004855764],"genre_scores_gemma":[0.8564708,0.000001181297,0.1427567,0.0003979381,0.0003221073,0.000003259437,0.00000122452,0.000008484571,0.00003823679],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4453266,"threshold_uncertainty_score":0.922749,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02842100074181178,"gpt":0.2958389145257098,"spread":0.267417913783898,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00184954,0.0001938871,0.0003077815,0.001003898,0.0003647705,0.0002147647,0.0005486751,0.00006123882,0.000009883059],"category_scores_gemma":[0.0005249759,0.0002009894,0.00006882395,0.001900018,0.00005250692,0.0003688701,0.000420502,0.0003704528,0.00001428102],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001717073,"about_ca_system_score_gemma":0.00006630044,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008173647,"about_ca_topic_score_gemma":0.0000868824,"domain_scores_codex":[0.9979308,0.000154472,0.0004489371,0.0005218248,0.0001870918,0.0007569102],"domain_scores_gemma":[0.9991536,0.0002662338,0.0001871982,0.0002444813,0.0001014035,0.00004705899],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001990013,0.00002231294,0.03528875,0.00007311213,0.00001103333,0.00004016983,0.01780535,0.008440459,0.0001289616,0.8500553,0.00001910153,0.0880956],"study_design_scores_gemma":[0.0008670519,0.0004200164,0.01402387,0.002800239,0.000003796743,0.00006394868,0.003615909,0.8904956,0.00164307,0.006303648,0.07895996,0.0008029286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08692414,0.0002612661,0.8979821,0.0003848181,0.001555105,0.0002973795,1.883396e-7,0.0003031435,0.01229185],"genre_scores_gemma":[0.8925,0.000002694014,0.1011613,0.0001617297,0.0007441518,0.00001778897,9.209679e-7,0.00001908096,0.005392339],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8820551,"threshold_uncertainty_score":0.8196109,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01765535993720698,"gpt":0.2807336872351716,"spread":0.2630783272979647,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001351699,0.0003626939,0.0007312598,0.0003981522,0.0002162503,0.0002935917,0.0007151605,0.0002102424,0.00001411148],"category_scores_gemma":[0.0007408705,0.0003653168,0.000122011,0.000633269,0.0001180537,0.0004035093,0.0002378468,0.0004561203,0.00003941263],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003236192,"about_ca_system_score_gemma":0.0001389641,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001395951,"about_ca_topic_score_gemma":0.00004209246,"domain_scores_codex":[0.9965759,0.0003257067,0.0009161422,0.0009812072,0.0004100117,0.0007910423],"domain_scores_gemma":[0.9968464,0.002045024,0.0002396753,0.0005936294,0.0001606398,0.0001146756],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004721243,0.0002907788,0.008251792,0.004695623,0.00007956889,0.0002533475,0.02976157,0.8637618,0.01541128,0.01652751,0.00006628287,0.06042832],"study_design_scores_gemma":[0.001809578,0.0002653459,0.002662093,0.002877527,0.000005143509,0.0002768429,0.001792671,0.9882106,0.0008873998,0.0006639809,0.00003963232,0.000509157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5482953,0.00002183643,0.4478349,0.0001794732,0.001144426,0.0009912932,0.000005466491,0.0004576193,0.00106976],"genre_scores_gemma":[0.8036131,5.163475e-7,0.1960146,0.00005977564,0.000213263,0.00003502026,0.000007867378,0.00003178106,0.00002406152],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2553179,"threshold_uncertainty_score":0.9998799,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.3073435332083431,"gpt":0.4702849418396778,"spread":0.1629414086313347,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.003066996,0.0002200238,0.0005317813,0.0001302893,0.0003700283,0.00006321842,0.0003397447,0.00009773385,0.00002325315],"category_scores_gemma":[0.0250967,0.0001704098,0.0000994532,0.0007790161,0.0001418834,0.00007655479,0.0003811519,0.0003354804,0.000001359262],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000203929,"about_ca_system_score_gemma":0.00009009186,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002709614,"about_ca_topic_score_gemma":0.0006069205,"domain_scores_codex":[0.9974884,0.0006282982,0.000754133,0.0004246066,0.0001757948,0.000528811],"domain_scores_gemma":[0.9773366,0.02199062,0.0002242706,0.0003190044,0.00007255184,0.00005691084],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.00002950332,0.0001498382,0.9444509,0.0004748591,0.00003674452,0.000373141,0.02407823,0.01551852,0.00008600782,0.009932287,0.001189853,0.00368018],"study_design_scores_gemma":[0.00482836,0.0005066015,0.3905072,0.001209785,0.0001644077,0.0002668595,0.09249079,0.1376347,0.0007099889,0.3247982,0.04497688,0.001906278],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9692444,0.0001297127,0.02502082,0.004845773,0.0001953895,0.00037001,0.00000757291,0.0001151546,0.00007120978],"genre_scores_gemma":[0.9661008,0.00003399213,0.02904428,0.004592493,0.0001001814,0.00004604375,0.00003207606,0.00002273718,0.00002741071],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5539436,"threshold_uncertainty_score":0.9831153,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03089286117739838,"gpt":0.3120766095129839,"spread":0.2811837483355856,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001715414,0.0001642481,0.0002333657,0.0001460962,0.0003009745,0.0002241966,0.0004554515,0.00008111718,0.000008073028],"category_scores_gemma":[0.0004806054,0.0001737867,0.00002888649,0.0004598655,0.0002726522,0.0006942531,0.0004721429,0.0001780953,0.000009420627],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009413988,"about_ca_system_score_gemma":0.00004159262,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009795219,"about_ca_topic_score_gemma":0.00003413384,"domain_scores_codex":[0.9981611,0.0002945131,0.0004681801,0.0005082751,0.000231324,0.0003366321],"domain_scores_gemma":[0.9989371,0.0002749467,0.0001966178,0.0004171237,0.0001147747,0.00005944211],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002182842,0.00004776065,0.08687135,0.0001473918,0.00001539574,0.000005023948,0.02408828,0.0008445042,0.0008249474,0.1546665,0.00009630006,0.7323707],"study_design_scores_gemma":[0.000315973,0.0001780608,0.2474077,0.000138407,0.000003326749,0.0000438485,0.0002758798,0.6978042,0.003680426,0.04934775,0.0005122087,0.0002923007],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4531786,0.00007122982,0.5446484,0.0002328332,0.0005606244,0.0001550748,3.144624e-7,0.0001222572,0.001030663],"genre_scores_gemma":[0.5562741,0.00000335483,0.4434849,0.00009527255,0.0001245552,0.000003232634,8.213933e-7,0.00000621337,0.000007502086],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7320784,"threshold_uncertainty_score":0.7086818,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}