{"meta":{"query_hash":"e871491136ce","filters":{"venue":"Probabilistic Graphical Models"},"cohort_total":8,"direct_labels_cover":0,"predictions_cover":8,"exported":8,"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/e871491136ce","api":"https://metacan.xera.ac/api/v1/cohort?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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Algorithm; Product (mathematics); Mathematics","score_opus":0.023641174479941063,"score_gpt":0.2319493166962864,"score_spread":0.20830814221634533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2522752090","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.006638084,0.00046924545,0.9889214,0.0004709886,0.00009045948,0.000109877765,0.00020134225,0.00058053876,0.0025180553],"genre_scores_gemma":[0.30161288,0.0011474371,0.68118757,0.00060248794,0.0003518334,0.0009841346,0.0014689604,0.000756889,0.011887798],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99621695,0.0015554387,0.00018596539,0.0009569816,0.00070023816,0.00038446824],"domain_scores_gemma":[0.9768737,0.018776616,0.0009938026,0.001809654,0.00090589636,0.00064031914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048390655,0.0029960219,0.0040347097,0.0017828887,0.0014684057,0.004332253,0.0075701517,0.0036085271,0.013818167],"category_scores_gemma":[0.02053994,0.0022630976,0.0021621687,0.0040795794,0.0028198094,0.009967135,0.0067540333,0.0056679756,0.0023206284],"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.00036023383,0.00049362815,0.00069354166,0.0005730341,0.00016444491,0.00011626178,0.00020971734,0.71033776,0.00075205596,0.13876238,0.010194679,0.13734224],"study_design_scores_gemma":[0.00004543898,0.000034859615,0.00004445362,0.000020171101,0.000021948834,0.000041464424,0.000026653239,0.86669874,0.00025245192,0.13201764,0.0007849543,0.0000111907775],"about_ca_topic_score_codex":0.0036563964,"about_ca_topic_score_gemma":0.0052122055,"teacher_disagreement_score":0.013818167,"about_ca_system_score_codex":0.0030304934,"about_ca_system_score_gemma":0.0030296536,"threshold_uncertainty_score":0.046226382},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05278634295251541,"score_gpt":0.3002076185333202,"score_spread":0.24742127558080476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2527038466","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.0038024043,0.00014432841,0.9944299,0.00009203173,0.000018463417,0.00006987551,0.0001356127,0.000874447,0.00043294523],"genre_scores_gemma":[0.08141287,0.00019731137,0.91570294,0.00014247074,0.00005294104,0.00024874153,0.0008485003,0.0003990485,0.0009951787],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942978,0.0023738416,0.00031194944,0.0011527027,0.0016124897,0.00025123017],"domain_scores_gemma":[0.9796529,0.0153486915,0.0009830599,0.0021337743,0.001356422,0.00052509963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005754736,0.0020121722,0.0016988025,0.0035006893,0.0010855001,0.0019494059,0.002555759,0.002079271,0.007294945],"category_scores_gemma":[0.025747178,0.0010080376,0.0021867217,0.0024035114,0.0014584798,0.004680894,0.00413442,0.004526392,0.0019586894],"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.0010343713,0.00034671315,0.005080906,0.00051179493,0.0005476298,0.0003286476,0.0005465399,0.12998752,0.012130358,0.0746894,0.0061706617,0.76862544],"study_design_scores_gemma":[0.00014447726,0.00013781502,0.0009190344,0.000051940133,0.000093638046,0.00025097013,0.00006906913,0.82666516,0.0054244166,0.16161282,0.0045660464,0.00006456556],"about_ca_topic_score_codex":0.0047571952,"about_ca_topic_score_gemma":0.005108402,"teacher_disagreement_score":0.007294945,"about_ca_system_score_codex":0.0011355187,"about_ca_system_score_gemma":0.0030521702,"threshold_uncertainty_score":0.03043431},"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,"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; Multi-agent system; Tree (set theory); Graphical model; Computer security; Artificial intelligence","score_opus":0.03175791186320538,"score_gpt":0.2517132354035583,"score_spread":0.2199553235403529,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898670591","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.012646043,0.00009071027,0.9845345,0.00021548344,0.000022824957,0.000060786613,0.00026779878,0.000401853,0.0017599595],"genre_scores_gemma":[0.44279456,0.00026538668,0.550397,0.00018712127,0.000048010406,0.00027274556,0.0021911585,0.00027823602,0.0035658507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99783796,0.0009105736,0.00009624376,0.00042601276,0.00055013393,0.00017911867],"domain_scores_gemma":[0.99437934,0.0026328657,0.000445967,0.0014876728,0.00065594923,0.00039816494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019965027,0.00042807194,0.00081696775,0.0010967155,0.0012061582,0.0019336931,0.002025689,0.0013306171,0.0027094383],"category_scores_gemma":[0.013771046,0.00066197966,0.0014750726,0.0012525892,0.00092381897,0.0032315722,0.0034404376,0.0022871448,0.0009405652],"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.0002233599,0.0003076518,0.0050347294,0.00022790945,0.00015429502,0.0005166122,0.0009942574,0.40818822,0.005799859,0.4242386,0.016568156,0.1377464],"study_design_scores_gemma":[0.000010716007,0.000024723737,0.00022604273,0.000018234017,0.000026863532,0.00008699445,0.00009991051,0.8255509,0.0016155447,0.16870628,0.0036241987,0.000009511945],"about_ca_topic_score_codex":0.0024716705,"about_ca_topic_score_gemma":0.003993754,"teacher_disagreement_score":0.0027094383,"about_ca_system_score_codex":0.0010706716,"about_ca_system_score_gemma":0.0020233816,"threshold_uncertainty_score":0.010558665},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.022079408785830146,"score_gpt":0.25352163056128996,"score_spread":0.2314422217754598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898877291","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.005942479,0.00025332024,0.9819686,0.00031732113,0.00006977863,0.00012588395,0.0008405499,0.008499428,0.001982581],"genre_scores_gemma":[0.16885234,0.00042742354,0.81750995,0.0004384119,0.00010262332,0.0005908218,0.004430906,0.0017811104,0.005866496],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987679,0.0005012301,0.000048209815,0.00036654278,0.00025252235,0.000063548716],"domain_scores_gemma":[0.99611354,0.0026430928,0.00014619676,0.000698062,0.00024974742,0.0001493472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021074032,0.001706421,0.0015299524,0.0019232781,0.00096252054,0.0020675815,0.0042243605,0.0023998157,0.008803271],"category_scores_gemma":[0.0137193315,0.0015211675,0.002196143,0.0016876165,0.0012887961,0.005258532,0.0042028106,0.004099417,0.0032477737],"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.00045902963,0.0004024482,0.0015355565,0.00084444135,0.0003513109,0.000258793,0.00023815347,0.42439505,0.0031895912,0.12509063,0.040537477,0.4026975],"study_design_scores_gemma":[0.00003503173,0.00002481491,0.000049539,0.000020033232,0.00001960858,0.00003292502,0.000011725993,0.8652967,0.00089869404,0.13102356,0.0025794113,0.0000079610045],"about_ca_topic_score_codex":0.0038054595,"about_ca_topic_score_gemma":0.008860666,"teacher_disagreement_score":0.008803271,"about_ca_system_score_codex":0.0014056902,"about_ca_system_score_gemma":0.001957057,"threshold_uncertainty_score":0.02944988},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.040581510970118646,"score_gpt":0.26223389838308414,"score_spread":0.2216523874129655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899000040","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.010744343,0.0004905701,0.98479027,0.00019967585,0.00009366994,0.000051676107,0.00018837639,0.0023438556,0.0010975231],"genre_scores_gemma":[0.485624,0.00047281478,0.49897832,0.00052636827,0.00015368937,0.00040131863,0.0027394854,0.00097293296,0.010131095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984505,0.0007104263,0.0000678782,0.00043289587,0.00019459573,0.00014363485],"domain_scores_gemma":[0.99672604,0.0021424766,0.00015145529,0.00042752145,0.00044016185,0.00011234547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022644158,0.001413933,0.0016980359,0.0011451697,0.00061483984,0.0010839481,0.0032765204,0.0020707825,0.005956697],"category_scores_gemma":[0.009591878,0.0014735998,0.0012997264,0.0017026172,0.0009840801,0.0024849134,0.0019808072,0.0036343858,0.0039709797],"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.00037833268,0.00020143924,0.0009337215,0.00018188282,0.00024179116,0.0000941776,0.00009094648,0.58627594,0.0041004387,0.009990237,0.007973381,0.38953766],"study_design_scores_gemma":[0.000006464543,0.000012095637,0.00007206394,0.000005194401,0.000009061798,0.000013110559,0.000004157721,0.99549603,0.0005607702,0.003510993,0.00030551662,0.000004579617],"about_ca_topic_score_codex":0.011048481,"about_ca_topic_score_gemma":0.021861864,"teacher_disagreement_score":0.011048481,"about_ca_system_score_codex":0.0010019916,"about_ca_system_score_gemma":0.0014678898,"threshold_uncertainty_score":0.021968365},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Regina","funders":"","keywords":"Computer science; Inference; Artificial intelligence; Machine learning","score_opus":0.11016250390616814,"score_gpt":0.42599450067440925,"score_spread":0.31583199676824114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899147640","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.04670438,0.0059880028,0.93948513,0.0024748414,0.00016832676,0.00015423511,0.00043495066,0.0005317101,0.0040584183],"genre_scores_gemma":[0.56480265,0.005401975,0.41700095,0.001093047,0.0009021986,0.0006470347,0.0027091461,0.0011295319,0.006313423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9650451,0.02793948,0.0010024391,0.0027472558,0.0027574848,0.00050825905],"domain_scores_gemma":[0.3567132,0.6140142,0.004688465,0.017363532,0.0058790185,0.0013415489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.07888181,0.0023800398,0.0023980092,0.0040098666,0.0017963408,0.0036030945,0.0062622866,0.004395455,0.008453873],"category_scores_gemma":[0.36294448,0.001570235,0.002789994,0.0037966573,0.0058111707,0.014004878,0.005187638,0.0077915215,0.00081063906],"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.0011514104,0.00049128104,0.030683067,0.0013722683,0.0013511955,0.000291244,0.001076333,0.31509417,0.00097537093,0.38130078,0.010378562,0.2558343],"study_design_scores_gemma":[0.00010118465,0.00016104824,0.00296986,0.0002873354,0.00014736116,0.00035614774,0.00020264013,0.7640078,0.00060324254,0.22801831,0.0030921486,0.00005289724],"about_ca_topic_score_codex":0.008232944,"about_ca_topic_score_gemma":0.0082978625,"teacher_disagreement_score":0.07888181,"about_ca_system_score_codex":0.003292119,"about_ca_system_score_gemma":0.0025963848,"threshold_uncertainty_score":0.41717184},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.017052654482376164,"score_gpt":0.2298890746640274,"score_spread":0.21283642018165122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899427005","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.0017960472,0.00024542148,0.99632746,0.0004115019,0.00002362926,0.000019814323,0.00013119237,0.00010495291,0.0009400097],"genre_scores_gemma":[0.323187,0.0023851981,0.66047645,0.00075616024,0.00058130256,0.00064695266,0.0018506813,0.0003463762,0.009769924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943203,0.0034885833,0.00016262919,0.0009793827,0.00086569425,0.00018348826],"domain_scores_gemma":[0.96645355,0.028210137,0.0013255035,0.0022391318,0.0013198286,0.00045182122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007847304,0.0017000209,0.003298297,0.0024076046,0.0011151992,0.0028574157,0.0043879827,0.0036003992,0.0074181026],"category_scores_gemma":[0.049133904,0.002421386,0.0016986406,0.003517584,0.002790375,0.009186438,0.0032588837,0.0063473787,0.0013671422],"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.00015984444,0.00012231623,0.00096823846,0.00027623426,0.00017353367,0.00014673958,0.00012437864,0.5520223,0.00039468688,0.37603113,0.006049947,0.06353062],"study_design_scores_gemma":[0.000020864341,0.00000860714,0.00007411089,0.000021159081,0.000023802482,0.000025784007,0.000006147053,0.68658423,0.00013134748,0.31208235,0.0010104257,0.000011142527],"about_ca_topic_score_codex":0.006726538,"about_ca_topic_score_gemma":0.008965935,"teacher_disagreement_score":0.007847304,"about_ca_system_score_codex":0.002157808,"about_ca_system_score_gemma":0.0027309188,"threshold_uncertainty_score":0.041501045},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of British Columbia","keywords":"Independence (probability theory); Computer science; Theoretical computer science; Mathematical economics; Econometrics; Mathematics; Statistics","score_opus":0.03499973794160964,"score_gpt":0.2755188765652267,"score_spread":0.24051913862361707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W33601243","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.001511693,0.005351618,0.95285535,0.013414723,0.0026074392,0.00007454962,0.00068312883,0.00046786945,0.023033615],"genre_scores_gemma":[0.2240433,0.014541091,0.70071757,0.014525278,0.015189173,0.0013308388,0.0021745288,0.0012363658,0.026241884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9876502,0.0077965944,0.00075338833,0.0018804851,0.0016167827,0.00030259552],"domain_scores_gemma":[0.9168026,0.07251735,0.0020577824,0.005970938,0.0020680774,0.0005832547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016194254,0.0015274079,0.0012943046,0.0016157435,0.0017143479,0.0053830505,0.00439953,0.0046780533,0.018447265],"category_scores_gemma":[0.08319382,0.0012995171,0.0032601028,0.003115026,0.007440364,0.013133219,0.0040728236,0.014433465,0.0045982115],"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.000033087643,0.00002418256,0.00041740548,0.00020548709,0.000047874026,0.00018818649,0.000347597,0.0049653333,0.00015783604,0.95545626,0.017107267,0.021049533],"study_design_scores_gemma":[0.000009529172,0.0000188907,0.00016280569,0.00008764919,0.000018312252,0.00022331197,0.000040772677,0.017779864,0.000092978495,0.9490109,0.032531694,0.000023379436],"about_ca_topic_score_codex":0.0038570082,"about_ca_topic_score_gemma":0.0024028006,"teacher_disagreement_score":0.018447265,"about_ca_system_score_codex":0.0022651001,"about_ca_system_score_gemma":0.0013296917,"threshold_uncertainty_score":0.085644424},"labels":[],"label_agreement":null}]}