{"meta":{"query_hash":"62162c5d4f85","filters":{"venue":"Proceedings - International Conference on Data Engineering"},"cohort_total":10,"direct_labels_cover":0,"predictions_cover":10,"exported":10,"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/62162c5d4f85","api":"https://metacan.xera.ac/api/v1/cohort?venue=Proceedings+-+International+Conference+on+Data+Engineering"},"results":[{"id":"W2096934584","doi":"10.1109/icde.2009.91","title":"Keyword Search over Dynamic Categorized Information","year":2009,"lang":"en","type":"article","venue":"Proceedings - International Conference on Data Engineering","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"ASTER","funders":"","keywords":"Computer science; Categorization; Focus (optics); Information retrieval; Keyword search; Data mining; Contrast (vision); Artificial intelligence","score_opus":0.03711792081511415,"score_gpt":0.2881913891656117,"score_spread":0.25107346835049754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096934584","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.36861232,0.006633928,0.60408664,0.001147796,0.00017282012,0.0005379022,0.0048176493,0.007450863,0.0065401075],"genre_scores_gemma":[0.77593446,0.0008623524,0.21651292,0.00024151582,0.00008541222,0.00018560588,0.003873834,0.00014029628,0.0021636882],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964394,0.0006163516,0.00048506467,0.00092359155,0.0011167937,0.00041867365],"domain_scores_gemma":[0.98878646,0.005558055,0.0012963625,0.0022206865,0.0017176485,0.00042084153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020588778,0.00094494177,0.002372018,0.005527687,0.0008768301,0.0031240568,0.0028255144,0.0014428317,0.0015725543],"category_scores_gemma":[0.015576662,0.0007467285,0.00077773794,0.009586702,0.0008025465,0.005865124,0.0026307967,0.0006549562,0.0013744936],"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.0050280257,0.00069173303,0.02687939,0.00291496,0.0006131736,0.004287046,0.0030581544,0.17092027,0.086074874,0.037322644,0.014934382,0.64727527],"study_design_scores_gemma":[0.00019294578,0.0008861517,0.0041889013,0.00012342336,0.000237883,0.002872994,0.0013183804,0.8620007,0.047544297,0.06514835,0.015312782,0.00017327396],"about_ca_topic_score_codex":0.0043084812,"about_ca_topic_score_gemma":0.003951457,"teacher_disagreement_score":0.005527687,"about_ca_system_score_codex":0.0013747514,"about_ca_system_score_gemma":0.0016467951,"threshold_uncertainty_score":0.010888517},"labels":[],"label_agreement":null},{"id":"W2101810678","doi":"10.1109/icde.2009.105","title":"On Efficient Recommendations for Online Exchange Markets","year":2009,"lang":"en","type":"article","venue":"Proceedings - International Conference on Data Engineering","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Popularity; Database transaction; Focus (optics); Social network (sociolinguistics); Probabilistic logic; Value (mathematics); User modeling; World Wide Web; Class (philosophy); Recommender system; User interface; Social media; Database; Artificial intelligence; Machine learning","score_opus":0.11157168128214941,"score_gpt":0.34177713795701203,"score_spread":0.23020545667486264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101810678","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.033069395,0.0022041348,0.94506973,0.0020503907,0.0001889311,0.000961283,0.0024776224,0.0016321172,0.012346437],"genre_scores_gemma":[0.22747618,0.0020315899,0.7483399,0.0008166627,0.00034926028,0.0011405406,0.004897848,0.0003813678,0.014566654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947519,0.001965279,0.0003580459,0.0011334756,0.0010765656,0.00071479985],"domain_scores_gemma":[0.97673064,0.018548805,0.0009971347,0.0018675161,0.0013480932,0.0005078701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049201264,0.0030313449,0.005470948,0.002819482,0.0022279222,0.0042206934,0.006148966,0.005419899,0.017778274],"category_scores_gemma":[0.028098883,0.0023259304,0.002358176,0.008330872,0.0017599654,0.010088701,0.002996592,0.0048588905,0.0040117353],"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.00043818867,0.00061925146,0.001679274,0.00063381874,0.00017813109,0.0002752532,0.00038243816,0.72774875,0.000908989,0.07931943,0.02555072,0.16226573],"study_design_scores_gemma":[0.00015187937,0.00007540798,0.00021017279,0.00004996766,0.00003276181,0.00008850609,0.00013421048,0.9059875,0.0003123719,0.08908823,0.003851856,0.000017059694],"about_ca_topic_score_codex":0.012428175,"about_ca_topic_score_gemma":0.017674912,"teacher_disagreement_score":0.017778274,"about_ca_system_score_codex":0.003451732,"about_ca_system_score_gemma":0.0033053916,"threshold_uncertainty_score":0.05947429},"labels":[],"label_agreement":null},{"id":"W2111984440","doi":"10.1109/icde.2009.131","title":"Query Rewrites with Views for XML in DB2","year":2009,"lang":"en","type":"article","venue":"Proceedings - International Conference on Data Engineering","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); Microsoft (Canada); York University","funders":"","keywords":"Computer science; XML database; Streaming XML; XQuery; Efficient XML Interchange; XML validation; XML Schema Editor; XML Encryption; Information retrieval; Document Structure Description; Database; XML; World Wide Web","score_opus":0.08982055515052091,"score_gpt":0.3150799005651456,"score_spread":0.22525934541462472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111984440","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.008375889,0.0005841897,0.963706,0.00072251714,0.0002630015,0.0002606307,0.00080816395,0.015632715,0.009646866],"genre_scores_gemma":[0.10608414,0.00058450364,0.86929697,0.0015491025,0.0002131609,0.00036967229,0.0038895125,0.004418345,0.01359464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99292386,0.0016327985,0.00085328816,0.000984857,0.0030107382,0.00059447694],"domain_scores_gemma":[0.9969273,0.00092725444,0.00013883847,0.0012248767,0.0006557256,0.00012595684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004277022,0.00082227116,0.0008098365,0.0009738801,0.000980174,0.0041620187,0.0024086724,0.001026127,0.008040129],"category_scores_gemma":[0.006852242,0.0009003188,0.002206154,0.0012389076,0.0018177036,0.0056036613,0.0033043188,0.0035170205,0.0033285206],"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.00085287367,0.00033904825,0.002275905,0.0005432996,0.00018992762,0.00087815616,0.0020923933,0.01969993,0.031529814,0.61704606,0.058034156,0.26651856],"study_design_scores_gemma":[0.00030490203,0.00034561494,0.00089670275,0.00019998214,0.00019626849,0.0010330415,0.00080173404,0.19676995,0.087138265,0.26294538,0.449128,0.0002401638],"about_ca_topic_score_codex":0.009012823,"about_ca_topic_score_gemma":0.00821289,"teacher_disagreement_score":0.009012823,"about_ca_system_score_codex":0.0014867393,"about_ca_system_score_gemma":0.0019187097,"threshold_uncertainty_score":0.026896894},"labels":[],"label_agreement":null},{"id":"W2116316066","doi":"10.1109/icde.2009.157","title":"Mining of Frequent Itemsets from Streams of Uncertain Data","year":2009,"lang":"en","type":"article","venue":"Proceedings - International Conference on Data Engineering","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":97,"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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Data stream mining; Data mining; Database transaction; Uncertain data; Flood myth; Tree (set theory); Transaction data; Database; Mathematics","score_opus":0.11409841460705344,"score_gpt":0.32357743779976694,"score_spread":0.2094790231927135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116316066","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.08341703,0.0010155215,0.9126935,0.0003912872,0.000086216154,0.00021186964,0.0011834125,0.0004655737,0.00053566816],"genre_scores_gemma":[0.48404828,0.0011401793,0.5100845,0.00012513115,0.00017783645,0.00033055502,0.0036602893,0.000048949376,0.00038422915],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99661213,0.0007514214,0.0006709694,0.0006062409,0.0011285595,0.00023067278],"domain_scores_gemma":[0.98590904,0.009822315,0.0015314382,0.00084514543,0.0016365069,0.0002556141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030915341,0.0009749802,0.0021268083,0.004329746,0.0010757538,0.0020960446,0.0017361871,0.001558174,0.00044299394],"category_scores_gemma":[0.019183,0.00060643913,0.0015260144,0.004682029,0.00052393746,0.0033179214,0.0011571276,0.0011443387,0.00030139004],"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.0015785302,0.00054892857,0.049124587,0.0011417557,0.0010430269,0.0064692027,0.0015967367,0.3677591,0.01634936,0.020132782,0.005882692,0.52837324],"study_design_scores_gemma":[0.00004323221,0.00013283176,0.0029181144,0.00007636431,0.00010899996,0.0010097004,0.00037009266,0.96316165,0.0052155484,0.024777256,0.002141156,0.0000451528],"about_ca_topic_score_codex":0.0012354184,"about_ca_topic_score_gemma":0.0010858523,"teacher_disagreement_score":0.004329746,"about_ca_system_score_codex":0.00048715447,"about_ca_system_score_gemma":0.0009031977,"threshold_uncertainty_score":0.016349792},"labels":[],"label_agreement":null},{"id":"W2142712680","doi":"10.1109/icde.2009.124","title":"Join Reordering by Join Simulation","year":2009,"lang":"en","type":"article","venue":"Proceedings - International Conference on Data Engineering","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Join (topology); Computer science; Pipeline (software); Pipeline transport; Cardinality (data modeling); Parallel computing; Path (computing); Distributed computing; Data mining; Programming language","score_opus":0.05346340745751707,"score_gpt":0.3007754703162046,"score_spread":0.24731206285868754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142712680","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.012422465,0.00009873167,0.9832145,0.00009404748,0.000027646849,0.0001190586,0.00012842489,0.002958275,0.0009368641],"genre_scores_gemma":[0.27579206,0.00018445497,0.7207123,0.00010361621,0.000052433672,0.00035435308,0.0005678731,0.0008067626,0.0014261483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99577445,0.0013872681,0.00027814723,0.00062359526,0.0015892158,0.00034729298],"domain_scores_gemma":[0.98915905,0.0057743145,0.0007799355,0.0027923987,0.001149935,0.00034439797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00515966,0.000958153,0.0012618707,0.0012543866,0.0009943779,0.002208371,0.0034046713,0.0012649941,0.0029572784],"category_scores_gemma":[0.016445676,0.0010311853,0.0016155167,0.0011253646,0.0010469566,0.003030917,0.00219982,0.0023981598,0.0006160041],"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.00022835928,0.00010826555,0.0028965739,0.000085385436,0.00007885708,0.00009723232,0.00022692361,0.9101412,0.0059387633,0.03723746,0.0017097995,0.04125111],"study_design_scores_gemma":[0.000014178364,0.000028374243,0.00008370506,0.0000046104874,0.000009129489,0.000020758862,0.0000096687945,0.98944104,0.0019144628,0.006699363,0.0017633704,0.00001135295],"about_ca_topic_score_codex":0.0075051165,"about_ca_topic_score_gemma":0.0070400224,"teacher_disagreement_score":0.0075051165,"about_ca_system_score_codex":0.0013147164,"about_ca_system_score_gemma":0.0031291246,"threshold_uncertainty_score":0.027287245},"labels":[],"label_agreement":null},{"id":"W2159957898","doi":"10.1109/icde.2009.173","title":"Improving the Effectiveness of XML Retrieval with User Navigation Models","year":2009,"lang":"en","type":"article","venue":"Proceedings - International Conference on Data Engineering","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Information retrieval; XML; Ranking (information retrieval); Markup language; XML Schema (W3C); Document Structure Description; XML database; XML framework; Relevance (law); Search engine; XML validation; Key (lock); Data mining; Database; XML Signature; World Wide Web","score_opus":0.032577268319563535,"score_gpt":0.26186568050244985,"score_spread":0.22928841218288631,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159957898","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.42020243,0.004370715,0.55352837,0.0008256774,0.00011265504,0.0005216509,0.00030412196,0.014251506,0.0058829687],"genre_scores_gemma":[0.6754262,0.0007305246,0.3208506,0.00015520827,0.00010130598,0.00012363984,0.0005419453,0.00033932657,0.0017313305],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9913549,0.00440307,0.0009165717,0.00075764355,0.0022486332,0.00031919937],"domain_scores_gemma":[0.96220535,0.028120212,0.0017678658,0.0036662451,0.003929857,0.00031054142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0100063635,0.001601443,0.002157737,0.003729124,0.00079407677,0.0030360247,0.0016330656,0.0023606531,0.0013232133],"category_scores_gemma":[0.045916885,0.00062110624,0.0011072055,0.002520797,0.0007038859,0.0074168537,0.0016487286,0.001264387,0.0013065086],"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.002459848,0.0014895181,0.015711999,0.00090529607,0.00038736337,0.00013819707,0.00060680654,0.11236639,0.0336543,0.004239967,0.0043350942,0.82370526],"study_design_scores_gemma":[0.00015793747,0.0011130983,0.00449206,0.000049169,0.00027618802,0.00029858205,0.0001980041,0.9534907,0.033571273,0.0034993077,0.0027342904,0.00011943322],"about_ca_topic_score_codex":0.0054768687,"about_ca_topic_score_gemma":0.0056947586,"teacher_disagreement_score":0.0100063635,"about_ca_system_score_codex":0.0009711342,"about_ca_system_score_gemma":0.001742039,"threshold_uncertainty_score":0.052919388},"labels":[],"label_agreement":null},{"id":"W2168592511","doi":"10.1109/icde.2009.39","title":"PSALM: Cardinality Estimation in the Presence of Fine-Grained Access Controls","year":2009,"lang":"en","type":"article","venue":"Proceedings - International Conference on Data Engineering","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Tuple; Cardinality (data modeling); Computer science; Exploit; Access control; Process (computing); Data access; Database; Information retrieval; Data mining; Theoretical computer science; Computer security; Mathematics; Programming language","score_opus":0.07268246504518185,"score_gpt":0.33779392153745974,"score_spread":0.2651114564922779,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168592511","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.032159436,0.0002255292,0.96515775,0.00014337903,0.000022736298,0.00006892699,0.00017034037,0.0016673271,0.000384427],"genre_scores_gemma":[0.57285005,0.00027143865,0.42495304,0.00013001269,0.00012583032,0.00020067973,0.00067357294,0.00019695934,0.00059834676],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9906784,0.0028644842,0.0007827502,0.0014286018,0.0036183512,0.00062737777],"domain_scores_gemma":[0.9524433,0.032006785,0.00408492,0.008212241,0.0025378787,0.00071491505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006822181,0.0008132748,0.0014553901,0.0022261145,0.00078937237,0.0022704026,0.0023122851,0.0013200728,0.0007967071],"category_scores_gemma":[0.048806194,0.00081187405,0.0007298211,0.002437892,0.0014576585,0.005916325,0.0029520066,0.0022166143,0.00037886755],"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.0013235796,0.00039264772,0.038736522,0.00037473408,0.00026472763,0.00064212887,0.001231311,0.52772933,0.041186877,0.0466651,0.0053998153,0.3360532],"study_design_scores_gemma":[0.000014091237,0.000045809,0.0010814352,0.000011265026,0.000011422352,0.00015287894,0.000052807205,0.981619,0.005272011,0.01078626,0.0009325743,0.000020459736],"about_ca_topic_score_codex":0.003808494,"about_ca_topic_score_gemma":0.002702204,"teacher_disagreement_score":0.006822181,"about_ca_system_score_codex":0.0011838333,"about_ca_system_score_gemma":0.0016931591,"threshold_uncertainty_score":0.036079586},"labels":[],"label_agreement":null},{"id":"W2169872697","doi":"10.1109/icde.2009.70","title":"Online Interval Skyline Queries on Time Series","year":2009,"lang":"en","type":"article","venue":"Proceedings - International Conference on Data Engineering","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"SFU Community Trust Endowment Fund; Natural Sciences and Engineering Research Council of Canada; Simon Fraser University","keywords":"Skyline; Interval (graph theory); Computer science; Series (stratigraphy); Set (abstract data type); Time series; Data mining; Time complexity; On the fly; Space (punctuation); Algorithm; Mathematics; Combinatorics; Machine learning","score_opus":0.04585186737646731,"score_gpt":0.27924077977895334,"score_spread":0.23338891240248602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169872697","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.08528644,0.0013055592,0.8950356,0.0008225484,0.000103290346,0.00023062728,0.0046455776,0.009826737,0.0027435166],"genre_scores_gemma":[0.5262347,0.0006499725,0.46175787,0.00021228117,0.00028651766,0.00024803416,0.008314458,0.000617063,0.0016791805],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971794,0.00054594554,0.0003718765,0.0007180875,0.001025435,0.00015934878],"domain_scores_gemma":[0.9901426,0.005266715,0.0009459383,0.002457455,0.0008738514,0.00031346225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022841871,0.0010617388,0.001757981,0.0024715178,0.00070310186,0.0025144746,0.0018136814,0.0011142917,0.0037367353],"category_scores_gemma":[0.016905973,0.0005506423,0.0010071626,0.005003792,0.0005973382,0.007434581,0.0020493115,0.0011457768,0.0012201669],"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.0027239814,0.00051825924,0.015773278,0.0013033608,0.00043758744,0.0011420024,0.0025778138,0.156122,0.0586143,0.080068804,0.043307405,0.6374112],"study_design_scores_gemma":[0.00016493772,0.0003128713,0.003003046,0.00005151886,0.00007661828,0.0006654449,0.0007551129,0.87189555,0.020268098,0.07833466,0.024411099,0.00006120169],"about_ca_topic_score_codex":0.001780238,"about_ca_topic_score_gemma":0.0021469726,"teacher_disagreement_score":0.0037367353,"about_ca_system_score_codex":0.0006872444,"about_ca_system_score_gemma":0.00064668665,"threshold_uncertainty_score":0.012500644},"labels":[],"label_agreement":null},{"id":"W2170138277","doi":"10.1109/icde.2009.59","title":"GuruMine: A Pattern Mining System for Discovering Leaders and Tribes","year":2009,"lang":"en","type":"article","venue":"Proceedings - International Conference on Data Engineering","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Set (abstract data type); Social media; Process (computing); Social network (sociolinguistics); Interface (matter); World Wide Web; Graphical user interface; Data science; Information retrieval","score_opus":0.0736423980785224,"score_gpt":0.29960727302705753,"score_spread":0.22596487494853512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170138277","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.008260519,0.0005291521,0.80547535,0.0006322567,0.00022889594,0.0004604648,0.0142383035,0.16441616,0.0057588136],"genre_scores_gemma":[0.051776007,0.0004921566,0.9065801,0.00058133714,0.000056438967,0.0007220572,0.028200852,0.0041767615,0.0074143],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904484,0.00015987511,0.00011116381,0.0003390743,0.0002781287,0.000066948895],"domain_scores_gemma":[0.9983937,0.0006507901,0.00014851979,0.0004540057,0.00024057049,0.000112458234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015110257,0.0014081327,0.0012047953,0.0033813287,0.0009924127,0.0021650016,0.0027274056,0.0010056769,0.010097829],"category_scores_gemma":[0.006025306,0.00092825084,0.0012196754,0.0024094046,0.0005293932,0.0042017866,0.0025754073,0.0014281219,0.0057379236],"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.0013239965,0.00035505145,0.017130136,0.0018647755,0.00040215495,0.0015781953,0.0015803069,0.020657077,0.015351709,0.036896944,0.26239994,0.6404598],"study_design_scores_gemma":[0.0003154965,0.0002546967,0.00662839,0.00032024278,0.00015014244,0.0015333636,0.00055644143,0.51337063,0.026569905,0.0705538,0.37955278,0.00019399473],"about_ca_topic_score_codex":0.0036131057,"about_ca_topic_score_gemma":0.0067173173,"teacher_disagreement_score":0.010097829,"about_ca_system_score_codex":0.0007663406,"about_ca_system_score_gemma":0.0010797257,"threshold_uncertainty_score":0.033780634},"labels":[],"label_agreement":null},{"id":"W2170896764","doi":"10.1109/icde.2009.102","title":"Ranking with Uncertain Scores","year":2009,"lang":"en","type":"article","venue":"Proceedings - International Conference on Data Engineering","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Ranking (information retrieval); Computer science; Rank (graph theory); Data mining; Set (abstract data type); Uncertain data; Probabilistic logic; Learning to rank; Semantics (computer science); Information retrieval; Ranking SVM; Sampling (signal processing); Machine learning; Artificial intelligence; Mathematics","score_opus":0.05920357991017572,"score_gpt":0.27934363750450186,"score_spread":0.22014005759432614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170896764","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.052650277,0.0005954988,0.94322836,0.000473721,0.00005152548,0.00015934175,0.00047135714,0.00060834346,0.0017614883],"genre_scores_gemma":[0.5306363,0.00061665126,0.4633922,0.00018608246,0.00021938872,0.00025964773,0.0015581809,0.00017705122,0.0029544525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98605865,0.005429043,0.0010333307,0.0017415601,0.005046347,0.00069112045],"domain_scores_gemma":[0.97359055,0.016288076,0.0019404794,0.004793686,0.0028117662,0.00057548395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008682693,0.0011523833,0.0026845005,0.0030308303,0.001158447,0.0048771068,0.0023135648,0.0014738322,0.0026394501],"category_scores_gemma":[0.036935262,0.0007905192,0.0013252831,0.0057229106,0.0013586637,0.007116942,0.0022949053,0.0016595671,0.0009380834],"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.0009446207,0.00029900108,0.009777337,0.00051658024,0.000298607,0.00042002465,0.00057930266,0.48709315,0.006014702,0.158277,0.0069545396,0.32882512],"study_design_scores_gemma":[0.000052007385,0.0002448764,0.0013144049,0.000031919255,0.000060406073,0.00031568555,0.0001839275,0.8849777,0.0031989254,0.105799355,0.0037569671,0.00006383233],"about_ca_topic_score_codex":0.002582267,"about_ca_topic_score_gemma":0.0036294677,"teacher_disagreement_score":0.008682693,"about_ca_system_score_codex":0.0019021165,"about_ca_system_score_gemma":0.0016675362,"threshold_uncertainty_score":0.04591906},"labels":[],"label_agreement":null}]}