{"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043509666,0.0009619627,0.94683355,0.00091367314,0.00017369019,0.000110940164,0.0019839695,0.0025844087,0.0029282577],"genre_scores_gemma":[0.75488776,0.0013374885,0.23687775,0.00022642621,0.0001346074,0.00037763212,0.0020352432,0.0002628645,0.00386021],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991819,0.00018630625,0.00007948065,0.00013701119,0.00030620742,0.00010901463],"domain_scores_gemma":[0.9970112,0.0015412259,0.00018054605,0.00046665838,0.0006949278,0.00010546122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015100087,0.0007640546,0.0016198355,0.0011612201,0.0006313307,0.002198876,0.0025426901,0.0010485647,0.0027139399],"category_scores_gemma":[0.0058151223,0.00063438964,0.0009748028,0.0028238199,0.00060878455,0.00301708,0.00087060966,0.0014094944,0.0006427838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002214285,0.000113507274,0.0014541169,0.000063327534,0.00005890516,0.00006822908,0.00006735808,0.92389876,0.00079277385,0.03109945,0.0036340638,0.03852817],"study_design_scores_gemma":[0.0000028956822,0.0000044424833,0.00002769531,0.0000015772691,0.000004976546,0.000004509934,0.0000027769852,0.9949308,0.00010991085,0.004767601,0.00014034103,0.0000024938713],"about_ca_topic_score_codex":0.030387824,"about_ca_topic_score_gemma":0.023459539,"teacher_disagreement_score":0.030387824,"about_ca_system_score_codex":0.001751772,"about_ca_system_score_gemma":0.002209832,"threshold_uncertainty_score":0.060421884},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17373826,0.0007835721,0.8190946,0.00016562422,0.000103393446,0.00009592728,0.00037876747,0.0022932212,0.0033466928],"genre_scores_gemma":[0.6167891,0.00048078175,0.37762466,0.00008182262,0.000060330716,0.00016155842,0.0009329877,0.00020873455,0.003659929],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99981076,0.00005501442,0.0000142311055,0.00006883206,0.000029945784,0.000021294787],"domain_scores_gemma":[0.9995546,0.00025222334,0.000027615577,0.00004859032,0.00009118613,0.000025743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047915353,0.0005170045,0.0004451274,0.0004829282,0.0002355177,0.00039507487,0.0004744842,0.00048219107,0.0030751827],"category_scores_gemma":[0.0016724747,0.00043344204,0.00038497077,0.00041405394,0.00016872288,0.00057758583,0.00062505057,0.00075983745,0.0007232505],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004099193,0.00010424882,0.0013108163,0.000078403114,0.000050060647,0.00007594562,0.000075936354,0.034131028,0.030884534,0.0010022323,0.0014440916,0.9304327],"study_design_scores_gemma":[0.00007902429,0.00022288393,0.002334846,0.000017708877,0.00006279707,0.00007787797,0.000080425525,0.9727631,0.018474493,0.0044714543,0.0014001456,0.000015182694],"about_ca_topic_score_codex":0.00155012,"about_ca_topic_score_gemma":0.003006499,"teacher_disagreement_score":0.0030751827,"about_ca_system_score_codex":0.00019561315,"about_ca_system_score_gemma":0.0003518865,"threshold_uncertainty_score":0.010287523},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15751475,0.007690447,0.7396354,0.0026938466,0.00092417916,0.00043625978,0.005571377,0.00815681,0.077376924],"genre_scores_gemma":[0.75747347,0.0020872476,0.20247105,0.0005314723,0.00053154276,0.00016633762,0.00688402,0.0014253895,0.028429434],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936678,0.001728533,0.00041417588,0.0007766302,0.0028940882,0.0005188377],"domain_scores_gemma":[0.9844775,0.004816166,0.0004394524,0.0065090586,0.00336352,0.0003941828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037539655,0.00087376096,0.0013161962,0.0017673908,0.00081575103,0.004667271,0.00159848,0.0010705201,0.017664392],"category_scores_gemma":[0.016803458,0.00070611684,0.0013674052,0.0020192128,0.0013419765,0.00966284,0.0033260917,0.0014923583,0.002492078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018658366,0.0002325636,0.0067458902,0.0009531261,0.00046229493,0.0005590335,0.0009074874,0.019752838,0.020924706,0.3690465,0.033203907,0.54534584],"study_design_scores_gemma":[0.00019464368,0.0005776476,0.0036805281,0.0003538446,0.00068435946,0.0009659561,0.00076850597,0.17980383,0.056478903,0.64081424,0.1155333,0.00014431607],"about_ca_topic_score_codex":0.0020569654,"about_ca_topic_score_gemma":0.0031194568,"teacher_disagreement_score":0.017664392,"about_ca_system_score_codex":0.0011497145,"about_ca_system_score_gemma":0.0013551151,"threshold_uncertainty_score":0.059093297},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018194625,0.0006125144,0.9795009,0.00017747769,0.000028974342,0.00009119334,0.0002310762,0.00054941,0.0006138992],"genre_scores_gemma":[0.44326797,0.0013037209,0.54967284,0.00012548939,0.00022555803,0.0007697054,0.0023616457,0.00020360938,0.0020694272],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99478674,0.0018578564,0.00062543584,0.0008136889,0.0016174259,0.00029881462],"domain_scores_gemma":[0.9651115,0.024662863,0.0019966823,0.0054671834,0.0023877292,0.0003740355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005834327,0.0010469486,0.002769585,0.004538072,0.0014259728,0.003225713,0.0050757877,0.0019560514,0.0033550537],"category_scores_gemma":[0.051333245,0.001304859,0.0019446226,0.0074096634,0.001620343,0.008893788,0.004468921,0.002767143,0.0012257933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009813713,0.0005219766,0.008917091,0.0006090943,0.00034463077,0.0003597903,0.0004937036,0.23150212,0.0023277646,0.08677959,0.0043652602,0.66279763],"study_design_scores_gemma":[0.000060276783,0.00019814767,0.0010675943,0.000046940342,0.00007070995,0.00042470993,0.00016659072,0.8438859,0.0011015817,0.15072116,0.0022220116,0.00003439942],"about_ca_topic_score_codex":0.0008768218,"about_ca_topic_score_gemma":0.00096730527,"teacher_disagreement_score":0.005834327,"about_ca_system_score_codex":0.000731761,"about_ca_system_score_gemma":0.0014263965,"threshold_uncertainty_score":0.030855238},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08748488,0.0025656065,0.90449125,0.00014865083,0.00026108196,0.00006634598,0.00027863475,0.0008909257,0.0038127084],"genre_scores_gemma":[0.6137742,0.0025330717,0.37591204,0.00009081292,0.00023623448,0.00007885804,0.00085514045,0.00013548209,0.0063840947],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998229,0.000034987865,0.00001803496,0.00003307603,0.00006610025,0.000024928127],"domain_scores_gemma":[0.9993331,0.00030454848,0.000050091527,0.00008236312,0.00019566996,0.000034280984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057664997,0.0002631239,0.00045335336,0.0011932418,0.0002985146,0.00084444805,0.00041100543,0.0003262827,0.0019448422],"category_scores_gemma":[0.0014772986,0.00016240917,0.0003554459,0.0015146963,0.00029315308,0.00059549615,0.00048564092,0.0003933625,0.000629948],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043671377,0.00012212417,0.0023368949,0.00014423762,0.00004675878,0.00013865734,0.00007985715,0.014340939,0.12854518,0.009369606,0.0020499814,0.842389],"study_design_scores_gemma":[0.00013097473,0.00047917294,0.0078934375,0.00004634284,0.00017043662,0.0008283283,0.00024559099,0.8616823,0.09774426,0.012637788,0.018076736,0.000064736974],"about_ca_topic_score_codex":0.0031022956,"about_ca_topic_score_gemma":0.0029965588,"teacher_disagreement_score":0.0031022956,"about_ca_system_score_codex":0.000218373,"about_ca_system_score_gemma":0.0004603263,"threshold_uncertainty_score":0.006506145},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13970958,0.00020971229,0.85419947,0.00021801327,0.000036046964,0.00015144648,0.00015194673,0.0035459965,0.0017777923],"genre_scores_gemma":[0.6779828,0.00009889608,0.32001996,0.00007897778,0.000036073656,0.00006996095,0.00044496002,0.00016378814,0.0011045663],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998703,0.00027172163,0.00015261548,0.00028522874,0.0004604823,0.00012686726],"domain_scores_gemma":[0.9861622,0.0072375573,0.0011531893,0.002885208,0.0022111323,0.00035075276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024678772,0.0005116655,0.0007439889,0.0017441531,0.00060554186,0.0015023879,0.0024562436,0.0008708037,0.0025511964],"category_scores_gemma":[0.019137396,0.000681114,0.0005774166,0.0011558374,0.00072111253,0.0037872922,0.0018056475,0.001452221,0.0004921887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034830175,0.00049104396,0.0070716427,0.00008935409,0.00007671735,0.00020133797,0.00042066636,0.07728655,0.0060348944,0.0049353526,0.0021805556,0.90086365],"study_design_scores_gemma":[0.000041603624,0.00009960784,0.0013470207,0.000035657555,0.0000649037,0.000111768255,0.00009150062,0.9725471,0.008544688,0.016179757,0.00091836625,0.000018056175],"about_ca_topic_score_codex":0.0039199293,"about_ca_topic_score_gemma":0.005524733,"teacher_disagreement_score":0.0039199293,"about_ca_system_score_codex":0.0006775816,"about_ca_system_score_gemma":0.000960713,"threshold_uncertainty_score":0.01305151},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054085705,0.01054842,0.8147202,0.058245067,0.0017090999,0.00011184861,0.00074700016,0.0009565446,0.058876082],"genre_scores_gemma":[0.6832803,0.006119988,0.29009223,0.0036615652,0.001756989,0.00016783453,0.0007910557,0.00074475067,0.013385283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99745387,0.0009386215,0.00021039428,0.00049540686,0.0006259034,0.00027584133],"domain_scores_gemma":[0.986286,0.008362919,0.00074911653,0.0031090225,0.0008927306,0.0006002158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003932808,0.00048071748,0.0011514111,0.001005185,0.001563324,0.0040028626,0.0022496681,0.0023767496,0.011284291],"category_scores_gemma":[0.025969971,0.0007785507,0.0012187556,0.001863927,0.0038631728,0.01798595,0.0039253864,0.005457491,0.0015212252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028706467,0.00006510175,0.0007516935,0.000293309,0.000045058423,0.00017419923,0.00058040244,0.009965823,0.0012705787,0.8720789,0.015425545,0.0990623],"study_design_scores_gemma":[0.000042034186,0.000014459261,0.00023879371,0.00004904406,0.00001808073,0.0000998779,0.00023321336,0.015405764,0.0003597357,0.9683409,0.015185198,0.000013093349],"about_ca_topic_score_codex":0.0031752384,"about_ca_topic_score_gemma":0.0033564782,"teacher_disagreement_score":0.011284291,"about_ca_system_score_codex":0.001259408,"about_ca_system_score_gemma":0.0021064929,"threshold_uncertainty_score":0.037749708},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013331355,0.00069749786,0.9756806,0.0002560854,0.00010498254,0.00040361745,0.0010430517,0.006521692,0.0019611085],"genre_scores_gemma":[0.111227326,0.00046758787,0.88111514,0.00023064188,0.00009144783,0.00043541673,0.004027521,0.00024060253,0.0021643513],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99730515,0.0006347904,0.0003746135,0.00045720037,0.0010441818,0.00018398327],"domain_scores_gemma":[0.99334466,0.003959911,0.00027909986,0.0009030667,0.0013873935,0.00012593639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002548057,0.000863224,0.0020593314,0.0030847522,0.0011672777,0.0018180002,0.0030920324,0.00083482417,0.0030992534],"category_scores_gemma":[0.008384484,0.0005999374,0.0013212438,0.0036399586,0.00052986166,0.0019458178,0.0016322721,0.0017500435,0.0033531568],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024311646,0.0004879603,0.0026836896,0.0003456901,0.00015236344,0.00021725275,0.00012492228,0.021957513,0.0071318927,0.005573401,0.0109000895,0.95018214],"study_design_scores_gemma":[0.00015800135,0.00020040097,0.0021027916,0.00009922385,0.0002472527,0.00055267406,0.0001153069,0.91607934,0.019555056,0.050832875,0.009994853,0.00006227291],"about_ca_topic_score_codex":0.003138729,"about_ca_topic_score_gemma":0.0048880004,"teacher_disagreement_score":0.003138729,"about_ca_system_score_codex":0.0006250458,"about_ca_system_score_gemma":0.0030462719,"threshold_uncertainty_score":0.013475537},"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":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016973248,0.14034075,0.14119978,0.53337294,0.010686645,0.00007240006,0.0008299572,0.0015180437,0.15500629],"genre_scores_gemma":[0.39318734,0.19353195,0.2208012,0.06361608,0.027636584,0.00022895556,0.0019362338,0.00069913024,0.098362595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983358,0.00044829128,0.00010858534,0.0001784932,0.00082812185,0.000100818084],"domain_scores_gemma":[0.99306023,0.0028979555,0.0004317562,0.0011356475,0.0013815131,0.0010929221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00451384,0.00043850995,0.0010025038,0.0023733724,0.0030534226,0.019858357,0.0014185809,0.004583838,0.012462733],"category_scores_gemma":[0.011555109,0.0003946046,0.00050480344,0.0046101934,0.005434523,0.034372766,0.0040548057,0.004871026,0.0050062756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004044482,0.00005562197,0.0013535437,0.00037157547,0.000042548654,0.0000913604,0.0009946788,0.00047909326,0.00041715227,0.46625954,0.18380311,0.34609133],"study_design_scores_gemma":[0.000009667514,0.000014730222,0.000661011,0.00019689827,0.000019293133,0.00014233253,0.0015220648,0.0022812537,0.00016380093,0.6975151,0.2974506,0.000023239601],"about_ca_topic_score_codex":0.0029506187,"about_ca_topic_score_gemma":0.0062869373,"teacher_disagreement_score":0.019858357,"about_ca_system_score_codex":0.0017430368,"about_ca_system_score_gemma":0.0039262814,"threshold_uncertainty_score":0.04169202},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023233697,0.00009860926,0.9972047,0.0000731001,0.000010000067,0.000019895002,0.000019860536,0.000058760266,0.00019173269],"genre_scores_gemma":[0.12008722,0.00057621766,0.8769332,0.00014875368,0.00013876347,0.00024044824,0.0003361136,0.00010609564,0.0014332397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978023,0.0011571253,0.00013892191,0.00028105528,0.00049040944,0.0001301198],"domain_scores_gemma":[0.9910678,0.0063054366,0.0004892763,0.0007866424,0.0011712367,0.00017965061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057346034,0.00087743276,0.0018393226,0.0026767142,0.0012669058,0.0018670008,0.002486836,0.001949507,0.0018239314],"category_scores_gemma":[0.023043066,0.0014386222,0.0024343182,0.002371586,0.0013323398,0.0022542332,0.0021311226,0.0035184212,0.00060725183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080701415,0.00024746897,0.003271175,0.00018620932,0.00025564793,0.00013942171,0.0004773598,0.45631588,0.0030540351,0.26114228,0.0035449867,0.27128482],"study_design_scores_gemma":[0.0000064924125,0.000013804076,0.00034686684,0.000013570532,0.000014523665,0.000022542434,0.000013246302,0.942158,0.00023636066,0.05651713,0.0006430098,0.000014478652],"about_ca_topic_score_codex":0.009458244,"about_ca_topic_score_gemma":0.010216766,"teacher_disagreement_score":0.009458244,"about_ca_system_score_codex":0.0012541446,"about_ca_system_score_gemma":0.0031598464,"threshold_uncertainty_score":0.030327857},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13856286,0.001647824,0.82702017,0.002623676,0.0003895303,0.00084920897,0.00028294968,0.012899546,0.015724143],"genre_scores_gemma":[0.77106744,0.0011497264,0.21636222,0.0003613053,0.00023514978,0.0003452571,0.0013755735,0.0009445499,0.008158752],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99606127,0.0010319954,0.00060320745,0.00065318326,0.0011670433,0.00048329597],"domain_scores_gemma":[0.98941153,0.0017149651,0.0012279012,0.004518456,0.0018037234,0.0013232749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011913164,0.00046765624,0.0009851618,0.0023922203,0.0023013263,0.0090739215,0.0034804246,0.0010540728,0.0010464794],"category_scores_gemma":[0.013881646,0.0011089261,0.0005351887,0.0024152016,0.0013268227,0.0078080897,0.0037350971,0.0022138045,0.00074217044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001168107,0.0018015498,0.04984412,0.00040027092,0.00028245666,0.0016915959,0.0052660657,0.03313936,0.044665772,0.35933068,0.029861901,0.47254822],"study_design_scores_gemma":[0.00022239496,0.00050876767,0.01000119,0.00023559407,0.00041756555,0.0019077087,0.00184034,0.6710494,0.06385032,0.07038862,0.17930578,0.00027237358],"about_ca_topic_score_codex":0.0035986155,"about_ca_topic_score_gemma":0.0032392393,"teacher_disagreement_score":0.011913164,"about_ca_system_score_codex":0.0015744811,"about_ca_system_score_gemma":0.0028813563,"threshold_uncertainty_score":0.0630036},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014023702,0.0006638715,0.9814461,0.00022234854,0.00007277284,0.00006407761,0.00028733123,0.0009869918,0.0022328873],"genre_scores_gemma":[0.09821608,0.00039336833,0.89817923,0.000096721364,0.000035633995,0.00012862067,0.0008298377,0.00025807496,0.0018624427],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993319,0.00013231912,0.000057728652,0.00010675331,0.00026917705,0.00010196697],"domain_scores_gemma":[0.9986313,0.00053057895,0.00006990236,0.00027985408,0.00040599098,0.0000823937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010658797,0.0006495422,0.0017704901,0.0016685971,0.0012084909,0.0022376273,0.0022029297,0.0010447397,0.0042915056],"category_scores_gemma":[0.0042237225,0.0006795896,0.0009652439,0.0028009284,0.00071801164,0.0036459058,0.0021542595,0.0017282828,0.0010373667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005881116,0.00013829986,0.0017707844,0.00039166203,0.00011616067,0.000087264816,0.00030158504,0.34363765,0.0051165638,0.0868113,0.01854429,0.5424963],"study_design_scores_gemma":[0.00003448939,0.00004090302,0.00016871652,0.00002732027,0.000016099848,0.00005265126,0.000057710677,0.9502225,0.002175291,0.041986305,0.005201642,0.000016446065],"about_ca_topic_score_codex":0.012045475,"about_ca_topic_score_gemma":0.011414453,"teacher_disagreement_score":0.012045475,"about_ca_system_score_codex":0.0011034906,"about_ca_system_score_gemma":0.0018909808,"threshold_uncertainty_score":0.023950696},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07274996,0.001019298,0.9175188,0.0013734871,0.000105859435,0.00033956367,0.001455453,0.003044857,0.002392752],"genre_scores_gemma":[0.3389491,0.0006730571,0.6530453,0.00031685462,0.00012381656,0.00023687632,0.00390146,0.00056506245,0.0021883706],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970862,0.0009115334,0.00025601144,0.00056919875,0.0008861643,0.00029086997],"domain_scores_gemma":[0.98647016,0.005950574,0.00077111344,0.0044291797,0.0019473288,0.0004316931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016481776,0.0009828124,0.0027604578,0.0045117517,0.0013792694,0.0024835747,0.003293507,0.0013714659,0.0030011584],"category_scores_gemma":[0.012944194,0.00080089975,0.0026733163,0.0059912754,0.0010201513,0.005780153,0.002671729,0.0013201853,0.0008374558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079493853,0.000726792,0.00951367,0.000914754,0.00054274395,0.00044892658,0.00072955934,0.1846844,0.030628474,0.037921514,0.018166479,0.7149278],"study_design_scores_gemma":[0.00007123321,0.00016260643,0.0023753203,0.00005448109,0.00029970828,0.0002975422,0.00049040065,0.9083661,0.006351848,0.07638277,0.005107142,0.00004090392],"about_ca_topic_score_codex":0.010572015,"about_ca_topic_score_gemma":0.019399432,"teacher_disagreement_score":0.010572015,"about_ca_system_score_codex":0.001296954,"about_ca_system_score_gemma":0.0026050443,"threshold_uncertainty_score":0.021020949},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25540638,0.00039376572,0.73958963,0.00015779653,0.00006618898,0.00023550392,0.00045754467,0.0012611492,0.0024320579],"genre_scores_gemma":[0.6842603,0.00014054656,0.3131332,0.00002370093,0.00003603859,0.00015163264,0.0008437765,0.00012397808,0.0012868302],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979873,0.0006584743,0.00018866036,0.0003396314,0.0006302668,0.00019567815],"domain_scores_gemma":[0.9975158,0.0011319584,0.00018961806,0.00038059137,0.0007005593,0.00008142851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024494391,0.00055085466,0.0011725633,0.0036587615,0.001190225,0.0023487268,0.0015809294,0.0010228943,0.0013971772],"category_scores_gemma":[0.007936334,0.00038483538,0.0014275998,0.0034843562,0.0004956325,0.0017783967,0.0010407155,0.00081870094,0.0006556385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020647955,0.0006110775,0.017570665,0.00035601133,0.00051808136,0.00015863066,0.0021034807,0.358755,0.007631472,0.011336831,0.006247416,0.59264654],"study_design_scores_gemma":[0.000023507682,0.0000805197,0.0043344838,0.000017634437,0.00005857837,0.00003750814,0.0003467714,0.98418564,0.0029742057,0.0070352764,0.00085526676,0.000050681385],"about_ca_topic_score_codex":0.012884314,"about_ca_topic_score_gemma":0.007988765,"teacher_disagreement_score":0.012884314,"about_ca_system_score_codex":0.0012284927,"about_ca_system_score_gemma":0.0012360971,"threshold_uncertainty_score":0.025618672},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020101918,0.000248415,0.974936,0.00024397245,0.000059864244,0.000077695746,0.000060241433,0.00045684932,0.0038150374],"genre_scores_gemma":[0.3682278,0.00031545994,0.623494,0.0002047097,0.000069030415,0.0001652355,0.00022942113,0.00012145223,0.007172758],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995111,0.00013830303,0.000022146027,0.00008057088,0.00019551825,0.00005235597],"domain_scores_gemma":[0.99930716,0.00027715333,0.00003936159,0.000101622245,0.00024680965,0.000027897815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006953975,0.00038060787,0.0006520809,0.0015535236,0.000730925,0.0011548811,0.0015309084,0.0010188401,0.0028921706],"category_scores_gemma":[0.0022421062,0.0003380442,0.0006001336,0.0016956403,0.0006891694,0.0009914458,0.00076283276,0.0009125046,0.00037689504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105685736,0.00014422291,0.00103942,0.000053214895,0.00007100583,0.00010056291,0.00019628029,0.6963532,0.0055828025,0.053010244,0.00261608,0.24072735],"study_design_scores_gemma":[0.000010884793,0.000021800512,0.00015834252,0.000005958064,0.000014620489,0.000027227286,0.000032663458,0.9853086,0.0010173755,0.012399821,0.0009969814,0.0000056845843],"about_ca_topic_score_codex":0.011634973,"about_ca_topic_score_gemma":0.009597778,"teacher_disagreement_score":0.011634973,"about_ca_system_score_codex":0.0012173755,"about_ca_system_score_gemma":0.0013538664,"threshold_uncertainty_score":0.02313453},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59304,0.00047296504,0.4024533,0.000086679545,0.000107824046,0.00006746684,0.00014496336,0.00049431046,0.0031323915],"genre_scores_gemma":[0.924682,0.00016526578,0.07308278,0.00002096525,0.000041129668,0.000028510725,0.00019222812,0.00006438964,0.0017227874],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963665,0.00006386858,0.000028577964,0.000098301476,0.00009978914,0.00007278018],"domain_scores_gemma":[0.9991303,0.0003395586,0.00009412429,0.000091559676,0.0002485385,0.00009591401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007251578,0.0005833302,0.000691912,0.0016884208,0.0005661635,0.0009651262,0.00041017134,0.00081612036,0.0017788353],"category_scores_gemma":[0.0011890908,0.00026448612,0.0005950278,0.00080058584,0.00046484955,0.0011310304,0.0008068694,0.0006196119,0.0012916753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028695865,0.00031647467,0.027836025,0.00023592285,0.00012432237,0.0002938093,0.00024083014,0.009705501,0.4157013,0.001431425,0.0006990543,0.5405458],"study_design_scores_gemma":[0.000076024626,0.00059883913,0.06291529,0.00006516059,0.00026990444,0.000705717,0.0006724052,0.7799878,0.14970636,0.0021922276,0.0027394667,0.00007091256],"about_ca_topic_score_codex":0.00050813763,"about_ca_topic_score_gemma":0.00080354244,"teacher_disagreement_score":0.0017788353,"about_ca_system_score_codex":0.0001586651,"about_ca_system_score_gemma":0.0002439919,"threshold_uncertainty_score":0.0059508085},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9114044,0.0012369666,0.05955266,0.00086122344,0.00031478985,0.00012184507,0.0064971894,0.014430455,0.005580438],"genre_scores_gemma":[0.9512878,0.0004074608,0.04001266,0.00017364685,0.00014098366,0.000038686772,0.0062137875,0.00024356609,0.0014815264],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995443,0.00005677936,0.000060311242,0.00009360557,0.00017490027,0.000070058144],"domain_scores_gemma":[0.99804497,0.00069824985,0.00027013954,0.00026881575,0.00045644146,0.0002613759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060481514,0.00047974265,0.0003814186,0.0021601191,0.0002776617,0.0013580357,0.000470782,0.0004836812,0.0014698587],"category_scores_gemma":[0.0035083196,0.00020823065,0.00019737934,0.001565947,0.00013748385,0.0021234874,0.00046121876,0.00032447762,0.00096912717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017522557,0.00030539633,0.3345341,0.00043644328,0.00018625017,0.00040881804,0.00047858048,0.0049581905,0.08515031,0.0023553444,0.040397175,0.5290371],"study_design_scores_gemma":[0.00023391178,0.0010311423,0.1928604,0.00014066591,0.00037011364,0.0019322981,0.00210705,0.6271382,0.10988965,0.012362397,0.051843904,0.00009020863],"about_ca_topic_score_codex":0.002277089,"about_ca_topic_score_gemma":0.0040440597,"teacher_disagreement_score":0.002277089,"about_ca_system_score_codex":0.00024446438,"about_ca_system_score_gemma":0.0005532512,"threshold_uncertainty_score":0.004917145},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046267066,0.000243545,0.9496691,0.00021075878,0.0000909446,0.00015493394,0.00012339916,0.0011867721,0.0020534545],"genre_scores_gemma":[0.36250317,0.00015237546,0.62803185,0.00012901302,0.000086515356,0.00028674633,0.0008446425,0.00025712734,0.0077086436],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99603575,0.0009992004,0.00031097673,0.00083658873,0.0014347057,0.0003827929],"domain_scores_gemma":[0.9914954,0.0038721994,0.00031331778,0.0015102495,0.0026568323,0.00015204745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004733506,0.00087523874,0.001421336,0.0022221685,0.0011519481,0.0025503943,0.0025165048,0.0018347987,0.0038281912],"category_scores_gemma":[0.012029177,0.0006149415,0.0021439805,0.0020382856,0.00061630923,0.0028073096,0.0023990932,0.0025579103,0.0025051283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005241163,0.0004984868,0.00889915,0.00017792749,0.00026268937,0.0001824992,0.00033803433,0.07075813,0.016452862,0.01251585,0.006092614,0.8832976],"study_design_scores_gemma":[0.000022556986,0.000088322005,0.0014707391,0.000016662707,0.000057922658,0.00012234613,0.000071692855,0.9741122,0.010962248,0.010614582,0.0024426384,0.000018130615],"about_ca_topic_score_codex":0.003299134,"about_ca_topic_score_gemma":0.0049477182,"teacher_disagreement_score":0.004733506,"about_ca_system_score_codex":0.0011833981,"about_ca_system_score_gemma":0.0019107724,"threshold_uncertainty_score":0.025033474},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43270347,0.00084027444,0.5411112,0.0004414746,0.0003337552,0.0003106846,0.0071649314,0.0030003858,0.014093902],"genre_scores_gemma":[0.91006273,0.00017364617,0.081641495,0.000026362568,0.00010358972,0.00013821629,0.0039559016,0.000111999834,0.0037859778],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995871,0.000084015504,0.00004403225,0.00009324641,0.000120477795,0.0000710241],"domain_scores_gemma":[0.99898154,0.00041016826,0.00014316832,0.00009721672,0.00029280432,0.000075043485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006156411,0.00041654176,0.00041873302,0.0040946603,0.00049371936,0.0010159255,0.00047507542,0.00035518725,0.0039285626],"category_scores_gemma":[0.0025442275,0.00013406863,0.00080444646,0.0034024687,0.00023149364,0.0010439178,0.0006652454,0.0005532493,0.00092415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022573967,0.00055008807,0.060228664,0.0004886604,0.00043019015,0.0006067328,0.0009964096,0.03703146,0.029667607,0.026419668,0.01584417,0.825479],"study_design_scores_gemma":[0.000044231543,0.0001618364,0.0379275,0.000043733453,0.00016730613,0.00033645498,0.0008420082,0.92604846,0.008667309,0.016889242,0.008798881,0.000073056144],"about_ca_topic_score_codex":0.005560923,"about_ca_topic_score_gemma":0.009040698,"teacher_disagreement_score":0.005560923,"about_ca_system_score_codex":0.0005069197,"about_ca_system_score_gemma":0.0006408347,"threshold_uncertainty_score":0.013142407},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33338034,0.0012306758,0.65070826,0.0011300583,0.00037453417,0.00023823034,0.0005548882,0.003708663,0.008674366],"genre_scores_gemma":[0.9190474,0.0001630386,0.07456764,0.00018867807,0.00014273141,0.000055502627,0.0003135121,0.00012329777,0.005398242],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948515,0.0013344875,0.000286387,0.0006114369,0.0020239137,0.0008921486],"domain_scores_gemma":[0.9884901,0.005298423,0.00081583794,0.0025770492,0.00230161,0.0005170557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033533368,0.0012082441,0.0031347135,0.002288636,0.0012783696,0.003343592,0.0027998681,0.0028900828,0.0046012024],"category_scores_gemma":[0.014308044,0.00065904594,0.001369945,0.0017991927,0.0011399129,0.0031955633,0.0034868708,0.001271292,0.0015442938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0066736313,0.0013732223,0.014053115,0.0005443795,0.0005004414,0.00059087353,0.0003821404,0.2933176,0.059149224,0.04230156,0.015792485,0.56532127],"study_design_scores_gemma":[0.000035192847,0.00019834009,0.0026426488,0.00000976575,0.000070453156,0.00027028634,0.000052330877,0.9784757,0.0082262885,0.0090128835,0.0009595606,0.000046542096],"about_ca_topic_score_codex":0.0026314724,"about_ca_topic_score_gemma":0.00315563,"teacher_disagreement_score":0.0046012024,"about_ca_system_score_codex":0.0017242909,"about_ca_system_score_gemma":0.002002686,"threshold_uncertainty_score":0.017734408},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00747499,0.0017947659,0.987452,0.0006003351,0.00009173618,0.0002421883,0.00069123256,0.00067774014,0.0009750847],"genre_scores_gemma":[0.09248449,0.0024758915,0.9001809,0.0002999555,0.00024567163,0.00051368313,0.0016408728,0.00024319648,0.0019154085],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99630356,0.0009912582,0.0003343472,0.0007489662,0.0014699976,0.00015184192],"domain_scores_gemma":[0.9845999,0.009689311,0.0010425636,0.0017655342,0.0025635215,0.0003391607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045934794,0.0015437764,0.0026782725,0.0041611986,0.00097222015,0.0023566934,0.004278783,0.0013568747,0.003021284],"category_scores_gemma":[0.02172062,0.00088629156,0.0020532717,0.008666292,0.001209194,0.0040526767,0.0017826164,0.0029513654,0.0013364091],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004930506,0.00046324756,0.008692825,0.0013652251,0.00053022197,0.00040308878,0.00020496997,0.10482076,0.0048529855,0.039529894,0.012928508,0.82571524],"study_design_scores_gemma":[0.00006378006,0.00011175916,0.0010412168,0.0000766235,0.00011154407,0.00036829402,0.00005718877,0.94016117,0.0026509734,0.049124464,0.00619279,0.0000401099],"about_ca_topic_score_codex":0.0065875812,"about_ca_topic_score_gemma":0.008069252,"teacher_disagreement_score":0.0065875812,"about_ca_system_score_codex":0.0008071624,"about_ca_system_score_gemma":0.003552192,"threshold_uncertainty_score":0.024292946},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033218045,0.0005687361,0.9547516,0.00042296472,0.00013500307,0.00019118506,0.0007958474,0.0041997307,0.00571693],"genre_scores_gemma":[0.25013015,0.00029812014,0.74167126,0.00020826962,0.00005615158,0.00021147917,0.0020799998,0.00096240686,0.0043821703],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99733776,0.00096292957,0.00022146893,0.00037052456,0.00085307413,0.00025420878],"domain_scores_gemma":[0.99636936,0.0020740803,0.00016087416,0.0007550134,0.00054305076,0.000097691496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023396425,0.0008411811,0.0012518103,0.0014622785,0.00082563394,0.0026536337,0.0019668057,0.0010212488,0.007830597],"category_scores_gemma":[0.008368305,0.0007561611,0.0016423027,0.002696307,0.0008922236,0.0032497316,0.0021312665,0.0018348012,0.001380966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011248958,0.00053943036,0.0020888022,0.00048368936,0.0002459977,0.00047552475,0.00058377645,0.22312109,0.023100907,0.20119794,0.028330395,0.5187076],"study_design_scores_gemma":[0.00013059727,0.00011588796,0.0004928257,0.000052226078,0.00009342877,0.00018870628,0.00019838111,0.8034242,0.014605084,0.1698562,0.010796462,0.0000460546],"about_ca_topic_score_codex":0.00452665,"about_ca_topic_score_gemma":0.008287015,"teacher_disagreement_score":0.007830597,"about_ca_system_score_codex":0.0014817379,"about_ca_system_score_gemma":0.0018270706,"threshold_uncertainty_score":0.026195943},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12953457,0.001133527,0.8646136,0.00047631396,0.00006791686,0.00020461115,0.0019227818,0.0010625251,0.00098417],"genre_scores_gemma":[0.6895126,0.0004526509,0.3052921,0.00010835436,0.00011021604,0.00015211843,0.0033859578,0.0001108485,0.0008751955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871325,0.00023779261,0.00013151142,0.00043962782,0.00032171773,0.00015603792],"domain_scores_gemma":[0.9958429,0.0025758056,0.00041020007,0.00039102466,0.0006021833,0.00017789252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016425195,0.0010008147,0.0023564803,0.0040496774,0.00086777547,0.0018442228,0.0024949543,0.0014741177,0.0012399872],"category_scores_gemma":[0.0066737123,0.00067046523,0.0011914053,0.0058166333,0.0004732984,0.0026037325,0.0013273964,0.001186163,0.00043579275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00090943224,0.00056827866,0.035985526,0.00041726124,0.00062756747,0.00066819065,0.00044521235,0.6330989,0.0057016346,0.0062093027,0.005102747,0.31026602],"study_design_scores_gemma":[0.000015695476,0.000044743687,0.0018953432,0.000011994987,0.000070678194,0.00008087198,0.00009004043,0.9899312,0.0006174605,0.0067295637,0.00049772084,0.0000146548855],"about_ca_topic_score_codex":0.009156527,"about_ca_topic_score_gemma":0.011888733,"teacher_disagreement_score":0.009156527,"about_ca_system_score_codex":0.0005623962,"about_ca_system_score_gemma":0.0010672087,"threshold_uncertainty_score":0.018206477},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2012367,0.0020474463,0.7779199,0.00067396415,0.00019094902,0.0003779183,0.0078675905,0.00353296,0.0061525493],"genre_scores_gemma":[0.7150823,0.0008217028,0.26825175,0.00014466037,0.00014123064,0.00024148206,0.009917192,0.00012302777,0.005276687],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930286,0.0001416539,0.000056582907,0.00022571537,0.00020371411,0.0000695],"domain_scores_gemma":[0.99761367,0.0011350948,0.00021311767,0.00030996642,0.000623556,0.000104704646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052660704,0.0006025606,0.0009841893,0.0069969245,0.0009749165,0.0010585019,0.0013134392,0.0011286949,0.0023779494],"category_scores_gemma":[0.0042707096,0.0003267764,0.00089273805,0.005641398,0.00025298216,0.0021955925,0.0006634624,0.00078498304,0.0015122361],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011647294,0.001254085,0.04759292,0.0007635782,0.0007605365,0.0005323011,0.00039760166,0.12306673,0.01820828,0.010732804,0.03509461,0.7604318],"study_design_scores_gemma":[0.000017563647,0.0000528814,0.004880422,0.000025381245,0.00010302999,0.0001685614,0.00006824872,0.98502153,0.0021584267,0.0058628963,0.0016123111,0.00002872848],"about_ca_topic_score_codex":0.017426744,"about_ca_topic_score_gemma":0.036753956,"teacher_disagreement_score":0.017426744,"about_ca_system_score_codex":0.00072928786,"about_ca_system_score_gemma":0.0008776225,"threshold_uncertainty_score":0.034650564},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2500614,0.007894242,0.45777237,0.014023477,0.0021680756,0.00021465785,0.0019395446,0.0021226618,0.26380354],"genre_scores_gemma":[0.8623587,0.0025728971,0.071468174,0.0014317714,0.0013263788,0.00015427955,0.0013728361,0.0008784882,0.05843647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977404,0.00047973078,0.00016822462,0.0006056179,0.00070185325,0.0003041867],"domain_scores_gemma":[0.9943515,0.0032808855,0.00043992873,0.0008892375,0.0005830597,0.00045544523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020930464,0.0007840983,0.0019659942,0.0030666294,0.0042000017,0.0068270164,0.0014234532,0.0017903851,0.019005274],"category_scores_gemma":[0.010823165,0.0012543895,0.0011688737,0.003917478,0.0045210733,0.018782256,0.0052420185,0.003951509,0.0020864161],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068902904,0.000013341193,0.00024281247,0.000030491005,0.000007716939,0.000047281315,0.00029920065,0.00023271682,0.00020954873,0.9896193,0.0028449828,0.006383727],"study_design_scores_gemma":[0.000017121924,0.000009405153,0.000097759366,0.000012889828,0.000011971418,0.00008492687,0.00013879481,0.0011086407,0.00021711836,0.98941934,0.008874883,0.000007150547],"about_ca_topic_score_codex":0.0012343199,"about_ca_topic_score_gemma":0.0010190994,"teacher_disagreement_score":0.019005274,"about_ca_system_score_codex":0.0015018007,"about_ca_system_score_gemma":0.00083281,"threshold_uncertainty_score":0.06357896},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031944294,0.0012830676,0.95989853,0.00043101623,0.00012045473,0.0003372825,0.0014231033,0.0023206116,0.0022415852],"genre_scores_gemma":[0.15745753,0.00063283055,0.8329218,0.00017151803,0.00016475124,0.00034772753,0.0036704028,0.000112271635,0.0045210687],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99693334,0.00047715713,0.0003598729,0.0005330103,0.0015210008,0.00017569792],"domain_scores_gemma":[0.99288565,0.0039899107,0.0004019902,0.0012094633,0.0013425639,0.00017045083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019153749,0.0011185234,0.002108886,0.0062995534,0.0017782756,0.0027945389,0.0029725924,0.0013124669,0.0034643945],"category_scores_gemma":[0.010782055,0.0008748615,0.001564426,0.006367627,0.0008341443,0.0034983666,0.00287042,0.0018342824,0.0018132776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005114841,0.0006336015,0.01006617,0.00037078746,0.00037887244,0.0005444264,0.00032190155,0.019757092,0.008724493,0.025912415,0.011915239,0.9208635],"study_design_scores_gemma":[0.00022310884,0.0002721995,0.0047595445,0.00012026114,0.0004925171,0.0020402204,0.0003865475,0.81729597,0.010518755,0.1451983,0.018600317,0.000092189824],"about_ca_topic_score_codex":0.003121452,"about_ca_topic_score_gemma":0.008400929,"teacher_disagreement_score":0.0062995534,"about_ca_system_score_codex":0.00058964954,"about_ca_system_score_gemma":0.0028954134,"threshold_uncertainty_score":0.011589587},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99549377,0.00023152078,0.0029803975,0.000047218728,0.000014595212,0.000031927248,0.000076956305,0.00009124496,0.0010323483],"genre_scores_gemma":[0.9975552,0.000054382494,0.0019777026,0.000016157446,0.000012466233,0.000012362026,0.00011573661,0.000011862339,0.00024412156],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9968977,0.001508201,0.0003936879,0.00018882354,0.0008006527,0.00021098323],"domain_scores_gemma":[0.9566723,0.036035504,0.0018361467,0.001006465,0.003564788,0.0008847522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00439729,0.00045295616,0.0006554505,0.0016872479,0.00038803834,0.0013244011,0.00028044215,0.00088689907,0.0017323566],"category_scores_gemma":[0.029183412,0.000164888,0.0006145542,0.0010562264,0.00022062383,0.0014587187,0.00032960958,0.0003624563,0.0006676685],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.023550058,0.0027289002,0.64238983,0.0007342655,0.0016214916,0.00031772023,0.00089618703,0.017217828,0.06221827,0.00060395955,0.0023311856,0.24539016],"study_design_scores_gemma":[0.0006456163,0.018519627,0.6232491,0.000046439953,0.0016949202,0.0008141388,0.0010390227,0.30644643,0.045736827,0.0006757414,0.0008721117,0.00025996906],"about_ca_topic_score_codex":0.0020195579,"about_ca_topic_score_gemma":0.0023948972,"teacher_disagreement_score":0.00439729,"about_ca_system_score_codex":0.00041185514,"about_ca_system_score_gemma":0.00036441477,"threshold_uncertainty_score":0.023255348},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043392223,0.00037579297,0.95046586,0.00026702878,0.0000698245,0.00019825867,0.0007798651,0.039937392,0.0035667748],"genre_scores_gemma":[0.08310638,0.00077870226,0.8840368,0.00061968627,0.00006824767,0.00044838068,0.005312611,0.011816423,0.013812836],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99574983,0.0013157221,0.00038387298,0.0005374349,0.001677492,0.00033555404],"domain_scores_gemma":[0.99606365,0.0023298322,0.00014744073,0.0008167832,0.0004196568,0.0002225796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004868628,0.0013681438,0.0013942138,0.00211242,0.00084193406,0.0053818617,0.0049178367,0.0021174569,0.016746266],"category_scores_gemma":[0.008464496,0.0015084429,0.0023058127,0.0016895118,0.0020987531,0.005347992,0.0045678085,0.0026537334,0.0036732086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031725548,0.000538758,0.0027145187,0.0022004258,0.0005369417,0.0016791972,0.0058111474,0.018106168,0.091162205,0.24999036,0.10445271,0.519635],"study_design_scores_gemma":[0.00089549297,0.00050754857,0.0016756597,0.00046497807,0.0004195766,0.0014808538,0.0014125656,0.33285028,0.17368013,0.096783526,0.38930547,0.00052399735],"about_ca_topic_score_codex":0.0055253226,"about_ca_topic_score_gemma":0.005616025,"teacher_disagreement_score":0.016746266,"about_ca_system_score_codex":0.0009925985,"about_ca_system_score_gemma":0.0012893466,"threshold_uncertainty_score":0.05602181},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027158815,0.0008017231,0.96136034,0.00024368745,0.0002766343,0.00012158528,0.0021062235,0.005954913,0.001976215],"genre_scores_gemma":[0.38726535,0.0006689263,0.5963452,0.0001768952,0.00028659267,0.00043825788,0.008728821,0.0006517966,0.0054382053],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993368,0.00017222189,0.000075536176,0.0001586994,0.00018084004,0.000075864365],"domain_scores_gemma":[0.9992107,0.00027125634,0.00006905888,0.00014804446,0.0002644408,0.00003637939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007198855,0.0005418954,0.0009047428,0.0016096537,0.0005962663,0.00091290596,0.00084568537,0.0008281308,0.006909385],"category_scores_gemma":[0.0021250166,0.00022014011,0.00074247393,0.0028466892,0.0003003929,0.0014069752,0.0011118244,0.00085272186,0.0033270197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007078913,0.00015461186,0.0007779434,0.00015701025,0.00006816407,0.00017639353,0.000050295603,0.009700661,0.044371847,0.008430603,0.010594917,0.92480975],"study_design_scores_gemma":[0.00012486208,0.00053304853,0.0037210037,0.000042090847,0.000113789305,0.00062427414,0.00009851355,0.9139028,0.040933635,0.017663812,0.022143982,0.00009807409],"about_ca_topic_score_codex":0.0028536848,"about_ca_topic_score_gemma":0.0030931896,"teacher_disagreement_score":0.006909385,"about_ca_system_score_codex":0.0003806266,"about_ca_system_score_gemma":0.0009388211,"threshold_uncertainty_score":0.023114145},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.086157404,0.0013260976,0.8584931,0.0058304938,0.0009007459,0.0002866579,0.0020592988,0.0021158475,0.042830415],"genre_scores_gemma":[0.79630053,0.0011299683,0.15894562,0.0010865929,0.0005718057,0.00023482372,0.0009574719,0.0003230744,0.040450174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99080956,0.0024084535,0.0014712152,0.0017751803,0.002282842,0.0012528355],"domain_scores_gemma":[0.9603363,0.010565779,0.002955155,0.020416517,0.004770884,0.0009553809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058508012,0.0005534447,0.0016111679,0.0015420626,0.002735032,0.0066334386,0.002705083,0.0021570905,0.0059681027],"category_scores_gemma":[0.031349882,0.00071488525,0.0011082022,0.0035215658,0.0023229492,0.0095334565,0.0052579185,0.0024714896,0.0033915318],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017165701,0.00020850562,0.0041972734,0.00040118882,0.00019192434,0.00089170836,0.0008405036,0.01769942,0.006034372,0.8113193,0.018985972,0.13751327],"study_design_scores_gemma":[0.00010859122,0.00010993259,0.00058595807,0.000064329775,0.00013502236,0.0024094582,0.00022752161,0.06954839,0.01101085,0.8860932,0.029624732,0.0000820043],"about_ca_topic_score_codex":0.0005524505,"about_ca_topic_score_gemma":0.0005201217,"teacher_disagreement_score":0.0066334386,"about_ca_system_score_codex":0.0015331432,"about_ca_system_score_gemma":0.0027495788,"threshold_uncertainty_score":0.03094238},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010780789,0.0000344754,0.99671656,0.00007699897,0.000010999671,0.000028862749,0.00009165471,0.0013657535,0.00059658184],"genre_scores_gemma":[0.07833146,0.00021180765,0.9179949,0.00011915112,0.00005481398,0.00017957976,0.00071675814,0.00035843631,0.0020330693],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985384,0.0003596982,0.000103230836,0.0003149926,0.00060470414,0.0000790501],"domain_scores_gemma":[0.9972519,0.0013271972,0.00015250771,0.0005989619,0.0005624873,0.00010698317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032732112,0.0006880449,0.00079729455,0.0021087423,0.0009501939,0.0027274524,0.0029003806,0.0013456643,0.0056815413],"category_scores_gemma":[0.008080981,0.0007058841,0.0015939228,0.0021974724,0.00094976847,0.0054409597,0.001933487,0.002023213,0.0019669824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002430723,0.00017596559,0.0022750336,0.0002477052,0.00018051846,0.00022083407,0.0006508294,0.29139167,0.00814835,0.23811257,0.00977187,0.4485816],"study_design_scores_gemma":[0.00001674035,0.000028253447,0.00014683083,0.000017399592,0.00004992105,0.00007231931,0.000026216358,0.89726895,0.0035259938,0.092140146,0.006678876,0.000028321892],"about_ca_topic_score_codex":0.008687283,"about_ca_topic_score_gemma":0.011224841,"teacher_disagreement_score":0.008687283,"about_ca_system_score_codex":0.001249897,"about_ca_system_score_gemma":0.0022535052,"threshold_uncertainty_score":0.01900667},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08828324,0.006924246,0.798193,0.02225874,0.00066265883,0.00018918872,0.00088584755,0.00070367486,0.08189943],"genre_scores_gemma":[0.8021438,0.00268597,0.18398626,0.0009936374,0.00063601974,0.00012903682,0.0010069136,0.00007513999,0.008343234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99472696,0.0029276712,0.0005065664,0.0006201794,0.0009788275,0.00023979328],"domain_scores_gemma":[0.97885066,0.01602021,0.0007196212,0.0023729831,0.0014998036,0.0005367841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076346737,0.000438833,0.000781575,0.0021908549,0.002604711,0.007861656,0.002446954,0.003025445,0.00978213],"category_scores_gemma":[0.03877252,0.00094666064,0.0016201793,0.0026398906,0.0063146814,0.01993454,0.002658244,0.0035086398,0.0010566803],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007922784,0.000034430483,0.0003377879,0.000067735244,0.0000183077,0.00008988485,0.00028336913,0.0030822563,0.00015725294,0.98530537,0.0017795317,0.008764882],"study_design_scores_gemma":[0.000017054772,0.0000053583144,0.000051461135,0.00001388025,0.000012199113,0.000054574746,0.000082452425,0.011675759,0.00016107,0.9854929,0.0024266262,0.0000065081417],"about_ca_topic_score_codex":0.0032214432,"about_ca_topic_score_gemma":0.002485164,"teacher_disagreement_score":0.00978213,"about_ca_system_score_codex":0.002691361,"about_ca_system_score_gemma":0.0015774996,"threshold_uncertainty_score":0.040376484},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017312478,0.0007059392,0.95068073,0.00031168494,0.000104132894,0.00036572095,0.005603068,0.02338484,0.0015315188],"genre_scores_gemma":[0.1102483,0.00057398103,0.8583773,0.00013673127,0.00011782251,0.00039502123,0.02522999,0.0011630751,0.0037577548],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980123,0.00035393162,0.00027266875,0.0005484342,0.000627723,0.00018492671],"domain_scores_gemma":[0.9922516,0.0040998445,0.0005878345,0.0013077455,0.0015473191,0.00020570851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018476511,0.0011586751,0.0014759339,0.006852447,0.0013322517,0.0021306148,0.002776451,0.0016015718,0.0057921764],"category_scores_gemma":[0.008698764,0.0009154249,0.0021822583,0.0066127735,0.00072883203,0.0038337419,0.0018603695,0.0016108181,0.0070705474],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037002264,0.00027689402,0.004875461,0.000700468,0.00015420411,0.00056488335,0.00034112405,0.009101298,0.022398056,0.0063342694,0.026342371,0.92854095],"study_design_scores_gemma":[0.00013107953,0.00025759786,0.0059959763,0.00021697646,0.0004823359,0.0013675942,0.00063724164,0.7902204,0.11056168,0.04768267,0.042314623,0.00013181816],"about_ca_topic_score_codex":0.005343763,"about_ca_topic_score_gemma":0.010385481,"teacher_disagreement_score":0.006852447,"about_ca_system_score_codex":0.0009410227,"about_ca_system_score_gemma":0.0035839244,"threshold_uncertainty_score":0.019376755},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02303825,0.0020979105,0.7850337,0.008074305,0.0010578586,0.0006833853,0.006843672,0.013721901,0.15944901],"genre_scores_gemma":[0.43203074,0.0029146473,0.4307539,0.0033593727,0.0015406202,0.00056744425,0.0199601,0.005545006,0.10332813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9876057,0.003231396,0.0015133857,0.0017662048,0.0049406635,0.0009427056],"domain_scores_gemma":[0.9914185,0.0044212677,0.00038372562,0.0021180522,0.0013947538,0.00026373705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00506111,0.001353608,0.0013624759,0.0031329542,0.0020057715,0.008830975,0.002350362,0.0024274637,0.038323008],"category_scores_gemma":[0.022671308,0.0014201378,0.001832301,0.0036506925,0.002595038,0.018270006,0.0056478716,0.003127883,0.011892426],"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.0005578013,0.00017637621,0.00199807,0.00042285945,0.000090832094,0.0013917629,0.0016151593,0.0026379328,0.00563488,0.7731026,0.07760647,0.13476539],"study_design_scores_gemma":[0.00010555001,0.00005424003,0.00045248095,0.00016774733,0.00015999329,0.0019773047,0.0007826188,0.03248085,0.014242185,0.5918359,0.3576426,0.00009856393],"about_ca_topic_score_codex":0.0023663535,"about_ca_topic_score_gemma":0.0016635259,"teacher_disagreement_score":0.038323008,"about_ca_system_score_codex":0.0017115329,"about_ca_system_score_gemma":0.0014312555,"threshold_uncertainty_score":0.12820327},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052335076,0.0005915838,0.99309045,0.00021645252,0.00002337852,0.00003445336,0.00010927973,0.00025306924,0.00044783927],"genre_scores_gemma":[0.19822422,0.0014512544,0.7958088,0.00015761369,0.00027297015,0.0002214101,0.001118502,0.0003883088,0.0023569677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966546,0.0015460199,0.00017879198,0.0004789846,0.0009388869,0.00020264114],"domain_scores_gemma":[0.97361606,0.020309169,0.0012414419,0.002446726,0.0019392112,0.00044740096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008488044,0.0014972413,0.0036034645,0.003402336,0.0012534722,0.0026567224,0.005596582,0.0030540442,0.002998798],"category_scores_gemma":[0.039223436,0.0021873314,0.0022435328,0.005066263,0.0021572104,0.0084320605,0.0039970498,0.004007502,0.00057517283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030739087,0.00008130062,0.0015364509,0.00028204112,0.00008413462,0.000086763044,0.00025013209,0.8417814,0.0008055669,0.06498857,0.004721238,0.08507497],"study_design_scores_gemma":[0.00000991277,0.0000097318825,0.00008600319,0.000014853692,0.000007810225,0.000015184983,0.0000077645,0.98523456,0.00015187958,0.014056195,0.00040037313,0.0000058539085],"about_ca_topic_score_codex":0.011831308,"about_ca_topic_score_gemma":0.010662752,"teacher_disagreement_score":0.011831308,"about_ca_system_score_codex":0.0016653966,"about_ca_system_score_gemma":0.002110472,"threshold_uncertainty_score":0.04488963},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026702594,0.0014882691,0.96906406,0.0007388462,0.00017798603,0.0000999708,0.0002540278,0.00089313136,0.000581124],"genre_scores_gemma":[0.2527458,0.0009405183,0.7402606,0.0005359517,0.00042521648,0.00028214903,0.0019064067,0.00026512222,0.0026382543],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955723,0.0019373478,0.00046347393,0.0007226365,0.001029483,0.000274816],"domain_scores_gemma":[0.98642635,0.009215307,0.00050318596,0.002497682,0.0010869335,0.00027066626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061886157,0.0010808016,0.0035145849,0.0019895989,0.0012764132,0.0025317024,0.0031384097,0.002902959,0.0031921037],"category_scores_gemma":[0.02269927,0.0009940781,0.0023991708,0.0024407592,0.0010089389,0.00605621,0.0022374035,0.0054950174,0.00090428087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048169834,0.0011006738,0.004127909,0.00039596646,0.00054561405,0.00019399359,0.00044303716,0.20415422,0.0038270473,0.036167506,0.016401969,0.7321603],"study_design_scores_gemma":[0.00003569654,0.00008012573,0.00041073718,0.000024823566,0.0000715419,0.000050139344,0.00004837975,0.96595174,0.0021524618,0.02950287,0.0016561471,0.000015316373],"about_ca_topic_score_codex":0.0042246976,"about_ca_topic_score_gemma":0.0051384675,"teacher_disagreement_score":0.0061886157,"about_ca_system_score_codex":0.0008928899,"about_ca_system_score_gemma":0.0012408025,"threshold_uncertainty_score":0.03272891},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50100607,0.003564223,0.47418457,0.0024482743,0.0004181858,0.00017323768,0.0033346198,0.005167046,0.009703755],"genre_scores_gemma":[0.7617925,0.0010381634,0.22650312,0.0003067006,0.00011326353,0.00010928698,0.0035327564,0.0011239728,0.005480408],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99733704,0.00053900457,0.00020203325,0.00044440854,0.0012249146,0.0002525613],"domain_scores_gemma":[0.97576445,0.009304507,0.0018722136,0.007526483,0.0048256777,0.0007067584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025599613,0.00034882536,0.0006700267,0.003559922,0.0016807482,0.0034161962,0.0015971138,0.0012299347,0.0025984799],"category_scores_gemma":[0.027314827,0.0009357918,0.00042375445,0.00424694,0.0013892449,0.005328228,0.0030614703,0.0017715144,0.0009391396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001493214,0.00025197893,0.117217116,0.00045570216,0.000147494,0.0010952858,0.005573646,0.053345986,0.09397699,0.25400293,0.022754868,0.44968474],"study_design_scores_gemma":[0.00006953613,0.00025529444,0.011856227,0.00018598934,0.00011639671,0.00092054333,0.0018536047,0.65759075,0.0873813,0.18076491,0.05890876,0.000096692194],"about_ca_topic_score_codex":0.0034640983,"about_ca_topic_score_gemma":0.004726025,"teacher_disagreement_score":0.003559922,"about_ca_system_score_codex":0.0012934179,"about_ca_system_score_gemma":0.0017855717,"threshold_uncertainty_score":0.013538539},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09041092,0.0006808632,0.9063251,0.00021435745,0.00031129186,0.000085065054,0.00013099523,0.00086439867,0.0009770747],"genre_scores_gemma":[0.8507737,0.00037465143,0.14542706,0.00012970014,0.00023839789,0.00014801163,0.00049664004,0.000151828,0.0022600063],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990907,0.00022590495,0.0000793769,0.000297565,0.00020724273,0.00009932573],"domain_scores_gemma":[0.99640816,0.0017761826,0.00020993852,0.0005105322,0.0009322609,0.00016290852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029486122,0.0008501869,0.0013840081,0.0009306628,0.00054118305,0.0010994185,0.001504465,0.001031681,0.0012555891],"category_scores_gemma":[0.011073268,0.00049896253,0.0007245091,0.000928139,0.0004253981,0.0019125155,0.0016130981,0.0018425145,0.00050296605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049433386,0.0004746904,0.005818569,0.00010037753,0.00022441676,0.000134531,0.0002191772,0.5409848,0.012509012,0.0040759216,0.0035862671,0.43137783],"study_design_scores_gemma":[0.000004748347,0.000025510157,0.00027746806,0.0000034061518,0.000010890293,0.00001671965,0.000007670913,0.9979949,0.0006909694,0.00076711364,0.00019658738,0.0000039799206],"about_ca_topic_score_codex":0.0027277507,"about_ca_topic_score_gemma":0.0034533662,"teacher_disagreement_score":0.0029486122,"about_ca_system_score_codex":0.00045711632,"about_ca_system_score_gemma":0.0007673228,"threshold_uncertainty_score":0.015593946},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5530398,0.008480536,0.4026006,0.0016971532,0.001194943,0.0008084235,0.003783114,0.011084675,0.017310748],"genre_scores_gemma":[0.8663148,0.00077548,0.12198703,0.00019776692,0.00029266646,0.00017280293,0.003225625,0.0002647767,0.006768985],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984561,0.0006795233,0.00010195906,0.00019516256,0.0004607528,0.00010649429],"domain_scores_gemma":[0.99438864,0.00318289,0.00014497878,0.0003717532,0.0017735963,0.00013816886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011739429,0.0007736418,0.0010771337,0.0027187737,0.0006415393,0.0008016679,0.0007925017,0.00073818513,0.003794057],"category_scores_gemma":[0.009874912,0.0003414944,0.00048574488,0.0016637802,0.00028316246,0.002072193,0.0007205973,0.00056782825,0.0013673017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033465577,0.001325702,0.0051611327,0.0014429408,0.0002417771,0.000915695,0.00050980924,0.07134277,0.09503468,0.0056616333,0.05728664,0.7577307],"study_design_scores_gemma":[0.00013914402,0.0004631045,0.0028621121,0.000041889245,0.00016310102,0.00042440437,0.00015575948,0.962411,0.022708317,0.004592099,0.0059733572,0.000065694585],"about_ca_topic_score_codex":0.0069496017,"about_ca_topic_score_gemma":0.011411237,"teacher_disagreement_score":0.0069496017,"about_ca_system_score_codex":0.000468177,"about_ca_system_score_gemma":0.0011105753,"threshold_uncertainty_score":0.013818324},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7488911,0.002862049,0.23150258,0.0017097077,0.0001899426,0.00066513097,0.0009076453,0.0010196681,0.012252066],"genre_scores_gemma":[0.8211468,0.0006043849,0.17502186,0.00015652373,0.000050221443,0.00011979399,0.00034177868,0.00012372875,0.00243495],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99682766,0.0012418354,0.0002982011,0.00035140282,0.001077861,0.0002030251],"domain_scores_gemma":[0.98818856,0.008824733,0.00049028697,0.0011946588,0.00093383784,0.00036795746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048233243,0.00049691903,0.0007132337,0.0024639843,0.0012903773,0.0027476756,0.0016138371,0.0017481479,0.0023619672],"category_scores_gemma":[0.015088975,0.00030403738,0.0005774141,0.0038298338,0.00096726837,0.001496347,0.0015615313,0.0012674532,0.0005599804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028025238,0.0024296185,0.058853384,0.0012944546,0.00024560496,0.003505618,0.0047236877,0.039165575,0.020144561,0.0144816805,0.007494791,0.84485847],"study_design_scores_gemma":[0.0007540461,0.0016879308,0.05727757,0.0005792035,0.0005214853,0.005999263,0.008313942,0.809901,0.03859159,0.04645682,0.029676523,0.0002405449],"about_ca_topic_score_codex":0.0067946636,"about_ca_topic_score_gemma":0.008932672,"teacher_disagreement_score":0.0067946636,"about_ca_system_score_codex":0.0008258971,"about_ca_system_score_gemma":0.00079678843,"threshold_uncertainty_score":0.025508523},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96588504,0.0010989344,0.021204075,0.0014901928,0.0004255835,0.00004986594,0.0049583362,0.0005363901,0.0043515754],"genre_scores_gemma":[0.99127114,0.00027885614,0.0027517257,0.000057978687,0.00013830062,0.000021164149,0.0030173196,0.0000145740105,0.0024490023],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980766,0.000044245764,0.0000149409025,0.000053843163,0.00003671511,0.00004262311],"domain_scores_gemma":[0.9990133,0.0005674132,0.00012484532,0.00005730955,0.00016814233,0.00006897237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047200805,0.0005982322,0.00046269927,0.0013482993,0.00032437738,0.0007256852,0.00053032197,0.0006372061,0.0020770777],"category_scores_gemma":[0.0025989213,0.00023069493,0.00045342598,0.0009638467,0.00014405642,0.0012919097,0.0006170936,0.0010154379,0.0015175049],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015719314,0.0016182493,0.45703784,0.0002354028,0.00057034317,0.00089979253,0.00044884783,0.16673039,0.009777212,0.0024674179,0.029072804,0.32956973],"study_design_scores_gemma":[0.00000818879,0.000071609924,0.032096665,0.000018357621,0.000049644957,0.000048031445,0.000094121395,0.96412635,0.00100167,0.001496155,0.0009739251,0.000015160769],"about_ca_topic_score_codex":0.008465464,"about_ca_topic_score_gemma":0.019032052,"teacher_disagreement_score":0.008465464,"about_ca_system_score_codex":0.00046504283,"about_ca_system_score_gemma":0.00023068656,"threshold_uncertainty_score":0.016832411},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32804105,0.0071816663,0.60669595,0.0020361205,0.0015982897,0.00074431644,0.020724695,0.025342576,0.007635492],"genre_scores_gemma":[0.6524033,0.0018441293,0.28853577,0.00018880737,0.0017154521,0.0003899742,0.041582108,0.0007864573,0.012553982],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995993,0.00007593518,0.000044835484,0.00009622681,0.00010761034,0.000076136625],"domain_scores_gemma":[0.9990206,0.00028081055,0.00010373842,0.00009949605,0.00041943844,0.00007587958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008231418,0.001083692,0.001035188,0.0033790623,0.0006260596,0.0011067985,0.000594018,0.0006651182,0.0026333542],"category_scores_gemma":[0.0021686605,0.00030033418,0.0008685229,0.0019077283,0.00011392134,0.0012933218,0.00072818465,0.0007238587,0.0028519675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015701,0.00054638606,0.008823134,0.00061207515,0.00038902115,0.00040854208,0.00044397663,0.018421184,0.077559024,0.001260095,0.053128116,0.8368383],"study_design_scores_gemma":[0.00008465598,0.00050023803,0.019140258,0.000049288734,0.00041878526,0.000295105,0.00067904737,0.9171374,0.037067764,0.0032706978,0.021277526,0.000079230565],"about_ca_topic_score_codex":0.003937739,"about_ca_topic_score_gemma":0.008925427,"teacher_disagreement_score":0.003937739,"about_ca_system_score_codex":0.00035193464,"about_ca_system_score_gemma":0.0006037042,"threshold_uncertainty_score":0.008809447},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008510892,0.00008529869,0.98657644,0.000082487444,0.000016037608,0.00015249848,0.00056935305,0.011327648,0.00033913465],"genre_scores_gemma":[0.008371622,0.000105353574,0.986813,0.00007472889,0.000014835636,0.0002515072,0.002558297,0.0011575938,0.0006531152],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99451786,0.0015012696,0.0008601147,0.0011013101,0.0017258163,0.00029362764],"domain_scores_gemma":[0.98950654,0.004948091,0.00055194914,0.0036367797,0.0010250654,0.0003316589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010727702,0.0019997815,0.00196536,0.004961996,0.0012727797,0.004279385,0.0075576096,0.0019288531,0.00573899],"category_scores_gemma":[0.029174712,0.0020868608,0.005298679,0.0046205046,0.0014552618,0.006629773,0.0071326885,0.0035139471,0.0032915806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00097212073,0.00046632788,0.007795957,0.0028745166,0.0015575505,0.0017001,0.0031944495,0.044844314,0.015828226,0.16820666,0.04142951,0.7111303],"study_design_scores_gemma":[0.00018697626,0.00024808486,0.0019161821,0.00090035785,0.0007989649,0.0011037025,0.0007352755,0.5758427,0.035252944,0.21509624,0.16766669,0.00025193757],"about_ca_topic_score_codex":0.0052581504,"about_ca_topic_score_gemma":0.008169355,"teacher_disagreement_score":0.010727702,"about_ca_system_score_codex":0.00082101964,"about_ca_system_score_gemma":0.003106045,"threshold_uncertainty_score":0.056734204},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8224831,0.0022166318,0.16331,0.0005036551,0.00011405995,0.0004872497,0.0025468536,0.0009522738,0.0073861815],"genre_scores_gemma":[0.95305735,0.00061159127,0.04357862,0.000105167244,0.0001372998,0.00015965042,0.00089672813,0.00006386891,0.0013897476],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99989736,0.000028666882,0.0000104366,0.00002524469,0.000022128866,0.000016075757],"domain_scores_gemma":[0.9997763,0.000085776424,0.000043952135,0.000019286881,0.00005963392,0.000015033907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041217628,0.0005515852,0.0002958076,0.0012610363,0.00016747093,0.00047786068,0.0002637777,0.00040564087,0.0019238153],"category_scores_gemma":[0.0014349943,0.00015311294,0.00031633585,0.0005835204,0.00014862943,0.00040214846,0.00021632861,0.00025615926,0.00055682374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002828812,0.0002785026,0.08289273,0.00065842207,0.00076992234,0.0017357444,0.00033916894,0.005342366,0.3580518,0.0014450144,0.0057427553,0.53991485],"study_design_scores_gemma":[0.000220235,0.0010324565,0.66398156,0.00014091773,0.00085617736,0.0097072255,0.000574596,0.21564008,0.094389684,0.007687833,0.005638344,0.00013096278],"about_ca_topic_score_codex":0.000913472,"about_ca_topic_score_gemma":0.0029880193,"teacher_disagreement_score":0.0019238153,"about_ca_system_score_codex":0.00010370825,"about_ca_system_score_gemma":0.00016736382,"threshold_uncertainty_score":0.006435871},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9093139,0.0025185002,0.059256665,0.005722304,0.0002901037,0.00041840877,0.0007091593,0.00021352831,0.021557465],"genre_scores_gemma":[0.97143203,0.00063141756,0.02523927,0.00017619872,0.000098994184,0.00010575529,0.00017914867,0.000045967518,0.0020912339],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962108,0.0026603672,0.00016231307,0.00020815727,0.0005927073,0.00016560979],"domain_scores_gemma":[0.91817284,0.07547711,0.0010557374,0.0020017351,0.0028506364,0.0004419352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007895894,0.00048430864,0.0006922652,0.0013836339,0.00098499,0.0022672573,0.0013113805,0.0028191055,0.0041844905],"category_scores_gemma":[0.03937849,0.000229033,0.00095056155,0.0024567295,0.00075199903,0.0028157737,0.0008149481,0.0015169298,0.0005109473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0067171054,0.007886447,0.10218101,0.0025129148,0.00061608676,0.0069687422,0.003568867,0.34594285,0.008647501,0.07907283,0.019584026,0.4163017],"study_design_scores_gemma":[0.0009560619,0.005321656,0.035659846,0.0003661345,0.00045644506,0.002384471,0.0070668873,0.8769123,0.012978177,0.03763502,0.020099498,0.00016347728],"about_ca_topic_score_codex":0.008760795,"about_ca_topic_score_gemma":0.006684101,"teacher_disagreement_score":0.008760795,"about_ca_system_score_codex":0.0012869359,"about_ca_system_score_gemma":0.0007249439,"threshold_uncertainty_score":0.041758},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07965861,0.001218434,0.9157322,0.000149617,0.00019119469,0.00004249632,0.00049421994,0.0012394646,0.0012736963],"genre_scores_gemma":[0.8595192,0.0013672377,0.13401873,0.00005104905,0.00016239501,0.00007453785,0.0019179285,0.0001529079,0.0027359806],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994979,0.00011887714,0.000056361,0.00012667773,0.00013220373,0.00006797254],"domain_scores_gemma":[0.9983448,0.00071352517,0.000107597545,0.0002942865,0.00045213028,0.00008772297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019299953,0.0007329475,0.0009988943,0.0017578481,0.00038823413,0.0013220834,0.0009315667,0.00066532334,0.002241426],"category_scores_gemma":[0.00562943,0.0003963061,0.00095239765,0.0016269796,0.00025308374,0.0023333905,0.0008752321,0.0010811661,0.00076305924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048856984,0.0001838503,0.00679977,0.00012392002,0.0003113608,0.000106763815,0.00010514829,0.31171122,0.0056571094,0.011305234,0.0036551442,0.65955186],"study_design_scores_gemma":[0.0000050230506,0.000031918025,0.00077809993,0.0000066749776,0.000034919256,0.000025267713,0.000013824071,0.9937996,0.0008217778,0.0038322497,0.00064397097,0.0000066195976],"about_ca_topic_score_codex":0.0047253496,"about_ca_topic_score_gemma":0.0061658705,"teacher_disagreement_score":0.0047253496,"about_ca_system_score_codex":0.00045776754,"about_ca_system_score_gemma":0.0008521492,"threshold_uncertainty_score":0.010206938},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07280083,0.0012064253,0.8675808,0.009386054,0.0009282521,0.0006540363,0.0026777943,0.004828514,0.039937265],"genre_scores_gemma":[0.70842546,0.0005349796,0.27742395,0.0005624261,0.00025641063,0.00027889572,0.002562597,0.00023250202,0.009722802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968913,0.00144486,0.0002120516,0.0003649343,0.0009253094,0.00016159288],"domain_scores_gemma":[0.96414596,0.029496973,0.00090343686,0.0022812798,0.0027258804,0.0004464981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029188583,0.0010047656,0.0005778196,0.002407686,0.0010520302,0.0025612863,0.0020398672,0.0037089211,0.03248779],"category_scores_gemma":[0.05097871,0.00066054816,0.00087339635,0.0011764595,0.00075704005,0.0056620208,0.0019546926,0.0030568298,0.0029151484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001752732,0.0008387161,0.009020448,0.0012642985,0.00034316053,0.0013670775,0.0032431297,0.07647894,0.0035058064,0.4388486,0.06872587,0.39461118],"study_design_scores_gemma":[0.00042204975,0.00016260703,0.0012479974,0.0003099128,0.00026671274,0.00037777636,0.0006992927,0.5814744,0.0029671246,0.38636878,0.02563532,0.00006805518],"about_ca_topic_score_codex":0.004607864,"about_ca_topic_score_gemma":0.0077905743,"teacher_disagreement_score":0.03248779,"about_ca_system_score_codex":0.00089924503,"about_ca_system_score_gemma":0.001524835,"threshold_uncertainty_score":0.10868245},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045447815,0.0032020323,0.9316967,0.009934975,0.0003945428,0.00007549226,0.00097373105,0.002371066,0.0059035704],"genre_scores_gemma":[0.7419568,0.0034350762,0.24577978,0.0017592469,0.00048153105,0.000114351395,0.001505592,0.00035998895,0.0046076803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994259,0.0002594383,0.000030819945,0.000121085155,0.00012599595,0.00003666618],"domain_scores_gemma":[0.9962513,0.0026914305,0.00023835157,0.0004641841,0.0002818269,0.00007292595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001263042,0.0008289669,0.0006703767,0.0012110999,0.00040070582,0.0015656152,0.0010787228,0.00078766444,0.0020190715],"category_scores_gemma":[0.005859169,0.00033548044,0.0008400612,0.0009778808,0.0010231165,0.0042596604,0.0013811081,0.003035775,0.00054181094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020266237,0.0003415588,0.005394567,0.00035826679,0.00044800283,0.00027237623,0.00037839974,0.51249784,0.0077496595,0.17053662,0.013021772,0.28879827],"study_design_scores_gemma":[0.0000069309694,0.000018637798,0.00024729638,0.000015001792,0.000028651759,0.000018693836,0.000023800627,0.8651251,0.0006381892,0.13185419,0.0020113233,0.000012195034],"about_ca_topic_score_codex":0.0077655967,"about_ca_topic_score_gemma":0.014900021,"teacher_disagreement_score":0.0077655967,"about_ca_system_score_codex":0.00085003703,"about_ca_system_score_gemma":0.0010524527,"threshold_uncertainty_score":0.015440762},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85461557,0.0017832194,0.13976806,0.00057162804,0.00013050904,0.00014619192,0.00019723405,0.00031805702,0.002469531],"genre_scores_gemma":[0.9580126,0.00031372646,0.040936407,0.000055241668,0.000059384412,0.00006170933,0.00022625485,0.00007597881,0.00025879167],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9898114,0.0041186246,0.000768271,0.0015710379,0.0033482441,0.00038249488],"domain_scores_gemma":[0.882947,0.09750053,0.0061254622,0.0063347314,0.0060182526,0.0010739132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0144769205,0.0008253405,0.00106036,0.002456373,0.001011576,0.0025809105,0.000873751,0.0011244226,0.0005305763],"category_scores_gemma":[0.07782118,0.00038810069,0.00066532684,0.0013036137,0.001891854,0.0035277524,0.0016755858,0.0013936642,0.0002380791],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034275332,0.00057299825,0.22697556,0.0011093356,0.00046479763,0.001285757,0.004555419,0.19154124,0.03758106,0.009722107,0.003360027,0.51940423],"study_design_scores_gemma":[0.0000633952,0.000859607,0.1044574,0.00030319055,0.00031905776,0.0019426183,0.0030688636,0.7985876,0.06197484,0.022832545,0.0053736153,0.00021721878],"about_ca_topic_score_codex":0.00081820687,"about_ca_topic_score_gemma":0.00089848886,"teacher_disagreement_score":0.0144769205,"about_ca_system_score_codex":0.0007369442,"about_ca_system_score_gemma":0.000432668,"threshold_uncertainty_score":0.076562226},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.077993885,0.0030875786,0.9067494,0.0006652114,0.000501396,0.00023212956,0.0008705195,0.0030939763,0.00680594],"genre_scores_gemma":[0.55184966,0.0014521776,0.4365214,0.00037112355,0.00042892367,0.00015473594,0.0017874462,0.00016734008,0.0072672027],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872106,0.00034165813,0.0000870467,0.00033145954,0.0004012539,0.000117533506],"domain_scores_gemma":[0.9975655,0.00095764216,0.00014506685,0.00048206432,0.00072819466,0.00012153546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001036573,0.0007791218,0.0012825436,0.002945751,0.0009006182,0.0018694948,0.0014126827,0.001427468,0.0012173994],"category_scores_gemma":[0.004359113,0.0005371773,0.0010153513,0.0031857858,0.00035415855,0.0024063704,0.0013708227,0.0013203236,0.001950862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007956031,0.0011549403,0.020150125,0.0005093559,0.0006715321,0.00046083797,0.00062795467,0.03679129,0.057434533,0.010547716,0.023147084,0.8477091],"study_design_scores_gemma":[0.00004239667,0.000116326024,0.0041511375,0.000056497018,0.00019672267,0.00026380498,0.00023266104,0.96610004,0.012883046,0.009205364,0.006678131,0.00007404039],"about_ca_topic_score_codex":0.011483381,"about_ca_topic_score_gemma":0.030310549,"teacher_disagreement_score":0.011483381,"about_ca_system_score_codex":0.0004213483,"about_ca_system_score_gemma":0.00093148113,"threshold_uncertainty_score":0.02283305},"labels":[],"label_agreement":null}]}