{"meta":{"query_hash":"e4cb37757b38","filters":{"venue":"Journal of Intelligent Information Systems"},"cohort_total":50,"direct_labels_cover":0,"predictions_cover":50,"exported":50,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/e4cb37757b38","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+Intelligent+Information+Systems"},"results":[{"id":"W1504222647","doi":"10.1023/a:1020990805004","title":"A Data Cube Model for Prediction-Based Web Prefetching","year":2003,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Hong Kong University of Science and Technology; University of Hong Kong; Simon Fraser University; U.S. Environmental Protection Agency","keywords":"Computer science; Instruction prefetch; Web server; Data cube; Web analytics; Data mining; Online analytical processing; Data Web; Web page; Web application; The Internet; Cluster analysis; Data warehouse; World Wide Web; Web modeling; Web intelligence; Machine learning; Cache; Operating system","score_opus":0.08014086763330527,"score_gpt":0.27628677019490616,"score_spread":0.1961459025616009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504222647","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019541972,0.00016642183,0.9947038,0.00010708468,0.0016446223,0.00023980312,0.000102572456,0.000041095347,0.0010403875],"genre_scores_gemma":[0.99071527,0.000035441844,0.008771323,0.00024870387,0.00009312393,0.000009252951,0.000028363407,0.00000504773,0.000093474424],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818593,0.00006411706,0.0010474257,0.00009095771,0.00045862832,0.00015291364],"domain_scores_gemma":[0.99787843,0.00014087786,0.0007755366,0.0005084801,0.00060149207,0.00009519881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018390234,0.00010571036,0.00019124198,0.00029089217,0.000113197115,0.00042079965,0.0009122577,0.00005416306,0.0000013969394],"category_scores_gemma":[0.00029621093,0.000084925916,0.00011033672,0.00014873703,0.00000835362,0.0035679543,0.000048062953,0.00015427833,0.000014747961],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043937016,0.000060735834,0.00020474968,0.00014919556,0.000080295475,0.0000011203919,0.0011864392,0.9532749,0.00013340371,0.02523168,0.013279189,0.0063543613],"study_design_scores_gemma":[0.00037081126,0.00007650615,0.0000024179053,0.00013150703,0.000012863321,0.000075036005,0.00026097993,0.9561417,0.00011099067,0.000102476704,0.04263553,0.000079147656],"about_ca_topic_score_codex":0.0000049054283,"about_ca_topic_score_gemma":9.815956e-7,"teacher_disagreement_score":0.98876107,"about_ca_system_score_codex":0.00009971287,"about_ca_system_score_gemma":0.0003884329,"threshold_uncertainty_score":0.40577808},"labels":[],"label_agreement":null},{"id":"W1512994456","doi":"10.1023/a:1015568521453","title":"Learning Prosodic Patterns for Mandarin Speech Synthesis","year":2002,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"Speech Recognition and Synthesis","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Alberta","funders":"Chinese Academy of Sciences","keywords":"Naturalness; Computer science; Prosody; Intelligibility (philosophy); Speech synthesis; Speech recognition; Cluster analysis; Artificial intelligence; Decision tree; Artificial neural network; Natural language processing","score_opus":0.03588713324134827,"score_gpt":0.24375575159079285,"score_spread":0.2078686183494446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512994456","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011715751,0.00010364915,0.9824516,0.00032626488,0.0011816779,0.0003268982,0.000007757964,0.00005612886,0.003830227],"genre_scores_gemma":[0.9889064,0.00023266893,0.00994737,0.00015675499,0.00021071822,0.000038042945,0.0000016948102,0.000008058997,0.000498301],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798065,0.00008041328,0.0011665699,0.00007431691,0.0005088383,0.00018923129],"domain_scores_gemma":[0.9977242,0.00031236236,0.0010306757,0.0001631631,0.0006604173,0.00010921938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011253138,0.0001215665,0.00025939767,0.00043025392,0.00012761136,0.00056210527,0.0004964646,0.00007216956,0.0001031342],"category_scores_gemma":[0.000549197,0.00009614671,0.00019130134,0.00018842929,0.000011692782,0.0019428286,0.000035222823,0.00016485857,0.00028033115],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002109403,0.00007028501,0.0008275312,0.0002465552,0.0000918345,0.000010113845,0.0030185957,0.00080309436,0.00007560173,0.0022295038,0.0039696996,0.9886361],"study_design_scores_gemma":[0.0007144085,0.0006865724,0.00022193369,0.0009047758,0.000053352902,0.002141763,0.004767182,0.53292423,0.05160228,0.0001783224,0.40526912,0.0005360467],"about_ca_topic_score_codex":0.000005227754,"about_ca_topic_score_gemma":3.7297264e-7,"teacher_disagreement_score":0.98810005,"about_ca_system_score_codex":0.00010081767,"about_ca_system_score_gemma":0.00002734153,"threshold_uncertainty_score":0.5420394},"labels":[],"label_agreement":null},{"id":"W1533605675","doi":"10.1023/a:1008736910058","title":"Partial Evaluation of Views","year":2001,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Tuple; Query optimization; Materialized view; Information retrieval; Spatial query; Query language; Web query classification; Web search query; Sargable; Data warehouse; View; Database; Data mining; Theoretical computer science; Search engine; Database design","score_opus":0.08159113884016463,"score_gpt":0.3311095683310115,"score_spread":0.2495184294908469,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1533605675","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011685768,0.000715073,0.98282194,0.00005618555,0.0017060696,0.00022162829,0.000004196684,0.000011296296,0.0027778489],"genre_scores_gemma":[0.9929389,0.0002174637,0.006511147,0.000052602958,0.00021557116,0.00000993358,0.000005944741,0.000003258909,0.00004519909],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971591,0.000148988,0.0015148756,0.00004789054,0.0010188229,0.00011027865],"domain_scores_gemma":[0.996172,0.00004815693,0.0017274499,0.00026393324,0.0017211348,0.00006733027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030062648,0.000084938176,0.0002469002,0.00024800052,0.000040885476,0.00006296568,0.00028470176,0.000038256683,0.0000180101],"category_scores_gemma":[0.00019021172,0.00006220223,0.00009542472,0.00028533675,0.000017016408,0.00395797,0.000042334774,0.00008301365,0.00005631709],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013505682,0.00015915635,0.0014324118,0.0003785567,0.00020359254,0.00000975409,0.015202277,0.1566216,0.00086256827,0.39238876,0.008033649,0.42457262],"study_design_scores_gemma":[0.00046931606,0.00019037322,0.00014318772,0.00031633893,0.000023258202,0.0005519186,0.0018547864,0.14072753,0.004600987,0.00013134388,0.8508616,0.00012933947],"about_ca_topic_score_codex":0.000019157616,"about_ca_topic_score_gemma":0.0000014263528,"teacher_disagreement_score":0.9812531,"about_ca_system_score_codex":0.00010528795,"about_ca_system_score_gemma":0.00014969449,"threshold_uncertainty_score":0.2869433},"labels":[],"label_agreement":null},{"id":"W1548844896","doi":"10.1023/a:1011276003319","title":"Parametric Algorithms for Mining Share Frequent Itemsets","year":2001,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Association rule learning; Data mining; Classifier (UML); Factor (programming language); Measure (data warehouse); Artificial intelligence; Machine learning","score_opus":0.05764236875585299,"score_gpt":0.30549727500668516,"score_spread":0.24785490625083217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1548844896","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034238074,0.0003103097,0.9936925,0.0003099925,0.0012372048,0.00030387728,0.000044394343,0.000041214204,0.00063668564],"genre_scores_gemma":[0.56141937,0.0007550572,0.434769,0.00084331026,0.0012603318,0.000173903,0.0002065708,0.000031348936,0.0005411003],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.997988,0.000025703865,0.0012204947,0.000095931726,0.00045759734,0.00021228277],"domain_scores_gemma":[0.9971772,0.00021276239,0.0011028802,0.00031166757,0.001051312,0.00014418385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092432805,0.00012636557,0.00024121559,0.0005403329,0.00013524151,0.0006680596,0.00087598525,0.000066048524,0.000008147574],"category_scores_gemma":[0.0002594293,0.000102618185,0.00011837698,0.00084562047,0.00001290925,0.002786483,0.00006725811,0.00011553746,0.000077326586],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017905026,0.00015110249,0.0007825643,0.00016168381,0.00016349234,0.00001183492,0.0042784205,0.013183459,0.00002701987,0.025738193,0.050217442,0.9052669],"study_design_scores_gemma":[0.00033843127,0.00020884677,0.00018378916,0.00017949902,0.000013195389,0.0007555599,0.001303194,0.4096332,0.00027657748,0.00009646975,0.5868299,0.00018136569],"about_ca_topic_score_codex":0.000017525563,"about_ca_topic_score_gemma":2.4810114e-7,"teacher_disagreement_score":0.9050855,"about_ca_system_score_codex":0.00012482944,"about_ca_system_score_gemma":0.0000988204,"threshold_uncertainty_score":0.6442115},"labels":[],"label_agreement":null},{"id":"W1559282679","doi":"10.1023/a:1023505917953","title":"Application of Temporal Descriptors to Musical Instrument Sound Recognition","year":2003,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"Music and Audio Processing","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Mashhad University of Medical Sciences; McGill University","keywords":"Computer science; TRACE (psycholinguistics); Representation (politics); Process (computing); Musical; Feature extraction; Artificial intelligence; Information retrieval; Multimedia; Programming language","score_opus":0.03994754284207759,"score_gpt":0.2571475041979413,"score_spread":0.21719996135586372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1559282679","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06916417,0.000040908886,0.92810124,0.00012447612,0.00090015697,0.00018483894,0.0000013559285,0.000012310776,0.0014705107],"genre_scores_gemma":[0.9834054,0.0000069088737,0.01621375,0.00028468505,0.0000661691,0.0000068277295,0.0000024929093,0.0000027189594,0.000011009328],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99814874,0.000058155976,0.0011377841,0.00006315749,0.00047565647,0.00011650119],"domain_scores_gemma":[0.997966,0.000030553136,0.001084667,0.00015250461,0.0006562719,0.00011000441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009585857,0.00008828999,0.00019413285,0.00031568645,0.000054488646,0.00018138997,0.00028302043,0.00004981399,0.0000064851183],"category_scores_gemma":[0.00011573824,0.00007166899,0.00007232728,0.00037403245,0.000014241975,0.0018266361,0.000026624484,0.000100167716,0.00006713647],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009564627,0.00029922827,0.0040789177,0.0007223995,0.00013913358,0.000003343704,0.022949884,0.012369976,0.0020166242,0.08616526,0.007830532,0.86332905],"study_design_scores_gemma":[0.0019197555,0.0018010852,0.001129806,0.0018612399,0.00007408582,0.0014376959,0.013293979,0.073764235,0.11337333,0.010615825,0.77957565,0.0011533115],"about_ca_topic_score_codex":0.000014210248,"about_ca_topic_score_gemma":5.896094e-7,"teacher_disagreement_score":0.91424125,"about_ca_system_score_codex":0.000115365714,"about_ca_system_score_gemma":0.000104868355,"threshold_uncertainty_score":0.29225767},"labels":[],"label_agreement":null},{"id":"W1581863564","doi":"10.1023/a:1011208900462","title":"Feature Weight Maintenance in Case Bases Using Introspective Learning","year":2001,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"University of California, Irvine; Simon Fraser University","keywords":"Computer science","score_opus":0.017717687549317504,"score_gpt":0.2514292455076879,"score_spread":0.2337115579583704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581863564","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034676395,0.00046502452,0.9621959,0.000339922,0.0009232124,0.00012026126,0.0000013747133,0.000030520805,0.001247402],"genre_scores_gemma":[0.9922194,0.000092569055,0.0072646122,0.00012108645,0.00014223784,0.000001927852,0.0000015837579,0.0000050149843,0.00015158641],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984231,0.00014081676,0.00076016074,0.000083844665,0.00035168589,0.00024039901],"domain_scores_gemma":[0.9980703,0.00016898758,0.0010014714,0.00014831302,0.0005154887,0.00009545035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012767212,0.00013704045,0.00025869987,0.00052429555,0.00013495095,0.00031775644,0.00032860236,0.00008406981,0.0000063188404],"category_scores_gemma":[0.0001717865,0.00010886448,0.00008339599,0.00057103176,0.000019034946,0.0028146005,0.000051568535,0.00052861177,0.00002406326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009901975,0.000043435928,0.02235395,0.00013932059,0.00006481722,0.0025508679,0.013367885,0.9193575,0.00005884918,0.00809802,0.0035703718,0.030296009],"study_design_scores_gemma":[0.00046775513,0.00021907565,0.00018958419,0.001190893,0.000008679767,0.03822508,0.0057908106,0.86811,0.00035971846,0.000107987405,0.08508793,0.00024247104],"about_ca_topic_score_codex":0.00012574678,"about_ca_topic_score_gemma":0.0000060334905,"teacher_disagreement_score":0.95754296,"about_ca_system_score_codex":0.0003574108,"about_ca_system_score_gemma":0.00012132404,"threshold_uncertainty_score":0.44393647},"labels":[],"label_agreement":null},{"id":"W1585071718","doi":"10.1023/a:1008788926897","title":"Temporal Granularity: Completing the Puzzle","year":2001,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Granularity; Computer science; Temporal database; Semantics (computer science); Data mining; Theoretical computer science; Programming language","score_opus":0.022796241693159934,"score_gpt":0.24354817146018765,"score_spread":0.2207519297670277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1585071718","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021692317,0.00008350732,0.9900547,0.0014344204,0.0014373328,0.00014226034,9.077042e-7,0.0000308058,0.004646795],"genre_scores_gemma":[0.9953919,0.000087674,0.0039356565,0.00037756344,0.00012591478,0.000002244107,0.0000029236987,0.0000024271003,0.00007366955],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984139,0.000086885695,0.0008935609,0.00004161286,0.00044696993,0.00011707883],"domain_scores_gemma":[0.99829215,0.0000858903,0.0008417564,0.00018048176,0.0005348133,0.000064920925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010813267,0.00007926038,0.0001383926,0.00020383517,0.00018816271,0.0005186546,0.00043370796,0.000037937833,0.000026132246],"category_scores_gemma":[0.00008963411,0.000051221883,0.000091606635,0.00033208716,0.000023957287,0.0020597847,0.000042559604,0.00017239487,0.000084098145],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010108045,0.00013056074,0.04829291,0.00014781783,0.00023955932,0.000042399697,0.017676316,0.2017949,0.000082945495,0.2936344,0.0212054,0.4166517],"study_design_scores_gemma":[0.0003403099,0.00008090967,0.001918763,0.00010296494,0.000009341686,0.002149582,0.002842019,0.2969819,0.00012306366,0.00021601602,0.6950851,0.00015001182],"about_ca_topic_score_codex":0.00003262683,"about_ca_topic_score_gemma":0.0000044414055,"teacher_disagreement_score":0.9932227,"about_ca_system_score_codex":0.000069964764,"about_ca_system_score_gemma":0.000057911857,"threshold_uncertainty_score":0.50013983},"labels":[],"label_agreement":null},{"id":"W1592511765","doi":"10.1023/a:1008778107391","title":"Efficient Rule-Based Attribute-Oriented Induction for Data Mining","year":2000,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Generalization; Data mining; Rule induction; Backtracking; Knowledge extraction; Algorithm; Mathematics","score_opus":0.05392687639899999,"score_gpt":0.2939089391231826,"score_spread":0.23998206272418263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1592511765","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019003332,0.00008336231,0.9789182,0.00033641348,0.0009917095,0.00028865002,0.000119642624,0.000039122297,0.00021959313],"genre_scores_gemma":[0.58327156,0.00006476751,0.4138349,0.000549441,0.00090595376,0.00008792336,0.00096250453,0.000021759073,0.00030122205],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981339,0.00003477291,0.0010914037,0.00012081144,0.00044379794,0.00017531599],"domain_scores_gemma":[0.9977998,0.00012485558,0.0007533046,0.0006262164,0.0005912597,0.00010457263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013332798,0.00010956964,0.00019235273,0.00025056268,0.00015469122,0.00036212493,0.0010766049,0.000057476416,0.000013822929],"category_scores_gemma":[0.00011043773,0.00009026984,0.00006799845,0.00041887836,0.000017826025,0.0014597541,0.00006405912,0.00010922556,0.000075100455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054138163,0.00017752121,0.00008699469,0.00010944281,0.000074748714,0.000001420114,0.0019059363,0.16050242,0.00004545675,0.004263864,0.022006346,0.8107717],"study_design_scores_gemma":[0.00027391934,0.00008338335,0.000039637835,0.000095855146,0.000009683981,0.00006200447,0.0004122002,0.74442255,0.00027053137,0.00000471127,0.25424334,0.00008215604],"about_ca_topic_score_codex":0.000015182267,"about_ca_topic_score_gemma":2.201921e-7,"teacher_disagreement_score":0.81068957,"about_ca_system_score_codex":0.00009311083,"about_ca_system_score_gemma":0.00015301724,"threshold_uncertainty_score":0.3681097},"labels":[],"label_agreement":null},{"id":"W1915750711","doi":"10.1023/a:1020945620934","title":"The Wisdom Web: New Challenges for Web Intelligence (WI)","year":2003,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science","score_opus":0.05274164898155752,"score_gpt":0.281940192305971,"score_spread":0.22919854332441347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1915750711","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001158801,0.006158113,0.97957885,0.0014758608,0.00399394,0.0005490538,0.0000024067836,0.00006683411,0.0080590695],"genre_scores_gemma":[0.96841836,0.009524765,0.020389477,0.00030227896,0.0005586704,0.000070643975,0.0000015661794,0.000019406007,0.00071482145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972298,0.00015485927,0.0016957418,0.00010176775,0.00053369923,0.00028411223],"domain_scores_gemma":[0.99669063,0.0004521981,0.001438705,0.00044951527,0.00079819007,0.00017077103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031136787,0.00018226253,0.00031706117,0.00026180246,0.00020995905,0.0007390474,0.0011568777,0.00010178024,0.0000035110718],"category_scores_gemma":[0.00029336833,0.00011250552,0.00022474927,0.00023888666,0.000026613254,0.0021191067,0.000054558546,0.00020106656,0.000048873833],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018830453,0.00002686477,0.000023830622,0.00012359892,0.00009672658,0.0000013882229,0.0030738646,0.0003865508,0.000037392365,0.7627123,0.035942726,0.19755593],"study_design_scores_gemma":[0.00014907347,0.00026406493,0.0000045587585,0.00018306982,0.0000064799874,0.0003617974,0.00283406,0.01117106,0.0030040701,0.0035180505,0.9783595,0.00014420538],"about_ca_topic_score_codex":0.000010213962,"about_ca_topic_score_gemma":0.000005262735,"teacher_disagreement_score":0.9683025,"about_ca_system_score_codex":0.00013360444,"about_ca_system_score_gemma":0.00038202165,"threshold_uncertainty_score":0.71266514},"labels":[],"label_agreement":null},{"id":"W1964236997","doi":"10.1007/s10844-014-0350-3","title":"An approach to structure determination and estimation of hierarchical Archimedean Copulas and its application to Bayesian classification","year":2015,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"Financial Risk and Volatility Modeling","field":"Economics, Econometrics and Finance","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Estimator; Copula (linguistics); Computer science; Bayesian probability; Hierarchical database model; Econometrics; Artificial intelligence; Machine learning; Data mining; Mathematics; Statistics","score_opus":0.05024089782877226,"score_gpt":0.2764964665452292,"score_spread":0.22625556871645694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964236997","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.423404,0.00009975023,0.5757915,0.00006912007,0.00009676722,0.0002750559,0.00002524205,0.0000043140494,0.00023428752],"genre_scores_gemma":[0.9908034,0.000019781402,0.009026863,0.000038357688,0.00006153287,0.000009600766,0.000029561399,0.0000058112387,0.000005085079],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984428,0.000028316163,0.001211563,0.00010473706,0.00011973734,0.00009279496],"domain_scores_gemma":[0.99851996,0.000023472814,0.00081442285,0.00012428305,0.000309483,0.00020839449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010046054,0.0000903195,0.0002704858,0.0005308832,0.00004342182,0.00009089767,0.00011507362,0.00008417152,7.7220517e-7],"category_scores_gemma":[0.00026862987,0.00009152554,0.000025675608,0.00019843086,0.000013014886,0.0009974852,0.000018314273,0.00010713808,0.000007449609],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044180304,0.00018079254,0.013425096,0.00066092354,0.000042779993,2.2878748e-7,0.044700738,0.4193635,0.0006647906,0.28271866,0.0001603501,0.23764032],"study_design_scores_gemma":[0.00017585816,0.0002094475,0.0061501707,0.00004153975,0.000004995166,0.000021291438,0.0010000049,0.9885887,0.00026669475,0.0024914627,0.0009543745,0.000095462034],"about_ca_topic_score_codex":0.00005074481,"about_ca_topic_score_gemma":0.00000275091,"teacher_disagreement_score":0.5692252,"about_ca_system_score_codex":0.00009517232,"about_ca_system_score_gemma":0.000033436158,"threshold_uncertainty_score":0.3732303},"labels":[],"label_agreement":null},{"id":"W1972766481","doi":"10.1007/s10844-006-0005-0","title":"Dynamic management of UDDI registries in a wireless environment of web services: Concepts, architecture, operation, and deployment","year":2006,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; Université Laval","funders":"","keywords":"Computer science; WS-I Basic Profile; Web service; World Wide Web; Devices Profile for Web Services; SOAP; Web development; Web application security","score_opus":0.00538153121096114,"score_gpt":0.21148395109802282,"score_spread":0.20610241988706168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972766481","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17485814,0.0012822028,0.82173884,0.00014203912,0.00034591794,0.00080347486,0.000007735945,0.0000142719955,0.0008073504],"genre_scores_gemma":[0.9944272,0.0010577416,0.0043721255,0.00004465938,0.000016055803,0.000020681226,0.000009877289,0.000005101461,0.000046562844],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99719596,0.00009290604,0.0017903636,0.00010730248,0.00065494026,0.0001585062],"domain_scores_gemma":[0.99802166,0.00004403191,0.0014828357,0.000310087,0.000091384965,0.000049985465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083568366,0.00015062524,0.0003294208,0.00038472723,0.000031612504,0.00010578719,0.0004859528,0.000042631604,0.0000053695435],"category_scores_gemma":[0.0000015965192,0.0001260995,0.00006727542,0.0002115358,0.0000486411,0.0007571212,0.00015864383,0.000096914206,0.000005563881],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010379536,0.0002226352,0.0024715823,0.0026075933,0.00023515543,0.000024448118,0.0030229671,0.8867082,0.00031022166,0.060301762,0.0005724306,0.043419216],"study_design_scores_gemma":[0.0031696192,0.0008583541,0.0047035883,0.0035163283,0.00009991607,0.0001596537,0.008312103,0.91034627,0.0059558568,0.00058453705,0.061704803,0.0005889943],"about_ca_topic_score_codex":0.00010247341,"about_ca_topic_score_gemma":0.000017208482,"teacher_disagreement_score":0.81956905,"about_ca_system_score_codex":0.0002224715,"about_ca_system_score_gemma":0.000041057636,"threshold_uncertainty_score":0.51421887},"labels":[],"label_agreement":null},{"id":"W1982859232","doi":"10.1007/s10844-008-0074-3","title":"The Multi-Tree Cubing algorithm for computing iceberg cubes","year":2008,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Data cube; Computation; Algorithm; Partition (number theory); Online analytical processing; Pruning; Tree (set theory); Sorting; Trie; Data mining; Data structure; Data warehouse; Mathematics","score_opus":0.0363375668273497,"score_gpt":0.2791748354478105,"score_spread":0.24283726862046082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982859232","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005451603,0.0009740347,0.9949794,0.00008763095,0.002845087,0.00031064893,0.000009850784,0.000035667104,0.00021253622],"genre_scores_gemma":[0.16893145,0.0009385021,0.82798326,0.00028302334,0.0012526009,0.000033091743,0.000016870214,0.000022057764,0.0005391578],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777097,0.00006307641,0.0013961842,0.00007465213,0.000456051,0.00023909629],"domain_scores_gemma":[0.9969464,0.0003858757,0.001347532,0.00027818567,0.0009486327,0.00009336381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012421969,0.0001357881,0.00025682707,0.00016124539,0.0006147637,0.0002145732,0.00055077835,0.000045047684,4.5989614e-7],"category_scores_gemma":[0.00017490653,0.000084647174,0.0001546783,0.00020838539,0.000045390672,0.0038808803,0.00009942791,0.00015368515,0.00002778017],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033405413,0.00006545918,0.0002599323,0.00019838382,0.00020476017,0.000018276263,0.015169089,0.032568563,0.00007373234,0.108246446,0.007977062,0.8351849],"study_design_scores_gemma":[0.00027534607,0.00008062685,0.000032159074,0.00014632111,0.0000035132523,0.00078522245,0.0022242146,0.546734,0.0006864642,0.000016064609,0.44891196,0.000104139304],"about_ca_topic_score_codex":0.000024575973,"about_ca_topic_score_gemma":0.000002545662,"teacher_disagreement_score":0.83508074,"about_ca_system_score_codex":0.000108705586,"about_ca_system_score_gemma":0.00011326452,"threshold_uncertainty_score":0.47283277},"labels":[],"label_agreement":null},{"id":"W1983388548","doi":"10.1007/s10844-012-0229-0","title":"Reducing the size of databases for multirelational classification: a subgraph-based approach","year":2012,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"Data Quality and Management","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; National Research Council Canada","funders":"","keywords":"Computer science; Database; Preprocessor; Tuple; Data mining; Relational database; Data pre-processing; Schema (genetic algorithms); Machine learning; Artificial intelligence","score_opus":0.34538316626348664,"score_gpt":0.421210654523675,"score_spread":0.07582748826018837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983388548","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047327443,0.00030647553,0.98887,0.00052447786,0.0013137079,0.0005585077,0.0001499434,0.000006727926,0.0035374186],"genre_scores_gemma":[0.9915719,0.000017450931,0.007707572,0.0001888686,0.00023011566,0.000025640824,0.00005932944,0.000003561495,0.00019558503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9956981,0.00024151847,0.00234426,0.00006725924,0.0014978255,0.00015102919],"domain_scores_gemma":[0.992221,0.0030663568,0.002870416,0.00041780266,0.0013395748,0.000084873194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013156024,0.000094640134,0.0002560618,0.0003467634,0.00013948398,0.0001988294,0.0006326823,0.00003812372,0.000042195927],"category_scores_gemma":[0.0046564457,0.000053007632,0.00020094537,0.00047308308,0.000074880314,0.0028021247,0.000045583394,0.000107734144,0.00003717053],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000794917,0.0008729892,0.010609151,0.0007332234,0.0004101403,2.2888443e-7,0.014401121,0.12661026,0.00026216588,0.5515664,0.19968154,0.09405785],"study_design_scores_gemma":[0.00056976423,0.00009542419,0.0051645995,0.00013321367,0.000059611986,0.000029083407,0.035247166,0.09476523,0.00078980013,0.00018846306,0.86281705,0.00014060496],"about_ca_topic_score_codex":0.000017612634,"about_ca_topic_score_gemma":5.469178e-7,"teacher_disagreement_score":0.9868391,"about_ca_system_score_codex":0.00005522048,"about_ca_system_score_gemma":0.00010039443,"threshold_uncertainty_score":0.55745363},"labels":[],"label_agreement":null},{"id":"W1987149779","doi":"10.1023/b:jiis.0000029668.88665.1a","title":"Interval Set Clustering of Web Users with Rough K-Means","year":2004,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":523,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cluster analysis; Computer science; Data mining; Web mining; Rough set; Fuzzy clustering; Set (abstract data type); Information retrieval; Machine learning; Web page; World Wide Web","score_opus":0.026518786575742293,"score_gpt":0.24663372818729987,"score_spread":0.22011494161155756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987149779","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02753995,0.000094257826,0.96782094,0.00024441828,0.0009914688,0.00014263419,0.000004370045,0.000021998403,0.0031399673],"genre_scores_gemma":[0.98117894,0.00006652323,0.018528866,0.00013079208,0.0000752972,0.0000018722277,0.0000017525501,0.0000042109245,0.000011724027],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804556,0.00003545394,0.0011517723,0.000059863654,0.0005463262,0.00016100722],"domain_scores_gemma":[0.99798894,0.00003287067,0.0011819919,0.0002309699,0.0004747235,0.000090501046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061995734,0.000122654,0.00028444242,0.0002875037,0.00004489234,0.00023300553,0.0006380524,0.000053179905,0.0000037806012],"category_scores_gemma":[0.000026917576,0.00008051756,0.00010808171,0.00030443704,0.00002799175,0.0027352385,0.00007802777,0.00016330561,0.000030911804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010484936,0.00006475797,0.0005141854,0.0002841423,0.00014923938,0.000022057193,0.018599477,0.954924,0.000058465877,0.014179123,0.00074059435,0.010359142],"study_design_scores_gemma":[0.004905432,0.0053474507,0.00080983725,0.004513694,0.00007976588,0.006305902,0.02276052,0.830909,0.0054079546,0.000741245,0.11719097,0.0010281979],"about_ca_topic_score_codex":0.000044871264,"about_ca_topic_score_gemma":0.0000058180217,"teacher_disagreement_score":0.95363903,"about_ca_system_score_codex":0.00014295263,"about_ca_system_score_gemma":0.00015455934,"threshold_uncertainty_score":0.32834107},"labels":[],"label_agreement":null},{"id":"W1991329811","doi":"10.1007/s10844-006-0242-2","title":"Genetic algorithms based approach to database vertical partition","year":2006,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Partition (number theory); Crossover; Computer science; String (physics); Cluster analysis; Algorithm; Genetic algorithm; Partition problem; Constraint (computer-aided design); Theoretical computer science; Artificial intelligence; Mathematics; Combinatorics; Machine learning","score_opus":0.02254776506449425,"score_gpt":0.24721010699663734,"score_spread":0.2246623419321431,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991329811","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025077271,0.00012238816,0.9948557,0.00009817696,0.0009586022,0.00020542779,0.000015092856,0.000032422067,0.0012044464],"genre_scores_gemma":[0.74778676,0.000015141824,0.2510954,0.00043456073,0.000547933,0.000019579235,0.000064506174,0.000007837377,0.000028266828],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99779576,0.00007213256,0.0010934895,0.00010133993,0.00073981803,0.00019745991],"domain_scores_gemma":[0.9986063,0.000052605614,0.00032529846,0.0003617198,0.00048237378,0.00017167164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006061047,0.00012409054,0.00020087176,0.00033547962,0.000083681705,0.00044589667,0.0006132777,0.00005481276,0.0000058107253],"category_scores_gemma":[0.000047390215,0.00009386202,0.00008137735,0.0003441101,0.000013665344,0.0023460365,0.00010088045,0.00013773056,0.00015047955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013091599,0.00082323246,0.00090199587,0.00035614954,0.00006424846,0.000035436693,0.0011082947,0.7698402,0.0007849252,0.062317904,0.10127036,0.062366363],"study_design_scores_gemma":[0.00026862984,0.00013114474,0.0005691779,0.00011771469,0.000007651909,0.00016705824,0.00010699727,0.9255016,0.001755826,0.00006246291,0.071172565,0.00013919233],"about_ca_topic_score_codex":0.0000662389,"about_ca_topic_score_gemma":2.4069513e-7,"teacher_disagreement_score":0.745279,"about_ca_system_score_codex":0.00010204067,"about_ca_system_score_gemma":0.00009737431,"threshold_uncertainty_score":0.42997918},"labels":[],"label_agreement":null},{"id":"W1995119722","doi":"10.1007/s10844-009-0098-3","title":"Identification of a dominating instrument in polytimbral same-pitch mixes using SVM classifiers with non-linear kernel","year":2009,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"Music and Audio Processing","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Research Council Canada; University of North Carolina at Charlotte; Universidade Federal do ABC; McGill University; Louisiana State University; National Science Foundation","keywords":"Musical instrument; Computer science; Support vector machine; Speech recognition; Classifier (UML); Identification (biology); Octave (electronics); Pattern recognition (psychology); Training set; Artificial intelligence; Test set; Set (abstract data type); Kernel (algebra); Harmonic; Noise (video); Acoustics; Mathematics; Physics","score_opus":0.024514961797294028,"score_gpt":0.2697191419646219,"score_spread":0.24520418016732784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995119722","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4064564,0.00005466551,0.59277993,0.0001242168,0.00027975577,0.00011286909,6.21953e-7,0.0000062571985,0.000185265],"genre_scores_gemma":[0.9888939,0.000017380282,0.010882041,0.00013266173,0.000051101506,0.000001210154,9.4700835e-7,0.0000030346212,0.00001769662],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974488,0.00004466958,0.0016756938,0.00008018477,0.0005832332,0.00016742808],"domain_scores_gemma":[0.99694103,0.000035137797,0.0023138744,0.00016605566,0.0004782998,0.000065578955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011495868,0.00012030635,0.00028540404,0.00053211325,0.00006451646,0.00024668608,0.0004011131,0.00005895826,0.0000014541969],"category_scores_gemma":[0.000056305482,0.000091652975,0.00006568296,0.00051601033,0.000026176622,0.0031066937,0.00002846616,0.00017468736,0.000004377445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000436159,0.0005013867,0.011395801,0.0014077241,0.00020506282,0.000031628675,0.088333026,0.32458246,0.04063117,0.013282641,0.00032604657,0.5188669],"study_design_scores_gemma":[0.0007915644,0.0002856237,0.0021778166,0.0016043752,0.000014682462,0.00027471673,0.0067106686,0.94105554,0.046449885,0.0001084322,0.0003228422,0.00020384166],"about_ca_topic_score_codex":0.0000447773,"about_ca_topic_score_gemma":0.00000116511,"teacher_disagreement_score":0.6164731,"about_ca_system_score_codex":0.00019790711,"about_ca_system_score_gemma":0.0002047882,"threshold_uncertainty_score":0.37375},"labels":[],"label_agreement":null},{"id":"W2002963734","doi":"10.1007/s10844-006-0036-6","title":"Is it DSS or OLTP: automatically identifying DBMS workloads","year":2007,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); Queen's University","funders":"Microsoft; International Business Machines Corporation","keywords":"Online transaction processing; Computer science; Workload; Online analytical processing; Database; Benchmark (surveying); Decision support system; Construct (python library); Transaction processing; Data mining; Operating system; Database transaction; Data warehouse; Programming language","score_opus":0.05905425229981971,"score_gpt":0.33796667652316315,"score_spread":0.27891242422334345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002963734","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002015709,0.00028916993,0.99104434,0.0002774245,0.0029743107,0.00022586157,0.0000068060244,0.000057692552,0.003108681],"genre_scores_gemma":[0.79249966,0.00048861455,0.20017129,0.0028551915,0.0012370674,0.000016577835,0.000013114705,0.00003115851,0.002687292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9959847,0.000056929963,0.0025070305,0.00010352475,0.001011841,0.00033600163],"domain_scores_gemma":[0.99647313,0.0002452875,0.0017276171,0.00042431516,0.0009049239,0.00022472667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028587922,0.00018785392,0.00038995952,0.0005114244,0.00014813387,0.00045187148,0.000664963,0.00009656076,0.00004838696],"category_scores_gemma":[0.00026347762,0.00012820607,0.00016183736,0.00057842874,0.000032999742,0.0066005797,0.00013958877,0.00025235236,0.00038740347],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005953309,0.0003014314,0.0015310212,0.002926856,0.000768636,0.0004318127,0.09371972,0.009070026,0.00083312223,0.49568573,0.10572637,0.28840995],"study_design_scores_gemma":[0.0006049469,0.00031887068,0.00031399826,0.0024777048,0.000020279036,0.002514552,0.014682598,0.032214288,0.0054878,0.00015050679,0.94076425,0.0004502305],"about_ca_topic_score_codex":0.000020210999,"about_ca_topic_score_gemma":0.0000048940005,"teacher_disagreement_score":0.8350378,"about_ca_system_score_codex":0.00020966415,"about_ca_system_score_gemma":0.00016514125,"threshold_uncertainty_score":0.52280915},"labels":[],"label_agreement":null},{"id":"W2014504390","doi":"10.1007/s10844-012-0224-5","title":"Iterative classification for multiple target attributes","year":2012,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Computer science; Exploit; Machine learning; Artificial intelligence; Data mining; Scheme (mathematics); Computation; Artificial neural network; Decision tree; Algorithm","score_opus":0.054814601534027445,"score_gpt":0.29749545444652475,"score_spread":0.2426808529124973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014504390","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015067809,0.00036071194,0.99500227,0.00051838433,0.0016637862,0.00025970058,0.000019533883,0.000034146906,0.0006346647],"genre_scores_gemma":[0.97354907,0.000036448288,0.025775345,0.000107860964,0.00034317264,0.00002261888,0.000083094405,0.000003887163,0.000078514946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983804,0.00009794887,0.00094746734,0.000056522764,0.00033371738,0.00018389603],"domain_scores_gemma":[0.9972092,0.00030018648,0.0012915443,0.00022845276,0.0008510348,0.00011960143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016631404,0.00010055604,0.00017771486,0.00026667822,0.00011341079,0.00032945175,0.00042087358,0.00006247268,0.0000043874643],"category_scores_gemma":[0.0006431617,0.000076891294,0.00009350731,0.00020880676,0.00001216712,0.0053533106,0.000031131403,0.0001368876,0.00009702784],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020597033,0.00043844123,0.076669335,0.000600361,0.0002510385,5.736701e-7,0.028636362,0.013163874,0.0020892927,0.67740124,0.06573294,0.13481054],"study_design_scores_gemma":[0.0003160738,0.00013384686,0.00576332,0.00006311303,0.000008247586,0.000068434216,0.0012169257,0.31276932,0.0019350084,0.00008787079,0.67750734,0.00013048976],"about_ca_topic_score_codex":0.000004883428,"about_ca_topic_score_gemma":1.280255e-7,"teacher_disagreement_score":0.97204226,"about_ca_system_score_codex":0.000111681686,"about_ca_system_score_gemma":0.000057135625,"threshold_uncertainty_score":0.38810208},"labels":[],"label_agreement":null},{"id":"W2029146157","doi":"10.1007/s10844-013-0273-4","title":"Dream sentiment analysis using second order soft co-occurrences (SOSCO) and time course representations","year":2013,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"Sentiment Analysis and Opinion Mining","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Dream; Computer science; Sentiment analysis; Representation (politics); Artificial intelligence; Natural language processing; Annotation; Scale (ratio); Domain (mathematical analysis); Feature (linguistics); Linguistics; Psychology; Mathematics","score_opus":0.02410377205739697,"score_gpt":0.3056176712115789,"score_spread":0.2815138991541819,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029146157","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15333293,0.0005599832,0.8435544,0.0002262638,0.00067899935,0.00029484203,0.000008686871,0.000026368316,0.001317557],"genre_scores_gemma":[0.99119306,0.000052842934,0.007919164,0.00014451366,0.00012743466,0.0000071910904,0.000024583478,0.00000508978,0.00052613835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757904,0.00010554158,0.0013650364,0.00012110112,0.00064588443,0.00018341249],"domain_scores_gemma":[0.9969305,0.00012752204,0.0014667489,0.00025604913,0.0010620351,0.0001571801],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008418923,0.00014647718,0.00038997576,0.0008057711,0.00016257989,0.001175856,0.0003771261,0.000054006177,0.00048213225],"category_scores_gemma":[0.000045120578,0.000115502975,0.00019065618,0.0010117494,0.000035945643,0.003922554,0.00007103278,0.000119288525,0.00020759065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065313056,0.0009641418,0.18568477,0.00046578306,0.020579696,0.000026929405,0.06642001,0.50794154,0.0035072814,0.01752305,0.11359306,0.083228424],"study_design_scores_gemma":[0.0002270474,0.000066713656,0.0020724295,0.000072735565,0.0002737662,0.00007783539,0.0038933412,0.985896,0.0009042352,0.00003823664,0.0062883627,0.00018933007],"about_ca_topic_score_codex":0.00005766002,"about_ca_topic_score_gemma":8.907026e-7,"teacher_disagreement_score":0.8378601,"about_ca_system_score_codex":0.000059418187,"about_ca_system_score_gemma":0.000095551244,"threshold_uncertainty_score":0.999861},"labels":[],"label_agreement":null},{"id":"W2029677459","doi":"10.1007/s10844-013-0254-7","title":"Cost-sensitive three-way email spam filtering","year":2013,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"Spam and Phishing Detection","field":"Computer Science","cited_by":193,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Focus (optics); Set (abstract data type); Machine learning; Function (biology); Binary classification; Data mining; Binary number; Artificial intelligence; Support vector machine","score_opus":0.034939374072911165,"score_gpt":0.24483781950622216,"score_spread":0.209898445433311,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029677459","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027100831,0.000070425755,0.9663028,0.00022108616,0.0034281944,0.00028931565,0.0000012227363,0.00004528021,0.0025408014],"genre_scores_gemma":[0.99649864,0.000029952811,0.002911562,0.00019398969,0.00028084387,0.000010264347,0.0000014024964,0.0000043431164,0.0000689846],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983279,0.000052027743,0.0009073202,0.000061996274,0.00048096603,0.0001697681],"domain_scores_gemma":[0.99780613,0.000091674505,0.00087524694,0.00021263205,0.0008931353,0.00012115931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006974103,0.000113986694,0.00020063395,0.0003181426,0.000091958966,0.00082548487,0.0004137496,0.00006839603,0.000024293558],"category_scores_gemma":[0.00009583835,0.000088836205,0.0001073725,0.00025308054,0.000014175481,0.0053130016,0.00006495934,0.00020578975,0.00076170533],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000109661116,0.00015144252,0.0023891414,0.00048317257,0.00048135695,0.000033908414,0.041373763,0.07295641,0.0045717647,0.0341476,0.04754043,0.79576135],"study_design_scores_gemma":[0.0008754436,0.00087594235,0.006029048,0.0009784692,0.00002842664,0.0025501172,0.005557073,0.7774924,0.043974902,0.0010963901,0.1598213,0.00072050066],"about_ca_topic_score_codex":0.00017125045,"about_ca_topic_score_gemma":0.0000032665703,"teacher_disagreement_score":0.96939784,"about_ca_system_score_codex":0.00013963034,"about_ca_system_score_gemma":0.00004497979,"threshold_uncertainty_score":0.9790435},"labels":[],"label_agreement":null},{"id":"W2052496634","doi":"10.1007/s10844-006-0006-z","title":"Constraint-based sequential pattern mining: the pattern-growth methods","year":2007,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":233,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of British Columbia","funders":"Simon Fraser University; National Science Foundation","keywords":"Sequential Pattern Mining; Computer science; Constraint (computer-aided design); Data mining; Point (geometry); Artificial intelligence; Mathematics","score_opus":0.04073344562841342,"score_gpt":0.3292330749489349,"score_spread":0.2884996293205215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052496634","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014512908,0.00008646582,0.99511534,0.00066179375,0.0016026977,0.00017344525,0.000013528624,0.00003141509,0.00086400536],"genre_scores_gemma":[0.91499007,0.000015007345,0.08360515,0.0010362469,0.00028658783,0.000010162961,0.000017494325,0.0000075657485,0.000031693387],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776924,0.00012259596,0.0013413974,0.000083860614,0.0004592095,0.00022367398],"domain_scores_gemma":[0.9972278,0.00041775606,0.0012124147,0.00035500102,0.00068114506,0.000105919244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043184906,0.00013161825,0.0001998215,0.00026875926,0.0001439289,0.0005916406,0.0010780619,0.00006285728,0.000012460206],"category_scores_gemma":[0.00012346746,0.000085355416,0.00013003223,0.0003424875,0.000055572404,0.0012484695,0.00007966897,0.00021887553,0.000069718546],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047264193,0.000037892398,0.00037671454,0.000043108037,0.00006198786,0.0000055561018,0.0027920238,0.00068335194,0.00011705641,0.0035876706,0.0039104186,0.9883795],"study_design_scores_gemma":[0.0011069379,0.00043846914,0.0011822326,0.00051557634,0.00006754164,0.0016405502,0.011587834,0.55915153,0.03624678,0.0001237932,0.38733628,0.0006024632],"about_ca_topic_score_codex":0.000052932843,"about_ca_topic_score_gemma":0.0000013490951,"teacher_disagreement_score":0.98777705,"about_ca_system_score_codex":0.00008995743,"about_ca_system_score_gemma":0.00014603799,"threshold_uncertainty_score":0.5705204},"labels":[],"label_agreement":null},{"id":"W2053340216","doi":"10.1007/s10844-011-0166-3","title":"Tableaux-based optimization of schema mappings for data integration","year":2011,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Schema (genetic algorithms); Assertion; Tuple; Conceptual schema; Star schema; Database schema; Data integration; Semi-structured model; Theoretical computer science; Information retrieval; Programming language; Data mining; Database design; Mathematics; Discrete mathematics","score_opus":0.0965137520039541,"score_gpt":0.282461807509628,"score_spread":0.18594805550567392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053340216","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015199393,0.00013940132,0.9977089,0.00004032321,0.0009966111,0.00035384472,0.00005628133,0.000020883457,0.0005317585],"genre_scores_gemma":[0.17553431,0.00005635992,0.823973,0.00008618436,0.000109528315,0.000017381979,0.0001799573,0.000008156334,0.00003511502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792314,0.000040809184,0.0014697023,0.0000871996,0.00035781425,0.00012131525],"domain_scores_gemma":[0.9958345,0.00008028047,0.002088783,0.00054086564,0.0013929136,0.000062635176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012315462,0.00011165382,0.00027256855,0.00034137038,0.000056237488,0.00007227781,0.0006949332,0.00005836132,0.0000066214293],"category_scores_gemma":[0.00030491996,0.00008589317,0.00007012739,0.00027465267,0.000024331812,0.0065953867,0.00008369414,0.000081318714,0.0000075204875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042297036,0.0002453331,0.00026645456,0.001710309,0.00021794165,0.0000030140986,0.011952112,0.31758237,0.0011587087,0.6160092,0.009009123,0.04142251],"study_design_scores_gemma":[0.00038949083,0.00025317437,0.000008646991,0.00052587484,0.000014236403,0.000050244547,0.002103743,0.90101266,0.019457115,0.000055918408,0.07599605,0.00013287255],"about_ca_topic_score_codex":0.000045370067,"about_ca_topic_score_gemma":0.0000013197194,"teacher_disagreement_score":0.61595327,"about_ca_system_score_codex":0.00006542603,"about_ca_system_score_gemma":0.00017820242,"threshold_uncertainty_score":0.4781496},"labels":[],"label_agreement":null},{"id":"W2056806761","doi":"10.1007/s10844-006-9951-9","title":"Mining changing regions from access-constrained snapshots: a cluster-embedded decision tree approach","year":2006,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Data mining; Decision tree; Set (abstract data type); Tree (set theory); Spatial analysis; Simple (philosophy); Cluster (spacecraft); Data set; Artificial intelligence; Remote sensing","score_opus":0.029514702072971844,"score_gpt":0.27797311100323824,"score_spread":0.24845840893026638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056806761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016229575,0.00017204993,0.9777445,0.00016927155,0.0007680521,0.00023306363,0.00002595973,0.000054421536,0.0046030763],"genre_scores_gemma":[0.7208874,0.000040953375,0.2779057,0.00024285163,0.0006313148,0.000036952824,0.00015240902,0.000011952066,0.000090431065],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974163,0.000050396622,0.0015178676,0.00014408855,0.0006123146,0.00025901786],"domain_scores_gemma":[0.99739945,0.00021836117,0.001375314,0.00044934367,0.00044230075,0.00011521989],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009290083,0.00017285046,0.00031054963,0.0007341002,0.00019157442,0.0013421789,0.0013073146,0.00009031247,0.000006138812],"category_scores_gemma":[0.00008977762,0.00014000869,0.00014257354,0.00079576595,0.000030332521,0.0047639017,0.00020781919,0.00017710238,0.000034796285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009405106,0.00046181903,0.0004567591,0.00015089552,0.000273661,0.000019331468,0.025571179,0.09854322,0.00025947444,0.0840896,0.06782195,0.72225803],"study_design_scores_gemma":[0.00065415323,0.00007495996,0.0002805672,0.00042141593,0.000025411415,0.00038740956,0.0051221214,0.9573712,0.0005472272,0.00070452574,0.034137618,0.00027338765],"about_ca_topic_score_codex":0.00013051524,"about_ca_topic_score_gemma":0.0000037033597,"teacher_disagreement_score":0.858828,"about_ca_system_score_codex":0.000116390635,"about_ca_system_score_gemma":0.000110231136,"threshold_uncertainty_score":0.9996945},"labels":[],"label_agreement":null},{"id":"W2067656157","doi":"10.1007/s10844-012-0227-2","title":"Folksonomy link prediction based on a tripartite graph for tag recommendation","year":2012,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Folksonomy; Link (geometry); Graph; Information retrieval; World Wide Web; Data mining; Database; Computer network; Theoretical computer science","score_opus":0.02655069947119669,"score_gpt":0.2834824826696471,"score_spread":0.2569317831984504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067656157","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033981556,0.000029605648,0.9907726,0.00016545583,0.0009380233,0.0004565596,0.000043497286,0.000026698255,0.004169415],"genre_scores_gemma":[0.9966033,0.0000054028806,0.0016097843,0.00008973164,0.0013909477,0.00006804304,0.00018854355,0.000007989756,0.0000362351],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99832654,0.0000675318,0.001152521,0.000045962977,0.00022362378,0.00018381511],"domain_scores_gemma":[0.9978743,0.00014099186,0.0012843275,0.000129534,0.00046614965,0.00010468161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012709271,0.00012432593,0.0002444424,0.00044750416,0.000091864655,0.00011891978,0.0001150613,0.000044730696,0.00011358645],"category_scores_gemma":[0.00001743393,0.00010319486,0.0002803073,0.00022032161,0.000008938285,0.0012892928,0.000009323473,0.00014413,0.000027675092],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00094419677,0.0008608578,0.07290372,0.00029320148,0.0010781575,1.3947641e-7,0.0036814902,0.099003986,0.00013189188,0.05566921,0.15454157,0.6108916],"study_design_scores_gemma":[0.0006947593,0.0003758822,0.0003533004,0.0002015027,0.00011383923,0.0000036344518,0.0011276624,0.1700567,0.002242454,0.00037026824,0.8242848,0.00017523565],"about_ca_topic_score_codex":0.000014630975,"about_ca_topic_score_gemma":1.6932843e-7,"teacher_disagreement_score":0.9932052,"about_ca_system_score_codex":0.00010807566,"about_ca_system_score_gemma":0.000039701812,"threshold_uncertainty_score":0.42081642},"labels":[],"label_agreement":null},{"id":"W2070598375","doi":"10.1007/s10844-006-0368-2","title":"Holes in joins","year":2006,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Joins; Computer science; Join (topology); Sketch; Tuple; Query optimization; Cartesian product; Product (mathematics); Materialized view; Data warehouse; Data mining; Information retrieval; Theoretical computer science; Database; Algorithm; View; Programming language; Database design; Mathematics","score_opus":0.011954212229282675,"score_gpt":0.23464857003499115,"score_spread":0.22269435780570848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070598375","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007611985,0.00043434167,0.9873579,0.00009184516,0.0011210645,0.00011012143,0.000005122583,0.000018640545,0.0032489726],"genre_scores_gemma":[0.98731816,0.000063257496,0.012189282,0.00007433932,0.00021614622,0.0000049937566,0.0000060009675,0.000003565561,0.00012427199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99816066,0.000044331355,0.0012448098,0.000046500194,0.0003675154,0.00013619573],"domain_scores_gemma":[0.99861705,0.000043996875,0.0008096124,0.00018893972,0.00029691655,0.00004347206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006479508,0.00008685383,0.00020682649,0.00040882034,0.000034922206,0.00013564892,0.00027693622,0.000037988855,0.0000023593038],"category_scores_gemma":[0.000040854102,0.000065533495,0.000063920386,0.00029401638,0.000018426168,0.0042820615,0.000045522036,0.00011862202,0.00007069098],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014972788,0.00004951471,0.0018180574,0.000119200355,0.000013093097,0.000023698758,0.0016271948,0.041894104,0.00017597873,0.9405644,0.0050459225,0.008653865],"study_design_scores_gemma":[0.00044732218,0.00012070424,0.0014523625,0.0004701086,0.0000027536082,0.0006722028,0.0019794798,0.01695232,0.002522654,0.0006248201,0.9745385,0.0002167626],"about_ca_topic_score_codex":0.00012190756,"about_ca_topic_score_gemma":0.0000104189985,"teacher_disagreement_score":0.97970617,"about_ca_system_score_codex":0.00011301075,"about_ca_system_score_gemma":0.00006804586,"threshold_uncertainty_score":0.3104391},"labels":[],"label_agreement":null},{"id":"W2080533345","doi":"10.1007/s10844-006-2618-8","title":"An efficient approach to mining indirect associations","year":2006,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Association rule learning; Data mining; struct; Set (abstract data type); Efficient algorithm; Algorithm","score_opus":0.02252393769148645,"score_gpt":0.2616728185588945,"score_spread":0.23914888086740807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080533345","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018272245,0.000037725742,0.97401124,0.00009320778,0.0005085863,0.00017672052,0.000022868302,0.00004477329,0.006832646],"genre_scores_gemma":[0.85864294,0.0000028239085,0.14085278,0.0001243722,0.00024786667,0.000019415864,0.000043688142,0.000004908475,0.00006121481],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982288,0.000049735958,0.000966255,0.00008186974,0.0005129919,0.00016037775],"domain_scores_gemma":[0.99823165,0.000058483056,0.0007770959,0.00028301147,0.00053039956,0.00011937875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011020298,0.000093231065,0.00018465747,0.00039856433,0.00013838978,0.0006735576,0.0007156791,0.000046667337,0.0000010868653],"category_scores_gemma":[0.00005296486,0.00007788761,0.00006367611,0.00059432077,0.000007921882,0.0014352662,0.000047151712,0.000099975594,0.00007118774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060723687,0.0005030095,0.00070037175,0.000037096666,0.000060522845,0.0000014203277,0.011249524,0.80166656,0.00013224172,0.102964185,0.02287667,0.059802357],"study_design_scores_gemma":[0.00017854122,0.00014606895,0.0028716286,0.000062733205,0.000011860018,0.00012808829,0.0022098399,0.9259662,0.00070609065,0.00004288682,0.06746917,0.00020688462],"about_ca_topic_score_codex":0.00005085617,"about_ca_topic_score_gemma":6.185173e-7,"teacher_disagreement_score":0.8403707,"about_ca_system_score_codex":0.0001492942,"about_ca_system_score_gemma":0.000084676474,"threshold_uncertainty_score":0.6495131},"labels":[],"label_agreement":null},{"id":"W2087859840","doi":"10.1007/s10844-009-0096-5","title":"Evaluating information retrieval system performance based on user preference","year":2009,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"Information Retrieval and Search Behavior","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Relevance (law); Information retrieval; Preference; Rank (graph theory); Precision and recall; Measure (data warehouse); Relevance feedback; Document retrieval; Data mining; Artificial intelligence; Image retrieval; Statistics","score_opus":0.07183585331902738,"score_gpt":0.30965548051274866,"score_spread":0.2378196271937213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087859840","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.109251834,0.000029264833,0.87791,0.00029094794,0.0022566486,0.00079003075,0.000010701079,0.00016503331,0.009295506],"genre_scores_gemma":[0.9951518,0.00001758853,0.0040276945,0.00062338304,0.000103947634,0.0000050113326,0.00001647634,0.0000033839071,0.00005070103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99476826,0.0001504261,0.0023837835,0.00008453657,0.0022730224,0.00033998393],"domain_scores_gemma":[0.99457896,0.00012939471,0.0020744347,0.0004470187,0.002557389,0.00021280367],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0033302507,0.00023358242,0.00035077278,0.0010213646,0.00023496864,0.001060002,0.0010257253,0.00014009948,0.000011652474],"category_scores_gemma":[0.000324921,0.0001759787,0.00016395794,0.000845939,0.000020216947,0.013625357,0.00004545123,0.00044222496,0.0005271869],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001431538,0.0002014275,0.00068726146,0.0011729905,0.00006410896,0.000008470997,0.009247165,0.5522454,0.00024408723,0.08408574,0.0031918874,0.34741995],"study_design_scores_gemma":[0.0008642125,0.0022093123,0.002117003,0.00074443384,0.00001372832,0.00016838727,0.00088806154,0.972643,0.0044456823,0.000009154788,0.015634071,0.00026293058],"about_ca_topic_score_codex":0.0000037505042,"about_ca_topic_score_gemma":3.027093e-8,"teacher_disagreement_score":0.88589996,"about_ca_system_score_codex":0.00051647006,"about_ca_system_score_gemma":0.00041124053,"threshold_uncertainty_score":0.999977},"labels":[],"label_agreement":null},{"id":"W2111675636","doi":"10.1007/s10844-009-0087-6","title":"VIREX and VRXQuery: interactive approach for visual querying of relational databases to produce XML","year":2009,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; XML validation; XML Schema Editor; Document Structure Description; XML database; Information retrieval; XML Schema (W3C); Efficient XML Interchange; Streaming XML; Database; XML Encryption; XML; World Wide Web","score_opus":0.034521501535760064,"score_gpt":0.30764220292814476,"score_spread":0.2731207013923847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111675636","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008203205,0.00021164601,0.99009895,0.00012353601,0.00045283104,0.00049726415,0.00004388356,0.000015356609,0.00035329701],"genre_scores_gemma":[0.77565414,0.000032294472,0.22383933,0.00016941123,0.00019765203,0.000016683674,0.000042692292,0.0000047863277,0.000043009244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981056,0.000052984797,0.0011905684,0.0001122662,0.00040048573,0.00013811154],"domain_scores_gemma":[0.9975144,0.00016733196,0.0011657273,0.00019599173,0.0008537085,0.00010279139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096030673,0.00012707054,0.00031424087,0.00037781417,0.00007986491,0.00008170382,0.00019505173,0.00003182898,8.467112e-7],"category_scores_gemma":[0.0003888949,0.00009943156,0.00006943369,0.0002420234,0.000018280638,0.005213401,0.00006538062,0.0001123154,0.000003224835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008206398,0.00034893813,0.0006016152,0.0010638967,0.00024294843,0.0000041394474,0.02583179,0.06005472,0.0048010307,0.7878725,0.005378182,0.11297958],"study_design_scores_gemma":[0.0019804079,0.003596845,0.0018848514,0.0030838547,0.000068285924,0.0017595573,0.022766605,0.41228926,0.046195053,0.00039568785,0.5048573,0.0011222642],"about_ca_topic_score_codex":0.000017621749,"about_ca_topic_score_gemma":4.7020112e-7,"teacher_disagreement_score":0.78747684,"about_ca_system_score_codex":0.000082665065,"about_ca_system_score_gemma":0.00009698228,"threshold_uncertainty_score":0.40547016},"labels":[],"label_agreement":null},{"id":"W2114580886","doi":"10.1007/s10844-010-0130-7","title":"A vector-space dynamic feature for phrase-based statistical machine translation","year":2010,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institute for Infocomm Research; McGill University","keywords":"Computer science; Phrase; Machine translation; Feature vector; Artificial intelligence; Feature (linguistics); Translation (biology); Natural language processing; Context (archaeology); Feature selection; Support vector machine; Function (biology); Decoding methods; Vector space; Vector space model; Feature engineering; Algorithm; Linguistics","score_opus":0.011041794452586082,"score_gpt":0.28511334140405076,"score_spread":0.2740715469514647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114580886","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037396516,0.0007901888,0.9960285,0.0011332879,0.0011486802,0.000333052,0.00003366647,0.00009429682,0.0000644038],"genre_scores_gemma":[0.5743356,0.000005388687,0.42544484,0.00010514561,0.000060156748,0.0000060344046,0.00002155508,0.0000049280757,0.000016363661],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864143,0.000039909686,0.00065043336,0.00007428263,0.00043950052,0.00015444706],"domain_scores_gemma":[0.9981078,0.00020559882,0.00073279446,0.00019836519,0.00065955834,0.00009588469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084968214,0.00012952604,0.00021133194,0.00024955496,0.00007594112,0.00039591445,0.0005260497,0.00012850667,0.000005506831],"category_scores_gemma":[0.00023160515,0.0000958464,0.000097445794,0.00021897495,0.000021473677,0.0016648433,0.000015746311,0.00041394128,0.000008632956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000613142,0.00023314451,0.00014757196,0.001802089,0.00016355437,0.00002580345,0.0071792603,0.004487918,0.02238976,0.28566554,0.013997175,0.66329503],"study_design_scores_gemma":[0.00045904875,0.00025013092,0.00002325604,0.00015813619,0.00001662687,0.00021928982,0.00009262743,0.95330316,0.007993977,0.0012319223,0.03606926,0.00018254279],"about_ca_topic_score_codex":0.000008830014,"about_ca_topic_score_gemma":0.000005882992,"teacher_disagreement_score":0.9488153,"about_ca_system_score_codex":0.000078982855,"about_ca_system_score_gemma":0.0001503066,"threshold_uncertainty_score":0.39085028},"labels":[],"label_agreement":null},{"id":"W2116581216","doi":"10.1007/s10844-008-0075-2","title":"(α, k)-anonymous data publishing","year":2009,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Anonymity; Computer science; k-anonymity; Scalability; Data anonymization; Data publishing; Identification (biology); Information sensitivity; Distortion (music); Data mining; Information privacy; Information retrieval; Theoretical computer science; Publishing; Computer security; Database; Computer network","score_opus":0.0717649415843026,"score_gpt":0.29932170772624495,"score_spread":0.22755676614194234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116581216","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006605523,0.00051717367,0.9755416,0.015838576,0.0020412784,0.00014112104,0.000020282834,0.00019157429,0.0050478424],"genre_scores_gemma":[0.83296657,0.00036683504,0.16490117,0.0012902656,0.0003625479,0.000001792423,0.00006383016,0.0000066008884,0.000040408908],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.997284,0.00006493487,0.0013987423,0.00012512981,0.00088575156,0.00024146706],"domain_scores_gemma":[0.9916018,0.00012780275,0.0014508521,0.0060344716,0.0006814232,0.0001036353],"candidate_categories":["metaresearch","scholarly_communication","open_science"],"consensus_categories":["scholarly_communication","open_science"],"category_scores_codex":[0.0027212135,0.0001303734,0.00025368057,0.0005780567,0.00008160271,0.0028383674,0.0429031,0.00012642432,0.0000056087792],"category_scores_gemma":[0.021035807,0.00010297719,0.000058913847,0.00058747234,0.000020809479,0.034316644,0.015177122,0.0004448366,0.00009735643],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009653817,0.000033231783,0.00006813269,0.000029117822,0.000034831304,0.000013654997,0.0003277172,0.00042229056,0.000035953148,0.013503641,0.7964433,0.18907848],"study_design_scores_gemma":[0.00039037067,0.00031303352,0.0002087068,0.00034593925,0.000013431507,0.0015032915,0.0009790993,0.4253609,0.001452336,0.019166125,0.5499472,0.00031956076],"about_ca_topic_score_codex":0.000014934607,"about_ca_topic_score_gemma":3.884967e-7,"teacher_disagreement_score":0.832306,"about_ca_system_score_codex":0.00015230525,"about_ca_system_score_gemma":0.00014987338,"threshold_uncertainty_score":0.9981968},"labels":[],"label_agreement":null},{"id":"W2127372347","doi":"10.1007/s10844-008-0073-4","title":"A join tree probability propagation architecture for semantic modeling","year":2008,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Bayesian network; Inference; Benchmark (surveying); Conditional probability; Tree (set theory); Architecture; Node (physics); Artificial intelligence; Semantics (computer science); Bayesian inference; Theoretical computer science; Computation; Task (project management); Machine learning; Bayesian probability; Data mining; Algorithm; Programming language","score_opus":0.05922168174488613,"score_gpt":0.2606621188796231,"score_spread":0.20144043713473697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127372347","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023646032,0.000111484114,0.9745515,0.0003639491,0.0005801009,0.00043154918,0.0000020362556,0.00004268598,0.00027064668],"genre_scores_gemma":[0.96565026,0.00002515673,0.034061827,0.00008632299,0.00012113661,0.000019026118,0.000003031379,0.0000041501503,0.000029066065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979861,0.0000648769,0.0012173462,0.000090744965,0.0004629088,0.0001780536],"domain_scores_gemma":[0.9977603,0.00006469478,0.0007079544,0.00022992934,0.0011384543,0.00009866768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010447098,0.0001263471,0.0002501116,0.00026033656,0.00013802675,0.00018726331,0.00046276135,0.00007580382,9.621298e-7],"category_scores_gemma":[0.00018014666,0.00009384862,0.00014627779,0.00021970383,0.000019502451,0.0016965083,0.000034373566,0.00019286123,0.000015811987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006991319,0.00007158001,0.00006964127,0.00037931843,0.000046617246,0.0000027342192,0.008910806,0.9218071,0.00019290912,0.024200723,0.00077036105,0.0434783],"study_design_scores_gemma":[0.00020788886,0.00020579022,0.000009370676,0.00017147067,0.0000066778675,0.0005306229,0.00015917612,0.9932047,0.00075676624,0.0030803618,0.001554227,0.00011290874],"about_ca_topic_score_codex":0.000013152266,"about_ca_topic_score_gemma":0.0000013587157,"teacher_disagreement_score":0.94200426,"about_ca_system_score_codex":0.00010300795,"about_ca_system_score_gemma":0.00023165671,"threshold_uncertainty_score":0.38270354},"labels":[],"label_agreement":null},{"id":"W2139714950","doi":"10.1023/a:1016524013831","title":"Hypothetical Temporal Reasoning in Databases","year":2002,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Predicate (mathematical logic); Data integrity; Relational database; Temporal database; Database schema; Temporal logic; Programming language; Database; Theoretical computer science; State (computer science); Database theory; Database design; Information retrieval","score_opus":0.047617313625412445,"score_gpt":0.2615235239113944,"score_spread":0.21390621028598195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139714950","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017159378,0.0015555094,0.94208467,0.00022095189,0.0021617976,0.0001998132,0.000003043867,0.000050136176,0.03656469],"genre_scores_gemma":[0.9946333,0.00015944001,0.004778855,0.00009806546,0.00015104984,0.000002976572,0.0000017927885,0.00000364816,0.00017086447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980487,0.000094355244,0.0011174523,0.0000737167,0.00045610694,0.0002096661],"domain_scores_gemma":[0.9985502,0.00011743811,0.0006594578,0.00024192137,0.00030630565,0.0001246982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010125338,0.00011721179,0.00025515282,0.00041164964,0.000053072265,0.00028242363,0.0005696918,0.000050276532,0.000039250637],"category_scores_gemma":[0.00033197884,0.00008693379,0.00009403983,0.00036227563,0.00002404902,0.0030181347,0.00008288038,0.00022723133,0.0003484142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007090538,0.000593298,0.031007577,0.00034742276,0.00012211294,0.000185486,0.03338803,0.008036057,0.0000617045,0.749228,0.04711789,0.12984149],"study_design_scores_gemma":[0.0010300787,0.00041168524,0.0011513885,0.00094175735,0.000012790031,0.0025198867,0.002874444,0.5208667,0.001019994,0.00030716232,0.4683966,0.00046749503],"about_ca_topic_score_codex":0.000028666578,"about_ca_topic_score_gemma":0.0000032206074,"teacher_disagreement_score":0.9774739,"about_ca_system_score_codex":0.00012320139,"about_ca_system_score_gemma":0.0000447191,"threshold_uncertainty_score":0.4478276},"labels":[],"label_agreement":null},{"id":"W2144630894","doi":"10.1007/s10844-005-0861-z","title":"Post-Supervised Template Induction for Information Extraction from Lists and Tables in Dynamic Web Sources","year":2005,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"Web Data Mining and Analysis","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Row; Machine learning; Data mining; Artificial intelligence; Dynamic programming; Supervised learning; Exploit; Information extraction; Unsupervised learning; Row and column spaces; Pattern recognition (psychology); Information retrieval; Algorithm; Database; Artificial neural network","score_opus":0.014891960653374848,"score_gpt":0.25725309418324166,"score_spread":0.24236113352986682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144630894","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50635284,0.00027901144,0.4919731,0.00046515415,0.00057524146,0.00017810463,0.00005771096,0.000024526,0.000094332354],"genre_scores_gemma":[0.9912283,0.00021465305,0.008183194,0.00011874933,0.00011725142,0.000008479456,0.00010612524,0.000002997281,0.000020256806],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981535,0.000050437513,0.0012573684,0.00006864487,0.00033260154,0.00013745573],"domain_scores_gemma":[0.99811316,0.00011880125,0.0010385055,0.00015512736,0.00050272985,0.00007169748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094277906,0.00011583386,0.00022812004,0.0008323589,0.00008769397,0.00069857726,0.00027931904,0.00009236149,0.000004923459],"category_scores_gemma":[0.00013923761,0.000097199634,0.00007140775,0.00028366075,0.0000127883195,0.013762246,0.00003690795,0.00015251519,0.00003061921],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023845119,0.00011722277,0.002524606,0.00032527035,0.00023138017,0.0000019338152,0.033506013,0.07869623,0.005068081,0.0020713843,0.0017559611,0.8754635],"study_design_scores_gemma":[0.00065004465,0.00013660261,0.0012063519,0.00024713308,0.00002371323,0.000126083,0.006966658,0.9118142,0.0011287994,0.000044553988,0.077480584,0.00017525541],"about_ca_topic_score_codex":0.000211994,"about_ca_topic_score_gemma":0.000047464433,"teacher_disagreement_score":0.8752882,"about_ca_system_score_codex":0.00014511101,"about_ca_system_score_gemma":0.000085045394,"threshold_uncertainty_score":0.9977296},"labels":[],"label_agreement":null},{"id":"W2145832235","doi":"10.1007/s10844-009-0091-x","title":"Queries with CASE expressions","year":2009,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); York University","funders":"","keywords":"Computer science; Query optimization; Expression (computer science); Information retrieval; Query language; Programming language","score_opus":0.013603735311779582,"score_gpt":0.25054809044073434,"score_spread":0.23694435512895476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145832235","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005118411,0.00028985084,0.99172133,0.00018264866,0.00060110184,0.00013553195,0.000007045,0.000037242717,0.0019068288],"genre_scores_gemma":[0.9561767,0.00006087959,0.043278072,0.00021781815,0.0001453798,0.000004325534,0.0000032036814,0.0000032983378,0.00011031083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99848056,0.000046162397,0.0008784468,0.000056453715,0.00039422192,0.00014414026],"domain_scores_gemma":[0.9980421,0.0000500659,0.00090753334,0.0002907512,0.0005868322,0.00012271717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040282877,0.00011544817,0.00022378986,0.00023280979,0.00012642304,0.00019238945,0.00024472302,0.000036637783,0.0000042359884],"category_scores_gemma":[0.000054240238,0.0000708713,0.00005792884,0.00023997585,0.000020332242,0.0061416365,0.000029999781,0.00013571595,0.000028737397],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014448095,0.00010580695,0.0001347196,0.00016536412,0.00009513829,0.0014964242,0.018881066,0.025161302,0.00040302693,0.87873966,0.008647426,0.0660256],"study_design_scores_gemma":[0.0005089924,0.0010040562,0.000064510255,0.0008351305,0.000012491225,0.064951375,0.0122244395,0.0063680615,0.0041735973,0.00015046404,0.9093759,0.00033098142],"about_ca_topic_score_codex":0.000019278574,"about_ca_topic_score_gemma":0.000001678513,"teacher_disagreement_score":0.9510583,"about_ca_system_score_codex":0.00006119571,"about_ca_system_score_gemma":0.000092271286,"threshold_uncertainty_score":0.44525382},"labels":[],"label_agreement":null},{"id":"W2146327344","doi":"10.1007/s10844-010-0141-4","title":"Probabilistic skylines on uncertain data: model and bounding-pruning-refining methods","year":2010,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Skyline; Computer science; Uncertain data; Pruning; Probabilistic logic; Bounding overwatch; Data mining; Benchmark (surveying); Object (grammar); Reachability; Algorithm; Artificial intelligence","score_opus":0.08668100124270832,"score_gpt":0.3626044773832188,"score_spread":0.2759234761405105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146327344","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039842306,0.00005603836,0.9912395,0.0002728022,0.0022994182,0.0001229588,0.00001096186,0.00003286956,0.0019812095],"genre_scores_gemma":[0.34608674,0.0001548406,0.6517071,0.0005860624,0.00067171466,0.0000124009075,0.000074452284,0.000017218044,0.0006894541],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982906,0.000069010086,0.0009200999,0.000122348,0.0004342899,0.00016363233],"domain_scores_gemma":[0.99799335,0.00018928024,0.0008365972,0.00057714235,0.00029989475,0.00010372453],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.003585891,0.0001316861,0.00022725285,0.00038372434,0.00011971161,0.0011109496,0.0012712956,0.00005350827,0.0000027715998],"category_scores_gemma":[0.0005378506,0.0000964704,0.000036634065,0.00023583519,0.000033566157,0.0055286647,0.00036290195,0.00031018222,0.000020147783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037067584,0.00007939515,0.00014035634,0.00033939804,0.00012424204,0.000008552291,0.0035971734,0.11194417,0.0002753598,0.4305368,0.006126659,0.4467908],"study_design_scores_gemma":[0.00014558819,0.00008248197,0.000018843277,0.0001086914,0.000011270546,0.000079252335,0.00030636418,0.9216349,0.000073240524,0.0006477061,0.07678195,0.00010966838],"about_ca_topic_score_codex":0.000013626114,"about_ca_topic_score_gemma":0.0000022419497,"teacher_disagreement_score":0.8096908,"about_ca_system_score_codex":0.00003337209,"about_ca_system_score_gemma":0.00007629876,"threshold_uncertainty_score":0.999926},"labels":[],"label_agreement":null},{"id":"W2157831974","doi":"10.1023/a:1025876613117","title":"Filtering Multi-Instance Problems to Reduce Dimensionality in Relational Learning","year":2003,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"Image Retrieval and Classification Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Instituto de Ciencias del Mar y Limnología, Universidad Nacional Autónoma de México; Natural Sciences and Engineering Research Council of Canada","keywords":"Inductive logic programming; Datalog; Computer science; Curse of dimensionality; Statistical relational learning; Artificial intelligence; Expressive power; Task (project management); Representation (politics); Set (abstract data type); Logic programming; Relational database; Selection (genetic algorithm); Theoretical computer science; Value (mathematics); Programming language; Machine learning; Data mining","score_opus":0.05261365240362178,"score_gpt":0.2875201723504531,"score_spread":0.2349065199468313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157831974","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041219112,0.00016933818,0.99371,0.00016195295,0.00044217677,0.00021667998,7.183468e-7,0.000036280046,0.0011409692],"genre_scores_gemma":[0.9581792,0.00004627442,0.041431535,0.000094512165,0.000018778173,0.000011351598,0.0000014853243,0.0000034771747,0.00021342614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99799895,0.00014181153,0.0011466444,0.000081751285,0.00048716844,0.00014369302],"domain_scores_gemma":[0.99835473,0.00007772365,0.00069754984,0.00014833246,0.00063149614,0.00009014262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001761241,0.00009536749,0.00017419284,0.00036312567,0.00006862795,0.00015325089,0.0002900457,0.00005417203,0.0000068335703],"category_scores_gemma":[0.00036480787,0.000080492486,0.000060326758,0.0005346544,0.000014071082,0.0021050468,0.000036208094,0.00024981596,0.00006097014],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008571202,0.0003045798,0.004061275,0.00038560908,0.000068612695,0.000015123657,0.016136406,0.2714107,0.0138368895,0.62125325,0.0010981852,0.071343675],"study_design_scores_gemma":[0.0010793078,0.00044224475,0.0049590436,0.001698681,0.0000073736223,0.0007099504,0.0029100333,0.21123633,0.12841846,0.00082587596,0.6470393,0.0006733825],"about_ca_topic_score_codex":0.000008376294,"about_ca_topic_score_gemma":5.688376e-7,"teacher_disagreement_score":0.9540573,"about_ca_system_score_codex":0.00025206362,"about_ca_system_score_gemma":0.00011722272,"threshold_uncertainty_score":0.32823884},"labels":[],"label_agreement":null},{"id":"W2513699951","doi":"10.1023/a:1012857830230","title":"Tracing Lineage of Array Data","year":2001,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Computer science; Lineage (genetic); Data structure; TRACE (psycholinguistics); Computation; Theoretical computer science; Algorithm; Programming language","score_opus":0.057932765758531964,"score_gpt":0.29900964598331875,"score_spread":0.2410768802247868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2513699951","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033863536,0.00043509275,0.9939422,0.00010662604,0.0008726936,0.00010080394,0.000015888834,0.000055918335,0.0010844221],"genre_scores_gemma":[0.9386359,0.0003652372,0.060801502,0.000052114105,0.00009395131,0.0000012294377,0.000014305916,0.0000038019743,0.00003196112],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979606,0.000030023064,0.0013315275,0.0000710725,0.0004755132,0.00013124965],"domain_scores_gemma":[0.9968576,0.000102266094,0.0016338269,0.00089461356,0.00046314203,0.00004854812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010161815,0.00009341735,0.00025016634,0.00040299766,0.0000370717,0.00013062303,0.002215764,0.0000604132,0.0000040805994],"category_scores_gemma":[0.00041093034,0.00007196771,0.00004921696,0.00042596395,0.000031433785,0.00783077,0.00023886604,0.00018999106,0.00003882395],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016911763,0.00031250485,0.0016397847,0.00084047945,0.00039598843,0.000119476994,0.012317128,0.110032074,0.0052888882,0.093200065,0.021911746,0.75377274],"study_design_scores_gemma":[0.00078315084,0.0006048878,0.00013543932,0.0010901791,0.00003240917,0.0036048968,0.010303015,0.17162271,0.10801857,0.0006915548,0.7025954,0.0005178058],"about_ca_topic_score_codex":0.000008952787,"about_ca_topic_score_gemma":6.266754e-7,"teacher_disagreement_score":0.93524957,"about_ca_system_score_codex":0.000064771055,"about_ca_system_score_gemma":0.000064993495,"threshold_uncertainty_score":0.56771195},"labels":[],"label_agreement":null},{"id":"W2606013202","doi":"10.1007/s10844-017-0460-9","title":"Dynamic adaptation of online ensembles for drifting data streams","year":2017,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"Data Stream Mining Techniques","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada; University of Ottawa","funders":"","keywords":"Computer science; Data stream mining; Data mining; Concept drift; Construct (python library); Scalability; Resource (disambiguation); Data stream; Predictive analytics; Adaptation (eye); Return on investment; Analytics; Machine learning; Database","score_opus":0.08983309585543633,"score_gpt":0.35008550875397865,"score_spread":0.2602524128985423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2606013202","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014297608,0.00009716115,0.9840702,0.00015074915,0.00072943803,0.00022559571,0.00022086398,0.000030327046,0.00017809539],"genre_scores_gemma":[0.8095355,0.00009340465,0.19012265,0.000016091204,0.000056997033,0.0000030305669,0.00014940168,0.0000046917407,0.000018212771],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809307,0.000030697105,0.0012757437,0.00008391426,0.00039515572,0.000121424164],"domain_scores_gemma":[0.9941353,0.00015018678,0.0036557121,0.0011601115,0.0008465763,0.000052067964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013742747,0.00010069937,0.00025561723,0.0002580026,0.00013253429,0.0004864972,0.0027937081,0.000057537203,7.685943e-7],"category_scores_gemma":[0.00083230383,0.00008258912,0.00006464211,0.000065392516,0.000028654693,0.006390015,0.0003510483,0.00009672737,0.0000035075138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004873617,0.00009736969,0.00050538866,0.0003687529,0.000118689146,0.0000023549221,0.0032929222,0.0040397057,0.00025528113,0.011572521,0.0036564118,0.97604185],"study_design_scores_gemma":[0.00024323084,0.00025883457,0.00025387466,0.0006057685,0.000017601473,0.00008728203,0.0018926326,0.97381604,0.0017464123,0.00020712172,0.020763094,0.00010809065],"about_ca_topic_score_codex":0.00011292275,"about_ca_topic_score_gemma":0.00001950833,"teacher_disagreement_score":0.9759338,"about_ca_system_score_codex":0.000058480415,"about_ca_system_score_gemma":0.00014432271,"threshold_uncertainty_score":0.51914513},"labels":[],"label_agreement":null},{"id":"W2616566908","doi":"10.1007/s10844-017-0466-3","title":"Query expansion using pseudo relevance feedback on wikipedia","year":2017,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"Information Retrieval and Search Behavior","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Query expansion; Relevance feedback; Information retrieval; Web search query; Web query classification; Robustness (evolution); Query optimization; Relevance (law); Vocabulary; Data mining; Artificial intelligence; Search engine","score_opus":0.05628626845690768,"score_gpt":0.31318270040641516,"score_spread":0.2568964319495075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2616566908","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27197,0.000074256364,0.7167859,0.0003598856,0.005468413,0.00034152198,0.000006553599,0.000043842872,0.0049496074],"genre_scores_gemma":[0.9955311,0.00015815053,0.0035977608,0.00024121028,0.0002696536,0.0000025354552,0.0000020196237,0.0000053739063,0.00019224102],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972742,0.000057632365,0.0013031864,0.00007219886,0.0010606212,0.00023211453],"domain_scores_gemma":[0.99575025,0.00008599985,0.0022517233,0.000601801,0.0011423075,0.00016791586],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012617424,0.00014899093,0.00026192056,0.00038674698,0.00043989808,0.0014280532,0.0012184109,0.0000954218,0.000009561459],"category_scores_gemma":[0.00039105603,0.00011116794,0.00014558683,0.00013717523,0.000042564432,0.009327324,0.00013093647,0.00030788282,0.00033855843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000985678,0.0004893046,0.004570095,0.0011034224,0.00026248713,0.00014589897,0.034295477,0.10755606,0.00375737,0.1986503,0.023709603,0.6244743],"study_design_scores_gemma":[0.002338334,0.0015676905,0.006584901,0.0026231974,0.000043515203,0.001848771,0.0043633063,0.7322087,0.031201968,0.00042662266,0.215704,0.001088987],"about_ca_topic_score_codex":0.00003024156,"about_ca_topic_score_gemma":3.5254152e-7,"teacher_disagreement_score":0.72356105,"about_ca_system_score_codex":0.00020965365,"about_ca_system_score_gemma":0.00020306866,"threshold_uncertainty_score":0.9996086},"labels":[],"label_agreement":null},{"id":"W2799430123","doi":"10.1007/s10844-018-0505-8","title":"Granular methods in automatic music genre classification: a case study","year":2018,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"Music and Audio Processing","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Scalability; Rough set; Artificial intelligence; Machine learning; Focus (optics); Set (abstract data type); Statistical classification; Granular computing; Algorithm; Fuzzy set; Fuzzy logic; Data mining; Database","score_opus":0.08951643055732517,"score_gpt":0.37178482577136157,"score_spread":0.2822683952140364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799430123","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14904849,0.00014000105,0.84816575,0.00009756292,0.0013059853,0.0002769602,2.8709294e-7,0.000029599752,0.0009353494],"genre_scores_gemma":[0.96159095,0.000005175479,0.03793037,0.00023952035,0.00019635617,0.00000999215,3.4611503e-7,0.0000039635493,0.000023319017],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973372,0.00029538907,0.0016516666,0.000091422204,0.00045699964,0.00016732291],"domain_scores_gemma":[0.99744177,0.00010661384,0.0012911818,0.00031770737,0.00074887875,0.000093828254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033042624,0.00012502667,0.0002897593,0.0006005117,0.00012962012,0.00049713807,0.0005387859,0.000056944114,0.00001872899],"category_scores_gemma":[0.00013621367,0.00009535265,0.00007203393,0.000765466,0.00003139867,0.0028460908,0.00007041493,0.00019016275,0.00007145717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017752407,0.0003418935,0.0030194342,0.00035628612,0.00007585351,0.000576689,0.1586033,0.0009871082,0.00020279738,0.0038630923,0.002629032,0.82932675],"study_design_scores_gemma":[0.0009756452,0.00079094747,0.00168691,0.0005451705,0.000033820645,0.019132458,0.08866599,0.86589783,0.0009691357,0.00022658161,0.02071465,0.00036083002],"about_ca_topic_score_codex":0.000048820806,"about_ca_topic_score_gemma":0.000006714929,"teacher_disagreement_score":0.8649107,"about_ca_system_score_codex":0.00014051814,"about_ca_system_score_gemma":0.00016045362,"threshold_uncertainty_score":0.4793914},"labels":[],"label_agreement":null},{"id":"W2885581957","doi":"10.1007/s10844-018-0519-2","title":"Predicting future personal life events on twitter via recurrent neural networks","year":2018,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"Mental Health via Writing","field":"Psychology","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Event (particle physics); Identification (biology); Phone; Variety (cybernetics); Social media; Task (project management); Personal life; Data science; Baseline (sea); World Wide Web; Personally identifiable information; Mobile phone; Internet privacy; Human–computer interaction; Artificial intelligence; Computer security; Telecommunications","score_opus":0.046651832385537155,"score_gpt":0.3480449519037792,"score_spread":0.30139311951824205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885581957","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9116692,0.0007888859,0.035030678,0.00073374156,0.04289929,0.00074547384,0.000012970014,0.00005302548,0.008066745],"genre_scores_gemma":[0.9898676,0.000021516427,0.000042706728,0.0018050947,0.008114802,0.000013081642,0.00001264603,0.000014775125,0.00010773484],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966969,0.00024448716,0.0018883168,0.000101927624,0.000686336,0.00038206705],"domain_scores_gemma":[0.99703044,0.00011368197,0.0018487695,0.00016265822,0.0005400608,0.00030438355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014018518,0.00019286312,0.00030833864,0.00031452798,0.00019031327,0.00008079082,0.00024571296,0.0001690913,0.00040695578],"category_scores_gemma":[0.000064914486,0.00015305169,0.00014888207,0.00020123867,0.000030085976,0.00065146846,0.000032495827,0.0006306247,0.00058102404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006160814,0.00093759206,0.18738995,0.0013935291,0.0011900399,0.00006035537,0.16673951,0.007294888,0.000026275942,0.0027648965,0.18756118,0.43848097],"study_design_scores_gemma":[0.0044194716,0.009062635,0.035463903,0.0038713655,0.00014164441,0.0044772853,0.13914804,0.58281845,0.00013722538,0.00002952613,0.21932031,0.001110174],"about_ca_topic_score_codex":0.000026388985,"about_ca_topic_score_gemma":0.0000012195572,"teacher_disagreement_score":0.57552356,"about_ca_system_score_codex":0.0002646193,"about_ca_system_score_gemma":0.00004420603,"threshold_uncertainty_score":0.74680823},"labels":[],"label_agreement":null},{"id":"W2886779119","doi":"10.1007/s10844-018-0521-8","title":"Topic and sentiment aware microblog summarization for twitter","year":2018,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"Topic Modeling","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Automatic summarization; Computer science; Microblogging; Social media; Information retrieval; Categorization; Context (archaeology); Multi-document summarization; Sentiment analysis; Process (computing); Task (project management); Representation (politics); World Wide Web; Data science; Natural language processing; Artificial intelligence","score_opus":0.028440984691201352,"score_gpt":0.2675110641839439,"score_spread":0.23907007949274253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886779119","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014292441,0.00007265793,0.9833067,0.0003300506,0.0015107448,0.00019557653,0.0000012491643,0.00001249121,0.00027805875],"genre_scores_gemma":[0.9837898,0.000028069035,0.015138329,0.0004213054,0.00040317187,0.0000053929125,0.0000034411569,0.000003109747,0.00020736056],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989684,0.000021615906,0.0006650049,0.000052875184,0.00019194688,0.00010013169],"domain_scores_gemma":[0.9986901,0.000034627563,0.0004736175,0.00013259526,0.0006183973,0.000050615505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000475787,0.0000658558,0.00012126028,0.00017041144,0.00006562954,0.0002664362,0.00021717399,0.0000421528,0.0000030083208],"category_scores_gemma":[0.000028692431,0.000052002277,0.000043097305,0.00007876176,0.00001300564,0.0012291557,0.000048327056,0.000050573184,0.000016674512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024245602,0.00023843753,0.01380521,0.0023276855,0.0007084517,0.000009566479,0.1012745,0.021710416,0.005708787,0.26193386,0.05781004,0.5342306],"study_design_scores_gemma":[0.00072981947,0.000445635,0.0002452401,0.00029352773,0.000020302068,0.00031492097,0.0014337248,0.70174533,0.014789637,0.00073279743,0.27901724,0.000231814],"about_ca_topic_score_codex":0.0000061942337,"about_ca_topic_score_gemma":3.5518497e-7,"teacher_disagreement_score":0.9694974,"about_ca_system_score_codex":0.000057022055,"about_ca_system_score_gemma":0.0000386766,"threshold_uncertainty_score":0.25692505},"labels":[],"label_agreement":null},{"id":"W2887728628","doi":"10.1007/s10844-018-0524-5","title":"REMI: A framework of reusable elements for mining heterogeneous data with missing information","year":2018,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Horizon 2020 Framework Programme; European Commission","keywords":"Computer science; Data mining; Information retrieval; Missing data; Data science; Machine learning","score_opus":0.0448779938772994,"score_gpt":0.29895527494351004,"score_spread":0.25407728106621064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2887728628","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020890317,0.00005198567,0.99552816,0.00009880382,0.0009717043,0.0003107062,0.00003605639,0.000018536473,0.0008950051],"genre_scores_gemma":[0.26680896,0.000044541794,0.7322688,0.00029993796,0.00037619646,0.000008279561,0.00014434053,0.000008182194,0.000040773866],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975473,0.000028323431,0.001568901,0.00007634434,0.0005931205,0.00018595344],"domain_scores_gemma":[0.9959806,0.00009238512,0.0022171978,0.0006522362,0.0009851849,0.00007235099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016492181,0.00011699527,0.00023522356,0.00036989446,0.000119095814,0.00061499566,0.0014560197,0.00005138457,0.000005771033],"category_scores_gemma":[0.00024552224,0.000087679335,0.000045547124,0.00033598064,0.000028838189,0.011575737,0.00026054136,0.00008239771,0.000023093342],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051222055,0.00014550761,0.0007952132,0.0016801235,0.0008011121,0.000004651786,0.022785634,0.0056482307,0.00009534842,0.023819692,0.033542152,0.91017014],"study_design_scores_gemma":[0.0005916944,0.0008597719,0.00001982602,0.0012229206,0.000041033876,0.0001296426,0.0026450201,0.6303788,0.002836729,0.00023298517,0.36082637,0.0002152412],"about_ca_topic_score_codex":0.0000059139784,"about_ca_topic_score_gemma":6.953891e-7,"teacher_disagreement_score":0.90995485,"about_ca_system_score_codex":0.000058111716,"about_ca_system_score_gemma":0.00009973767,"threshold_uncertainty_score":0.83921295},"labels":[],"label_agreement":null},{"id":"W3188021992","doi":"10.1007/s10844-021-00653-w","title":"Depression detection from sMRI and rs-fMRI images using machine learning","year":2021,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"Functional Brain Connectivity Studies","field":"Neuroscience","cited_by":47,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Artificial intelligence; Computer science; Receiver operating characteristic; Discriminative model; Resting state fMRI; Pattern recognition (psychology); Major depressive disorder; Machine learning; Naive Bayes classifier; Connectome; Support vector machine; Functional connectivity; Psychology; Amygdala; Neuroscience","score_opus":0.039983976128418204,"score_gpt":0.26868733346508306,"score_spread":0.22870335733666486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3188021992","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61860657,0.0017434979,0.37656486,0.00023367093,0.002057823,0.00012535286,0.000017365497,0.000033573273,0.0006173012],"genre_scores_gemma":[0.99886495,0.00037203866,0.00030327952,0.00023400702,0.00016734768,0.0000017958083,0.0000023333735,0.000006825413,0.000047451522],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984284,0.00022218312,0.0006614607,0.00010617903,0.00046627258,0.00011549599],"domain_scores_gemma":[0.9974125,0.0012951097,0.0007393516,0.000091846654,0.0003968734,0.00006429995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045681198,0.00011445351,0.00021903636,0.00020177095,0.00026060507,0.00022211467,0.00007577484,0.000056435496,0.000019549783],"category_scores_gemma":[0.0040500695,0.0000947003,0.000072662464,0.00020664468,0.000038118247,0.0015923914,0.000079150435,0.00029948083,0.000021050779],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003928854,0.00009001304,0.013075958,0.00025333927,0.0001473237,0.00006988766,0.004650292,0.11384689,0.780328,0.00022275907,0.00055090553,0.086371765],"study_design_scores_gemma":[0.00038661913,0.00010019385,0.00085199845,0.0002641855,0.000030198009,0.0012384955,0.003532872,0.09242884,0.87228656,0.0000826416,0.028642295,0.00015508628],"about_ca_topic_score_codex":0.00011899922,"about_ca_topic_score_gemma":0.000007159126,"teacher_disagreement_score":0.38025835,"about_ca_system_score_codex":0.00013350455,"about_ca_system_score_gemma":0.000046774352,"threshold_uncertainty_score":0.4848604},"labels":[],"label_agreement":null},{"id":"W4280502440","doi":"10.1007/s10844-022-00713-9","title":"A case study comparing machine learning with statistical methods for time series forecasting: size matters","year":2022,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"Forecasting Techniques and Applications","field":"Decision Sciences","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Canada Research Chairs","keywords":"Computer science; Machine learning; Series (stratigraphy); Artificial intelligence; Statistical learning; Time series; Sample size determination; Sample (material); Simple (philosophy); Code (set theory); Work (physics); Statistics; Mathematics","score_opus":0.1641113147290004,"score_gpt":0.4184983651093765,"score_spread":0.2543870503803761,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280502440","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055366203,0.000026536432,0.94291615,0.00020909212,0.00022362825,0.0008717551,0.00003971206,0.00004076057,0.00030614462],"genre_scores_gemma":[0.87997264,8.8074523e-7,0.11940973,0.00007958579,0.00004641697,0.00013196206,0.000008774404,0.000012118099,0.0003378798],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996366,0.00048969797,0.0019129119,0.00012078398,0.000924499,0.00018607306],"domain_scores_gemma":[0.99389535,0.0028867715,0.0019917565,0.0002168679,0.00089920394,0.000110052824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0093426835,0.00014245948,0.00045143423,0.0003726254,0.00062464166,0.00050694525,0.00045171694,0.000023298744,0.00014438407],"category_scores_gemma":[0.0016197023,0.00009717495,0.00009840468,0.00053129473,0.000040214785,0.0008099007,0.00015363061,0.00035030965,0.000013847373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030007064,0.0009441781,0.019949045,0.0002614314,0.00067449076,0.0006617914,0.057689745,0.6679376,0.00016543959,0.009324585,0.041772973,0.19761804],"study_design_scores_gemma":[0.00066457095,0.0030968871,0.00003135445,0.00004335232,0.00006587442,0.034717157,0.07160314,0.70990145,0.00009620408,0.00056121405,0.17898855,0.0002302339],"about_ca_topic_score_codex":0.00009056901,"about_ca_topic_score_gemma":0.00000385939,"teacher_disagreement_score":0.8246065,"about_ca_system_score_codex":0.00014564522,"about_ca_system_score_gemma":0.00008089701,"threshold_uncertainty_score":0.48884845},"labels":[],"label_agreement":null},{"id":"W4392345811","doi":"10.1007/s10844-024-00851-2","title":"Ensemble of temporal Transformers for financial time series","year":2024,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"Stock Market Forecasting Methods","field":"Decision Sciences","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Time series; Heteroscedasticity; Estimator; Transformer; Artificial intelligence; Machine learning; Autoregressive integrated moving average; Embedding; Ensemble learning; Deep learning; Autoregressive conditional heteroskedasticity; Data mining; Econometrics; Finance; Volatility (finance); Statistics","score_opus":0.07442814628610717,"score_gpt":0.3738199868221773,"score_spread":0.29939184053607015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392345811","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020582194,0.00048065823,0.96624404,0.00023046033,0.0045031835,0.00046660175,0.000060358594,0.000022011342,0.0074104914],"genre_scores_gemma":[0.9829816,0.000039821258,0.013610038,0.000053087824,0.0004642159,0.00001752653,0.000007505924,0.000015028067,0.0028111744],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9953547,0.00016501774,0.0029125933,0.00008725793,0.0013015101,0.00017893515],"domain_scores_gemma":[0.9951977,0.0017557846,0.0012042444,0.0001322052,0.0016111945,0.00009885409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011128235,0.00013560652,0.0004945914,0.0009491611,0.000066237764,0.00037598668,0.0003836997,0.00010810119,0.000091650494],"category_scores_gemma":[0.0048419624,0.000089997964,0.0004079917,0.00070559385,0.000054084205,0.0025423153,0.000020153764,0.00016187702,0.000116304946],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012946046,0.000044970388,0.00042321475,0.0008347835,0.00017570407,0.0000072230205,0.010203489,0.004825316,0.0012003571,0.009620919,0.11049277,0.8608766],"study_design_scores_gemma":[0.00033760467,0.0009900822,0.00012371696,0.00068174675,0.00004778414,0.00056986674,0.0042695943,0.03352348,0.012358248,0.004438931,0.94245476,0.00020421747],"about_ca_topic_score_codex":0.000008117383,"about_ca_topic_score_gemma":0.0000011176311,"teacher_disagreement_score":0.9623994,"about_ca_system_score_codex":0.000091265676,"about_ca_system_score_gemma":0.0004113229,"threshold_uncertainty_score":0.5796631},"labels":[],"label_agreement":null},{"id":"W4403236745","doi":"10.1007/s10844-024-00896-3","title":"Persuasive explanations for path reasoning recommendations","year":2024,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Path (computing); Artificial intelligence; Data science; Information retrieval; Programming language","score_opus":0.04292240770245533,"score_gpt":0.3238636200771864,"score_spread":0.2809412123747311,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403236745","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034566433,0.0007472105,0.9896106,0.0018069324,0.0053854445,0.0003016239,0.00002017187,0.00008289527,0.001699445],"genre_scores_gemma":[0.92216116,0.0005914854,0.075403646,0.00035905853,0.00081411237,0.00009241214,0.000033281234,0.00001829183,0.0005265446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980748,0.00005313488,0.0012225533,0.00009045214,0.00038136862,0.00017767023],"domain_scores_gemma":[0.99762803,0.00048470436,0.00053227873,0.00019501081,0.0010626221,0.00009735717],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011760985,0.00011665361,0.00018456293,0.0005975093,0.00015192111,0.0010685286,0.0005642868,0.00006408118,0.000019179748],"category_scores_gemma":[0.00043871655,0.00009554195,0.00018241399,0.0004391504,0.000020177595,0.004568626,0.000045572437,0.00018142155,0.00017832416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000132583,0.000029562809,0.000024308518,0.00015014109,0.00012757954,0.000006234225,0.021301214,0.009954578,0.00004736047,0.73976594,0.056445755,0.17213406],"study_design_scores_gemma":[0.000047407473,0.00016208689,0.000003806192,0.0005479094,0.000016009339,0.00027401894,0.009317123,0.33065113,0.0014013378,0.001312652,0.65613246,0.00013406728],"about_ca_topic_score_codex":0.000012810275,"about_ca_topic_score_gemma":0.0000012132309,"teacher_disagreement_score":0.9218155,"about_ca_system_score_codex":0.00021996806,"about_ca_system_score_gemma":0.00022923674,"threshold_uncertainty_score":0.99996847},"labels":[],"label_agreement":null},{"id":"W4412468738","doi":"10.1007/s10844-025-00964-2","title":"Leveraging large language models, graph neural networks, and explainable AI for revolutionizing the next-generation network intrusion detection systems","year":2025,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Intrusion detection system; Graph; Artificial intelligence; Artificial neural network; Theoretical computer science","score_opus":0.030682575559079373,"score_gpt":0.24564611305298056,"score_spread":0.21496353749390118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412468738","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011087749,0.00798126,0.9730623,0.0003169743,0.0067401878,0.0006516521,0.0000014092304,0.000055705535,0.00010279892],"genre_scores_gemma":[0.9972518,0.00072347716,0.00045487995,0.00047876345,0.0009823681,0.00004544931,0.000008182206,0.0000064029828,0.0000486842],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977448,0.00024273043,0.0011983641,0.00013864541,0.0003545336,0.00032092605],"domain_scores_gemma":[0.9978665,0.00017129842,0.0008951029,0.00026348923,0.00073268096,0.000070894224],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0026335036,0.0001744646,0.00027599398,0.0003781846,0.00092384353,0.0013405568,0.00037905658,0.00013775613,9.112852e-7],"category_scores_gemma":[0.00007128295,0.00012953517,0.00012633488,0.0007544488,0.000021672795,0.0047425567,0.00012375983,0.00036625066,0.000001428627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046642148,0.000011770656,0.000016057591,0.000109062086,0.000042506057,6.8083114e-7,0.0015891771,0.9391801,0.00007101266,0.03176634,0.003643444,0.023523254],"study_design_scores_gemma":[0.00030907817,0.00011056109,0.0000111595955,0.00026443542,0.000023162182,0.00013483274,0.0028634293,0.9760066,0.00017651982,0.00049239775,0.019487856,0.000119949225],"about_ca_topic_score_codex":0.000096874566,"about_ca_topic_score_gemma":0.000016440443,"teacher_disagreement_score":0.98616403,"about_ca_system_score_codex":0.00020173487,"about_ca_system_score_gemma":0.000054515996,"threshold_uncertainty_score":0.99969614},"labels":[],"label_agreement":null},{"id":"W752888290","doi":"10.1007/s10844-015-0368-1","title":"Types of minority class examples and their influence on learning classifiers from imbalanced data","year":2015,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"Imbalanced Data Classification Techniques","field":"Computer Science","cited_by":287,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Ottawa","keywords":"Computer science; Outlier; Machine learning; Artificial intelligence; Identification (biology); Class (philosophy); Classifier (UML); Neighbourhood (mathematics); Data mining; Data type; Mathematics","score_opus":0.07618345526224594,"score_gpt":0.28703524101380407,"score_spread":0.2108517857515581,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W752888290","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075072646,0.00047702444,0.9212421,0.00019605475,0.0006396295,0.00022089787,0.00009033801,0.000077052966,0.0019842219],"genre_scores_gemma":[0.99316084,0.00021629753,0.0064015286,0.00008771746,0.00006216612,0.00000274592,0.000048325262,0.0000030457,0.000017327937],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981136,0.00014251644,0.0010353698,0.00012352245,0.00046043476,0.00012458283],"domain_scores_gemma":[0.99660516,0.00026047855,0.00156875,0.00065647607,0.00078640966,0.00012271364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013512333,0.00012914359,0.00029956654,0.0002598105,0.000044878325,0.00023011555,0.001255998,0.00008366749,0.0000013021241],"category_scores_gemma":[0.0006941609,0.00009461749,0.000032156186,0.00022783638,0.00005922015,0.0035888553,0.00023395971,0.0002581027,0.00001696548],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00094842055,0.00050764775,0.0608161,0.000979377,0.0009387216,0.000015538813,0.056305666,0.05740239,0.01703307,0.2590288,0.062352434,0.48367184],"study_design_scores_gemma":[0.0012725258,0.001233669,0.010919538,0.0012742904,0.000034534976,0.00016927939,0.013198844,0.417071,0.04823048,0.001887337,0.5040334,0.0006750891],"about_ca_topic_score_codex":0.00009760422,"about_ca_topic_score_gemma":0.0000017168096,"teacher_disagreement_score":0.9180882,"about_ca_system_score_codex":0.00009659,"about_ca_system_score_gemma":0.00015474291,"threshold_uncertainty_score":0.38583893},"labels":[],"label_agreement":null},{"id":"W883825559","doi":"10.1007/s10844-015-0364-5","title":"Towards context-aware media recommendation based on social tagging","year":2015,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Social media; Context (archaeology); World Wide Web; Data science; Information retrieval; Recommender system","score_opus":0.0908986974637839,"score_gpt":0.3053854391696131,"score_spread":0.21448674170582918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W883825559","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026092518,0.000035233683,0.98580194,0.0026393952,0.003482562,0.00020470082,0.0000061245396,0.00009045846,0.007478642],"genre_scores_gemma":[0.9963977,0.000011096404,0.002134292,0.0010548776,0.0003584311,0.00001080749,0.000013777466,0.0000062704175,0.000012758831],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975096,0.00022765686,0.0013078112,0.0000792467,0.0007028801,0.00017279526],"domain_scores_gemma":[0.99707323,0.000121567726,0.0014128211,0.00017718536,0.0010544772,0.00016071765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029578402,0.00015026008,0.00031656635,0.0005321455,0.00009261984,0.0004993194,0.0005561106,0.00010473366,0.000009567961],"category_scores_gemma":[0.00017305039,0.00011655459,0.00013505448,0.00027649757,0.000012842968,0.002472874,0.000051024224,0.00022916411,0.00006285553],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088020606,0.000108630134,0.00019273817,0.0001305957,0.00007309242,0.00000818647,0.014724013,0.0019139749,0.000006647929,0.044077944,0.1897615,0.74891466],"study_design_scores_gemma":[0.00084358355,0.00040126377,0.000086759785,0.00036970168,0.000009819014,0.00015923743,0.006669326,0.24257162,0.0019527152,0.0003185884,0.746324,0.00029337243],"about_ca_topic_score_codex":0.00005604155,"about_ca_topic_score_gemma":0.0000016115484,"teacher_disagreement_score":0.9961368,"about_ca_system_score_codex":0.0003707626,"about_ca_system_score_gemma":0.0002471795,"threshold_uncertainty_score":0.48149484},"labels":[],"label_agreement":null}]}