{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":8,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":8,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"73559aed91bd","filters":{"venue":"AI Communications"}},"results":[{"id":"W1788316346","doi":"","title":"Systematic versus non systematic techniques for solving temporal constraints in a dynamic environment","year":2004,"lang":"en","type":"article","venue":"AI Communications","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Constraint (computer-aided design); Mathematical optimization; Local consistency; Completeness (order theory); Constraint learning; Binary constraint; Process (computing); Constraint satisfaction; Constraint logic programming; Artificial intelligence; Mathematics; Probabilistic logic","authors":[{"name":"Malek Mouhoub","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01922572259618298,"gpt":0.2832288327520398,"spread":0.2640031101558568,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002651036,0.0009688349,0.0007541584,0.001097698,0.0005711698,0.001098604,0.001544453,0.001097193,0.002835602],"category_scores_gemma":[0.01020809,0.0007831193,0.001174552,0.001683963,0.001630996,0.001782505,0.001433422,0.00143397,0.0004051597],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007607086,"about_ca_system_score_gemma":0.002182503,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002227437,"about_ca_topic_score_gemma":0.005975839,"domain_scores_codex":[0.9974044,0.001168971,0.0001480139,0.0002136158,0.0009555144,0.000109458],"domain_scores_gemma":[0.9927984,0.005376563,0.0007012323,0.0007599185,0.0002980399,0.0000658423],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000943948,0.0001536023,0.001375251,0.001061464,0.0002109798,0.000202546,0.0006689518,0.5455874,0.01394538,0.1253867,0.001403713,0.3099097],"study_design_scores_gemma":[0.00004677749,0.0001336652,0.0003884432,0.0001040863,0.00006455497,0.0002638802,0.0001763981,0.9385065,0.006542505,0.04867584,0.005069997,0.00002737854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003140908,0.0001407184,0.9958907,0.0000579215,0.000004778251,0.00006453746,0.00001278512,0.0001134922,0.0005740149],"genre_scores_gemma":[0.06471937,0.0005375315,0.9336829,0.00005311609,0.00001246449,0.0002683134,0.00007371999,0.00007601341,0.0005766316],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002835602,"threshold_uncertainty_score":0.0140202,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2139801213","doi":"10.3233/aic-140605","title":"Automatic move pruning for single-agent search","year":2014,"lang":"en","type":"article","venue":"AI Communications","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Pruning; Artificial intelligence; Machine learning; Information retrieval","authors":[{"name":"Robert C. Holte","is_ca":true},{"name":"Neil Burch","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08222466232108644,"gpt":0.3340013739461056,"spread":0.2517767116250191,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001121337,0.0008023863,0.0008763787,0.00117966,0.001179904,0.0009614066,0.001812489,0.001214404,0.004044607],"category_scores_gemma":[0.005395915,0.000558191,0.0007168566,0.001096868,0.0009532279,0.001709069,0.001899086,0.001650542,0.0009706648],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006238311,"about_ca_system_score_gemma":0.001505356,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002967439,"about_ca_topic_score_gemma":0.006324597,"domain_scores_codex":[0.9986227,0.0003898967,0.00007794343,0.0001912201,0.0005627114,0.0001554905],"domain_scores_gemma":[0.9976454,0.001379993,0.0001596746,0.000489821,0.0002601529,0.00006493757],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005697672,0.000251762,0.001218009,0.0004654719,0.0001153489,0.0005466808,0.0003000931,0.4065681,0.02180267,0.07620978,0.01240977,0.4795426],"study_design_scores_gemma":[0.00007788743,0.00007995469,0.0002516197,0.00003793777,0.00002853628,0.0001044738,0.00003075023,0.9494558,0.006390272,0.03821167,0.005314274,0.00001689623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03105691,0.0005438452,0.9572527,0.0002317233,0.00007330045,0.0002320519,0.0001753729,0.003205969,0.007228127],"genre_scores_gemma":[0.3656181,0.0003219263,0.6287388,0.0001565551,0.00004313702,0.0005147783,0.0005695634,0.0003423712,0.003694782],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004044607,"threshold_uncertainty_score":0.01353049,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1923876550","doi":"10.3233/aic-2010-0456","title":"Practical reasoning with qualified number restrictions: A hybrid Abox calculus for the description logic 𝒮ℋ𝒬","year":2010,"lang":"en","type":"article","venue":"AI Communications","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Semantic reasoner; Axiom; Satisfiability; Consistency (knowledge bases); Answer set programming; Calculus (dental); Set (abstract data type); Theoretical computer science; Programming language; Mathematics; Artificial intelligence","authors":[{"name":"Nasim Farsiniamarj","is_ca":false},{"name":"Volker Haarslev","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09288807929691535,"gpt":0.3745368120801877,"spread":0.2816487327832723,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003415151,0.0005231009,0.0006550914,0.00109148,0.001627557,0.00337913,0.002132637,0.001202781,0.003809972],"category_scores_gemma":[0.003305365,0.000740753,0.001908209,0.0009694721,0.004049765,0.007291204,0.003037611,0.002206544,0.0005604075],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001974082,"about_ca_system_score_gemma":0.001748889,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005194974,"about_ca_topic_score_gemma":0.005073919,"domain_scores_codex":[0.9978954,0.000595531,0.0001660383,0.0003086167,0.000821148,0.0002132547],"domain_scores_gemma":[0.9981687,0.001084256,0.00008116871,0.0003246337,0.0002210971,0.0001201621],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001819267,0.00001439663,0.0001004289,0.00003446315,0.00001255911,0.000131024,0.0003280796,0.00329331,0.001182929,0.9849789,0.0006901661,0.009215481],"study_design_scores_gemma":[0.00004317512,0.000025025,0.00007860911,0.00003321102,0.0000433298,0.0001600869,0.000129729,0.04842363,0.002483187,0.9271407,0.02140054,0.00003884381],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008294542,0.0001433918,0.9833369,0.0004110335,0.00008986591,0.00005762244,0.00009908279,0.0003454792,0.007222179],"genre_scores_gemma":[0.2748989,0.000342643,0.7161778,0.0003557008,0.0001315422,0.0001647984,0.0002567433,0.0001383099,0.007533499],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005194974,"threshold_uncertainty_score":0.01806128,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2895868736","doi":"10.3233/aic-170537","title":"Performance robustness of AI planners in the 2014 International Planning Competition","year":2018,"lang":"en","type":"article","venue":"AI Communications","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Compute Canada","keywords":"Agile software development; Solver; Computer science; Robustness (evolution); Software; Benchmark (surveying); Competition (biology); Homogeneous; Software engineering; Operating system","authors":[{"name":"Andrea F. Bocchese","is_ca":false},{"name":"Chris Fawcett","is_ca":true},{"name":"Mauro Vallati","is_ca":false},{"name":"Alfonso Gerevini","is_ca":false},{"name":"Holger H. Hoos","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06033374970487245,"gpt":0.3527300751938626,"spread":0.2923963254889901,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007297532,0.001197313,0.0009855654,0.001729228,0.001131337,0.002583896,0.001614264,0.001405246,0.004526457],"category_scores_gemma":[0.02548354,0.000565248,0.001025413,0.001914252,0.001653791,0.002060873,0.002369245,0.002167651,0.000926083],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003461957,"about_ca_system_score_gemma":0.004767125,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02604051,"about_ca_topic_score_gemma":0.03099045,"domain_scores_codex":[0.995154,0.00158079,0.0002799375,0.0009595832,0.001118772,0.0009068521],"domain_scores_gemma":[0.9888697,0.006645857,0.0006082974,0.001208892,0.001370682,0.001296527],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002528703,0.000731581,0.01949255,0.0003905089,0.0004114629,0.0001509444,0.0002929774,0.86488,0.001633838,0.0113044,0.02973451,0.06844842],"study_design_scores_gemma":[0.0007575862,0.001801134,0.02435158,0.0001402578,0.0001546203,0.0001636648,0.001127056,0.928846,0.004635922,0.0184321,0.01948673,0.0001033778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9308769,0.001552115,0.01087743,0.00188288,0.0004540254,0.0001701148,0.003965874,0.002022245,0.04819842],"genre_scores_gemma":[0.9736465,0.0003312524,0.01281846,0.0003028189,0.00005574154,0.0001318129,0.009124649,0.0003265186,0.003262345],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02604051,"threshold_uncertainty_score":0.0517779,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3084274250","doi":"10.3233/aic-200630","title":"Empirical scaling analyzer: An automated system for empirical analysis of performance scaling","year":2020,"lang":"en","type":"article","venue":"AI Communications","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Scaling; Function (biology); Empirical research; Algorithm; Key (lock); Spectrum analyzer; Data mining; Statistics; Mathematics","authors":[{"name":"Yasha Pushak","is_ca":true},{"name":"Zongxu Mu","is_ca":true},{"name":"Holger H. Hoos","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1187793596545258,"gpt":0.4134381074534665,"spread":0.2946587477989407,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01227273,0.003285351,0.00202328,0.006447839,0.0008979637,0.003715854,0.003220895,0.001720117,0.01160895],"category_scores_gemma":[0.08095558,0.001584142,0.001370658,0.003690298,0.001297756,0.005979457,0.003698102,0.00459256,0.006982934],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001232889,"about_ca_system_score_gemma":0.00340311,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002075383,"about_ca_topic_score_gemma":0.001800403,"domain_scores_codex":[0.9867415,0.00376115,0.001607768,0.002327994,0.004955601,0.0006060974],"domain_scores_gemma":[0.9061289,0.04864775,0.006347018,0.02564092,0.01172661,0.001508794],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001879578,0.001796855,0.04128982,0.001522289,0.0007307284,0.0007574743,0.001855434,0.07160592,0.03781154,0.04480327,0.1562149,0.6397322],"study_design_scores_gemma":[0.0002166332,0.000288686,0.009451875,0.0001532527,0.0000573052,0.0002668254,0.0002347665,0.902712,0.02727017,0.03409714,0.02503243,0.0002189699],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02376612,0.0002448763,0.7337214,0.0003503974,0.0001900741,0.0006357084,0.004099729,0.2322445,0.004747104],"genre_scores_gemma":[0.3117428,0.0003403585,0.6419358,0.0005874508,0.0002577299,0.003491359,0.00983176,0.02878898,0.003023806],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01227273,"threshold_uncertainty_score":0.06490517,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1587152077","doi":"10.3233/aic-140603","title":"Towards a theory of random walk planning: Regress factors, fair homogeneous graphs and extensions","year":2014,"lang":"en","type":"article","venue":"AI Communications","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Random walk; Computer science; Satisficing; Branching (polymer chemistry); Homogeneous; Graph; Theoretical computer science; Mathematics; Artificial intelligence; Statistics; Combinatorics","authors":[{"name":"Hootan Nakhost","is_ca":true},{"name":"Martin Müller","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03477795111232695,"gpt":0.2789651577715677,"spread":0.2441872066592407,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00375319,0.001381788,0.001322786,0.002491145,0.001227439,0.002963611,0.002752938,0.002418522,0.009393827],"category_scores_gemma":[0.01441882,0.001154045,0.002119281,0.002903855,0.005336342,0.008616012,0.003429397,0.005496232,0.001587432],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002865442,"about_ca_system_score_gemma":0.0028271,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007093493,"about_ca_topic_score_gemma":0.007086732,"domain_scores_codex":[0.9978632,0.0009545278,0.0000985072,0.0004494782,0.0004529693,0.0001812481],"domain_scores_gemma":[0.9913982,0.005720659,0.0005512951,0.001091673,0.0007933026,0.000444856],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001075006,0.00001997524,0.0001220611,0.00003553437,0.00001198129,0.00002425439,0.00006736618,0.04418459,0.00009936895,0.9461278,0.001268788,0.008027682],"study_design_scores_gemma":[0.000004550403,0.000008327832,0.00003227332,0.00001656816,0.000005601662,0.000009466451,0.00001405971,0.08754774,0.00005578922,0.9107676,0.001531006,0.000007020687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003979957,0.0005082568,0.9848511,0.001008311,0.00005618783,0.00003103073,0.00009948116,0.0001650528,0.009300659],"genre_scores_gemma":[0.416385,0.004199276,0.5473762,0.001502397,0.0008930684,0.000604549,0.0006002263,0.0006761304,0.02776325],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009393827,"threshold_uncertainty_score":0.03142554,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1958457774","doi":"10.3233/aic-2010-0487","title":"On the use of machine learning methods for modern drug discovery","year":2011,"lang":"en","type":"article","venue":"AI Communications","topic":"Computational Drug Discovery Methods","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Drug discovery; Artificial intelligence; Machine learning; Data science; Bioinformatics","authors":[{"name":"Axel J. Soto","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2265887255451752,"gpt":0.4043587369984684,"spread":0.1777700114532932,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00551673,0.001781748,0.001515504,0.002711052,0.001017389,0.003710899,0.001951765,0.003023652,0.008376813],"category_scores_gemma":[0.01274449,0.00065389,0.001214791,0.00299761,0.006458791,0.006823309,0.004336549,0.006424744,0.005056809],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001145134,"about_ca_system_score_gemma":0.001113051,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001236234,"about_ca_topic_score_gemma":0.0009536957,"domain_scores_codex":[0.9951343,0.001927611,0.0002083915,0.0004765803,0.002098542,0.0001544644],"domain_scores_gemma":[0.9863756,0.01142274,0.0002661411,0.00106092,0.0007381164,0.0001365723],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009702663,0.0001166075,0.0005836217,0.001287423,0.0001171204,0.000174019,0.0002311235,0.0159305,0.001396112,0.6591475,0.02232946,0.2985895],"study_design_scores_gemma":[0.00003366344,0.0001162757,0.0004854985,0.001214157,0.00004365744,0.0001688718,0.00006025778,0.03924123,0.00146321,0.7777002,0.1793817,0.00009132305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005737345,0.2726643,0.5931155,0.03446392,0.003656006,0.0001656868,0.000406204,0.0005187242,0.08927236],"genre_scores_gemma":[0.1340084,0.4481618,0.3565884,0.0124293,0.01588986,0.0004240456,0.0006118052,0.0004452247,0.03144129],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008376813,"threshold_uncertainty_score":0.02917558,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2159458954","doi":"10.3233/aic-140620","title":"Features extraction based on the Discrete Hartley Transform for closed contour","year":2015,"lang":"en","type":"article","venue":"AI Communications","topic":"Image Retrieval and Classification Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"University of Victoria","keywords":"Computer science; Extraction (chemistry); Artificial intelligence; Discrete Hartley transform; Computer vision; Pattern recognition (psychology); Fourier transform; Mathematics; Fractional Fourier transform; Chromatography","authors":[{"name":"Pere Martí-Puig","is_ca":false},{"name":"Ramón Reig-Bolaño","is_ca":false},{"name":"J. Danés","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07529695712954541,"gpt":0.3499483005617621,"spread":0.2746513434322166,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003787692,0.000489912,0.0008728773,0.001472788,0.0002269388,0.001282342,0.0006423169,0.0006228209,0.00178436],"category_scores_gemma":[0.00137438,0.0002238033,0.0006277131,0.001178527,0.0005897611,0.002292366,0.0005966858,0.0009799929,0.0008322175],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003047908,"about_ca_system_score_gemma":0.000314103,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004965489,"about_ca_topic_score_gemma":0.0003303508,"domain_scores_codex":[0.9996332,0.00004031298,0.00002892552,0.00007890933,0.0001865371,0.00003215929],"domain_scores_gemma":[0.9993662,0.0002167057,0.00009907193,0.0001147614,0.0001627769,0.00004049805],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002450758,0.00008904403,0.0007968381,0.0002132428,0.00005076838,0.0001973581,0.0000847285,0.02059326,0.1953404,0.02826163,0.002586414,0.7515413],"study_design_scores_gemma":[0.00005653145,0.0005195824,0.003609044,0.00003929807,0.00007820312,0.0009732954,0.0001157192,0.8035461,0.1445821,0.028307,0.01804432,0.0001289069],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0110146,0.0002374236,0.9874569,0.00007405491,0.00008573512,0.00003109479,0.00006300303,0.0002610457,0.000776185],"genre_scores_gemma":[0.3160356,0.00107918,0.6765148,0.0001945617,0.0003049206,0.0001003284,0.0007248304,0.0002440972,0.004801647],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00178436,"threshold_uncertainty_score":0.005969286,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}