{"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"},"query_hash":"e871491136ce","filters":{"venue":"Probabilistic Graphical Models"}},"results":[{"id":"W2522752090","doi":"","title":"Online Algorithms for Sum-Product Networks with Continuous Variables","year":2016,"lang":"en","type":"article","venue":"Probabilistic Graphical Models","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Algorithm; Product (mathematics); Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02364117447994106,"gpt":0.2319493166962864,"spread":0.2083081422163453,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005168435,0.0003900208,0.000501018,0.0001384225,0.000197822,0.0001390762,0.001200524,0.0001768289,0.000004101708],"category_scores_gemma":[0.0002051245,0.0002337491,0.0001483301,0.0007565866,0.0003658277,0.0004022778,0.0002242322,0.000219523,0.000002103871],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000570601,"about_ca_system_score_gemma":0.00008197443,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002162994,"about_ca_topic_score_gemma":0.00003664274,"domain_scores_codex":[0.9967452,0.0001176356,0.0005000916,0.0012548,0.0004546653,0.0009275637],"domain_scores_gemma":[0.9967942,0.001062984,0.0001763646,0.00119449,0.0004856933,0.000286218],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003933532,0.0003432184,0.00009953244,0.00001939384,0.00004136545,0.000009397855,0.00002117871,0.4714956,0.00004584561,0.5071252,0.0002262998,0.02053361],"study_design_scores_gemma":[0.000941925,0.0002828717,0.00009017899,0.0001328987,0.00003175996,0.00002689349,0.000002042253,0.8744279,0.00003904928,0.1231171,0.0004922398,0.0004151447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006447111,0.00024697,0.989355,0.002006301,0.0004331855,0.0007715278,0.00002500779,0.0004921781,0.0002227168],"genre_scores_gemma":[0.7281958,0.00004751185,0.2708413,0.0002395439,0.0002861878,0.0001741493,0.00001432698,0.00004159683,0.0001595512],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7217488,"threshold_uncertainty_score":0.9532013,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2898877291","doi":"","title":"Prometheus : Directly Learning Acyclic Directed Graph Structures for Sum-Product Networks","year":2018,"lang":"en","type":"article","venue":"Probabilistic Graphical Models","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Directed acyclic graph; Directed graph; Theoretical computer science; Graph; Product (mathematics); Graph theory; Artificial intelligence; Algorithm; Mathematics; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.02207940878583015,"gpt":0.25352163056129,"spread":0.2314422217754598,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001142134,0.0004478004,0.0005182233,0.0003602772,0.0007516727,0.0002890561,0.001448794,0.0001996533,0.00001274824],"category_scores_gemma":[0.0008810455,0.0003700243,0.0003306957,0.001938963,0.0006998782,0.0005447579,0.0003033809,0.0005585772,0.00000483034],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002634703,"about_ca_system_score_gemma":0.00005704986,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001711603,"about_ca_topic_score_gemma":0.00001235817,"domain_scores_codex":[0.9963272,0.0004024032,0.0005461355,0.001339084,0.0004201017,0.0009650512],"domain_scores_gemma":[0.9972566,0.0007392613,0.0002000025,0.000975677,0.0005147148,0.0003137348],"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.00009038093,0.0001561722,0.0001877006,0.00006379781,0.00009673738,0.000004464744,0.0004855793,0.01335904,0.0004186679,0.9476379,0.0001450887,0.03735442],"study_design_scores_gemma":[0.0002815855,0.0002426895,0.0004312778,0.00002225178,0.00002582555,0.00001041697,0.000004072274,0.4274815,0.000249374,0.5707665,0.0001837243,0.0003007981],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05027007,0.0004007735,0.9448791,0.0004005648,0.0009103027,0.001196231,0.000007981363,0.001217957,0.0007170726],"genre_scores_gemma":[0.9326273,0.0000235095,0.06639113,0.0001571664,0.0003715047,0.0002948584,0.00001393023,0.00004021941,0.00008044043],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8823572,"threshold_uncertainty_score":0.9998752,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2899427005","doi":"","title":"Bayesian Network Structure Learning with Side Constraints","year":2018,"lang":"en","type":"article","venue":"Probabilistic Graphical Models","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Bayesian network; Computer science; Artificial intelligence; Bayesian probability; Variable-order Bayesian network; Machine learning; Bayesian inference","retraction":null,"screen_n_in":null,"score":{"opus":0.01705265448237616,"gpt":0.2298890746640274,"spread":0.2128364201816512,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003085498,0.0002884838,0.0002976938,0.00008110715,0.0003748366,0.0002412929,0.0008075566,0.0001755263,0.00003926878],"category_scores_gemma":[0.00009681455,0.0002214425,0.00006848968,0.0007553144,0.0008739074,0.0003655156,0.0001777908,0.0005828805,0.00001349962],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002573511,"about_ca_system_score_gemma":0.0001532036,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001605406,"about_ca_topic_score_gemma":0.00004458193,"domain_scores_codex":[0.9976407,0.0001545551,0.0003236557,0.0007792332,0.0004200029,0.0006818828],"domain_scores_gemma":[0.9985201,0.000166115,0.0001077501,0.0005923709,0.000311544,0.0003021182],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002025083,0.00003218121,0.0003948179,0.00001781568,0.00002743861,0.0000162662,0.0003076236,0.0780029,0.00008265176,0.907609,0.0000665193,0.01342254],"study_design_scores_gemma":[0.0001407666,0.0002067893,0.0001257066,0.00004982199,0.000009967983,0.00004023709,0.000004026731,0.501384,0.00002235013,0.4977891,0.00003113018,0.0001961362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01088671,0.00003934429,0.9835595,0.0005070824,0.0001601106,0.0002186478,0.000002746874,0.0003928304,0.004233017],"genre_scores_gemma":[0.8723299,0.000003415131,0.1270262,0.0003952872,0.0001823101,0.00001554409,0.000003253572,0.00001806453,0.00002607043],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8614432,"threshold_uncertainty_score":0.9030163,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W33601243","doi":"10.1016/j.nedt.2020.104740","title":"A Short Note on Discrete Representability of Independence Models.","year":2006,"lang":"en","type":"article","venue":"Probabilistic Graphical Models","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"University of British Columbia","keywords":"Independence (probability theory); Computer science; Theoretical computer science; Mathematical economics; Econometrics; Mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.03499973794160964,"gpt":0.2755188765652267,"spread":0.2405191386236171,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007484592,0.0003110443,0.0004421107,0.0001624421,0.0001197073,0.0001003961,0.001322298,0.0002426355,0.000004302158],"category_scores_gemma":[0.0001224852,0.000264855,0.0002244179,0.0006918002,0.000362587,0.0006365673,0.00035149,0.0005031753,0.000005130609],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005443379,"about_ca_system_score_gemma":0.0001128169,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004533806,"about_ca_topic_score_gemma":0.00004318707,"domain_scores_codex":[0.9965032,0.0001709531,0.0007420849,0.001095564,0.0009709877,0.0005172291],"domain_scores_gemma":[0.9975299,0.0003145015,0.000117694,0.00152095,0.0003266368,0.0001902733],"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.00002516554,0.0002425799,0.0002240597,0.00003805078,0.000006264764,0.000005478115,0.00006941256,0.2002167,0.0001717768,0.7952998,0.00002437761,0.003676339],"study_design_scores_gemma":[0.00008568299,0.00006714937,0.0005789545,0.00003329603,0.000007425228,0.000004138833,0.000001201869,0.4972418,0.0002386959,0.5015867,0.000001407669,0.0001535045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06273543,0.0000508858,0.9293203,0.0003941803,0.0001146594,0.0003643207,0.00001531027,0.0002159897,0.006788887],"genre_scores_gemma":[0.9709784,0.000009368299,0.02877546,0.00008942017,0.00003684119,0.00006769378,0.000005528144,0.00001596425,0.00002136633],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9082429,"threshold_uncertainty_score":0.9999804,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2899000040","doi":"","title":"Discriminative Training of Sum-Product Networks by Extended Baum-Welch.","year":2018,"lang":"en","type":"article","venue":"Probabilistic Graphical Models","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Discriminative model; Training (meteorology); Product (mathematics); Computer science; Artificial intelligence; Speech recognition; Pattern recognition (psychology); Mathematics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.04058151097011865,"gpt":0.2622338983830841,"spread":0.2216523874129655,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000429193,0.0002032666,0.0003044838,0.0001078934,0.0001511166,0.00005976261,0.0006599856,0.0001062074,0.00002398338],"category_scores_gemma":[0.0002095211,0.0001638724,0.0001128351,0.0005638241,0.0004844828,0.0005080662,0.0002001727,0.0002270536,0.000007538136],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001708281,"about_ca_system_score_gemma":0.00004280148,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002646159,"about_ca_topic_score_gemma":0.000007603046,"domain_scores_codex":[0.9980075,0.000141911,0.0004042435,0.0006591608,0.000367643,0.0004195145],"domain_scores_gemma":[0.998634,0.0001998897,0.0001384295,0.0005421971,0.000318361,0.0001671702],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001330184,0.0009366671,0.00007992843,0.000148036,0.00009399693,0.000008916163,0.00683637,0.003576776,0.00845111,0.813007,0.00991377,0.1568144],"study_design_scores_gemma":[0.0002323269,0.000186083,0.0001320868,0.00007439406,0.00001479614,0.000004094659,0.0000496385,0.5347531,0.00175257,0.4625395,0.00007520823,0.0001861956],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03222181,0.0001620045,0.9631481,0.0008029069,0.0003203734,0.0003311801,0.00001289995,0.0001168058,0.002883941],"genre_scores_gemma":[0.9837669,0.00002326417,0.01581316,0.0001853231,0.00008570228,0.00005527734,0.00001372594,0.000012294,0.0000443356],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9515451,"threshold_uncertainty_score":0.6682524,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2899147640","doi":"","title":"An Empirical Study of Methods for SPN Learning and Inference","year":2018,"lang":"en","type":"article","venue":"Probabilistic Graphical Models","topic":"Speech Recognition and Synthesis","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; University of Regina","funders":"","keywords":"Computer science; Inference; Artificial intelligence; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.1101625039061681,"gpt":0.4259945006744092,"spread":0.3158319967682411,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009544268,0.0001219456,0.000255192,0.0001328689,0.0001385695,0.00007492325,0.0003598102,0.0000771218,0.00001110527],"category_scores_gemma":[0.0009940241,0.0001002846,0.0000490056,0.0003552653,0.0002038598,0.0002472448,0.0001118957,0.00012676,0.000001092896],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007202447,"about_ca_system_score_gemma":0.00003258746,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000135941,"about_ca_topic_score_gemma":0.00001347445,"domain_scores_codex":[0.9984918,0.0003901305,0.0002983579,0.0004717808,0.0001441814,0.0002037075],"domain_scores_gemma":[0.9980185,0.001131487,0.0000785388,0.0003007205,0.0003195232,0.0001512153],"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.0000847971,0.001862602,0.01078649,0.00008008005,0.0000576377,0.000001600254,0.003891413,0.0001583332,0.001006291,0.18197,0.0000139973,0.8000867],"study_design_scores_gemma":[0.000265058,0.001233058,0.001580241,0.000008608899,0.0000157822,0.000002679838,0.0000713003,0.6221981,0.0001607835,0.3743169,0.00004535083,0.0001021695],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2475964,0.00001268439,0.7515795,0.00008997467,0.0000472822,0.0003515399,8.279422e-7,0.00007320826,0.0002485484],"genre_scores_gemma":[0.6433181,0.000002664538,0.3565535,0.00004476934,0.00001780163,0.00005430791,3.882014e-7,0.000004892453,0.000003542463],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7999846,"threshold_uncertainty_score":0.4089486,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2527038466","doi":"","title":"Relevant Path Separation: A Faster Method for Testing Independencies in Bayesian Networks","year":2016,"lang":"en","type":"article","venue":"Probabilistic Graphical Models","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Separation (statistics); Bayesian network; Independence (probability theory); Computer science; Path (computing); Intersection (aeronautics); Range (aeronautics); Bayesian probability; Separation of concerns; Source separation; Artificial intelligence; Machine learning; Mathematics; Engineering; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.05278634295251541,"gpt":0.3002076185333202,"spread":0.2474212755808048,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001225689,0.0002509057,0.0003288758,0.0001570692,0.0001243522,0.0001526521,0.0007081694,0.0002087648,0.00000323304],"category_scores_gemma":[0.0006315667,0.0001719922,0.0001036813,0.0006516614,0.00009025086,0.000580213,0.0001786029,0.0002381858,0.000003068622],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005941937,"about_ca_system_score_gemma":0.0001315286,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002926338,"about_ca_topic_score_gemma":0.00004265417,"domain_scores_codex":[0.9975238,0.0001934793,0.0005676486,0.0008131099,0.0003125401,0.0005894028],"domain_scores_gemma":[0.9973583,0.001499226,0.0001205757,0.0005642228,0.0002772106,0.0001805263],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002651083,0.00009374385,0.0004210559,0.00003983867,0.00001025989,0.000008296463,0.0002249929,0.04988179,0.0003504275,0.8726459,0.00004803638,0.07624919],"study_design_scores_gemma":[0.0002420506,0.00008366159,0.0001108658,0.00009917942,0.000004816482,0.000009603547,0.000002477759,0.5296846,0.00001132626,0.4695885,0.000008994177,0.0001539869],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001137876,0.00007153705,0.9959073,0.001624153,0.0001460238,0.0005219543,0.000005383811,0.0001855315,0.0004002345],"genre_scores_gemma":[0.6302197,0.000005470092,0.3692847,0.0002069784,0.00004408485,0.0001966382,9.286034e-7,0.00001161442,0.00002989845],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6290818,"threshold_uncertainty_score":0.7013637,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2898670591","doi":"","title":"Privacy Sensitive Construction of Junction Tree Agent Organization for Multiagent Graphical Models.","year":2018,"lang":"en","type":"article","venue":"Probabilistic Graphical Models","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Multi-agent system; Tree (set theory); Graphical model; Computer security; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.03175791186320538,"gpt":0.2517132354035583,"spread":0.2199553235403529,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000312696,0.0002044014,0.0002674564,0.0001949525,0.0002795992,0.00008750874,0.000480436,0.0001505067,0.000004392093],"category_scores_gemma":[0.0002295293,0.0001889112,0.0001123127,0.001126395,0.0004568114,0.0005767181,0.0002071314,0.0001326692,0.000004723102],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004907251,"about_ca_system_score_gemma":0.00007516016,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003689076,"about_ca_topic_score_gemma":0.00001026498,"domain_scores_codex":[0.9981079,0.00006580272,0.0004997382,0.0007000645,0.0003352796,0.0002912488],"domain_scores_gemma":[0.9977691,0.0001612845,0.0002063472,0.0006738774,0.001035361,0.0001541001],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001973725,0.0002507756,0.00002879845,0.00003933474,0.00003504481,5.095187e-7,0.0005126065,0.002045681,0.0006603971,0.9594883,0.0001647726,0.03675404],"study_design_scores_gemma":[0.0002978471,0.0001400715,0.0002452269,0.0000199791,0.00003165626,0.00001227074,0.00001571651,0.6110173,0.0008296469,0.3871894,0.0000675904,0.0001331933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0325337,0.00001089659,0.965139,0.0008658147,0.0002900916,0.0007553084,0.00004740387,0.0001916738,0.0001661493],"genre_scores_gemma":[0.7026828,0.00001431892,0.2969886,0.00006982849,0.00008066571,0.00007295706,0.00006692082,0.00001613762,0.0000077264],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6701491,"threshold_uncertainty_score":0.7703575,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}