{"meta":{"query_hash":"6b31ad525f57","filters":{"venue":"Journal on Satisfiability Boolean Modeling and Computation"},"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/6b31ad525f57","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+on+Satisfiability+Boolean+Modeling+and+Computation"},"results":[{"id":"W121484681","doi":"10.3233/sat190001","title":"Semidefinite Optimization Approaches for Satisfiability and Maximum-Satisfiability Problems","year":2005,"lang":"en","type":"article","venue":"Journal on Satisfiability Boolean Modeling and Computation","topic":"Complexity and Algorithms in Graphs","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":"University of Waterloo","funders":"","keywords":"Semidefinite programming; Semidefinite embedding; Satisfiability; Relaxation (psychology); Mathematics; Quadratically constrained quadratic program; Maximum cut; Linear programming; Large margin nearest neighbor; Mathematical optimization; Combinatorics; Computer science; Discrete mathematics; Quadratic programming; Artificial intelligence","score_opus":0.06582800461354198,"score_gpt":0.267172676926121,"score_spread":0.20134467231257902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W121484681","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15438783,0.00026869884,0.84228426,0.0017527266,0.00019056883,0.0008232555,0.000016441942,0.00015856941,0.000117657495],"genre_scores_gemma":[0.60016906,0.0000655692,0.39938796,0.00016841407,0.00012696668,0.000048620666,0.000011351776,0.000015892196,0.000006163821],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99662274,0.0003970181,0.0010402757,0.00095416815,0.0005300413,0.00045576677],"domain_scores_gemma":[0.99773943,0.00075228256,0.00036142004,0.00048627815,0.00036444736,0.0002961525],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0031045715,0.0003861992,0.00048137034,0.0002455281,0.0008729512,0.0007383849,0.00034413778,0.00017517699,0.000006417816],"category_scores_gemma":[0.00034697892,0.0003657282,0.00016709401,0.00031347177,0.0001930329,0.001172602,0.00017820357,0.00052920124,0.0000019790762],"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.000031424363,0.00011677735,0.0010427868,0.00011200834,0.000019969173,3.648021e-7,0.0006448,0.6589874,0.00000467898,0.0078810295,0.000012478693,0.3311463],"study_design_scores_gemma":[0.0007890452,0.0003078357,0.0017212402,0.00008864336,0.000021050044,0.000053776595,0.000068560876,0.77992237,0.000009994783,0.21663344,0.000073307485,0.00031077518],"about_ca_topic_score_codex":0.000022802222,"about_ca_topic_score_gemma":0.000018104036,"teacher_disagreement_score":0.44578123,"about_ca_system_score_codex":0.00018504287,"about_ca_system_score_gemma":0.00011308379,"threshold_uncertainty_score":0.9998795},"labels":[],"label_agreement":null},{"id":"W1488842140","doi":"10.3233/sat190055","title":"QBF-Based Formal Verification: Experience and Perspectives","year":2008,"lang":"en","type":"article","venue":"Journal on Satisfiability Boolean Modeling and Computation","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":75,"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":"Strong","keywords":"Formal methods; Formal verification; Computer science; Programming language","score_opus":0.08181267425518404,"score_gpt":0.3148733832200596,"score_spread":0.23306070896487555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1488842140","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45153457,0.00008968512,0.54781413,0.00026663922,0.00008484986,0.0000904674,4.4205674e-7,0.00004955151,0.00006967276],"genre_scores_gemma":[0.69487196,0.00006282615,0.30488446,0.00011247934,0.000047827005,0.00001006398,8.253608e-7,0.000005398438,0.0000041293356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984233,0.00021441016,0.0003973008,0.00038912438,0.00037125018,0.00020464168],"domain_scores_gemma":[0.9990609,0.000104702085,0.00017787266,0.00025917802,0.0002535041,0.00014383333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008877631,0.00015086195,0.00016677065,0.00014033252,0.00071759935,0.00019449112,0.00020545932,0.00006314079,0.000002297846],"category_scores_gemma":[0.00017358588,0.00014082479,0.000046219517,0.00018032794,0.00014061276,0.0011705041,0.000049588823,0.00027500954,0.0000027685426],"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.00015343532,0.00023315648,0.0049236096,0.000048497786,0.00001993852,0.000013084871,0.024994573,0.5683134,0.0003528818,0.05531229,0.000028472545,0.34560665],"study_design_scores_gemma":[0.00037442462,0.00021408795,0.017432125,0.000024982062,0.0000036282484,0.0001670556,0.0004571716,0.9750964,0.00013181924,0.005910355,0.000031500767,0.00015643012],"about_ca_topic_score_codex":0.000008896621,"about_ca_topic_score_gemma":4.028245e-7,"teacher_disagreement_score":0.406783,"about_ca_system_score_codex":0.00009449816,"about_ca_system_score_gemma":0.00008903855,"threshold_uncertainty_score":0.5742668},"labels":[],"label_agreement":null},{"id":"W2098347190","doi":"10.3233/sat190050","title":"Improved SAT-based Reachability Analysis with Observability Don’t Cares","year":2008,"lang":"en","type":"article","venue":"Journal on Satisfiability Boolean Modeling and Computation","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":22,"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":"Observability; Reachability; Mathematics; Computer science; Theoretical computer science; Applied mathematics","score_opus":0.04621811252362271,"score_gpt":0.2875096499397546,"score_spread":0.24129153741613188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098347190","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48180366,0.00002498266,0.51758647,0.00021124762,0.00008054925,0.000180642,0.0000021592316,0.00008666681,0.00002359096],"genre_scores_gemma":[0.6284816,0.000006513682,0.37130094,0.0001456995,0.000032724536,0.000013653591,0.000007292459,0.00000799037,0.0000035636235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967585,0.000780082,0.00077134086,0.0007363131,0.0006379648,0.00031579187],"domain_scores_gemma":[0.9975655,0.0003327188,0.00036866372,0.0007623896,0.00072774256,0.0002429718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025931173,0.00027751297,0.00045912983,0.0002900723,0.0006647308,0.00022839164,0.00038549877,0.00011518671,0.000003597228],"category_scores_gemma":[0.0003732226,0.0002249142,0.00017389642,0.00094893784,0.0001788826,0.0007448629,0.000063817955,0.0005244086,0.0000016757866],"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.00017757034,0.0001845316,0.04500212,0.000037517206,0.00008717346,0.000005265927,0.00076196087,0.90725654,0.00010502148,0.00074712076,0.0000053719373,0.045629814],"study_design_scores_gemma":[0.0005252031,0.0005162034,0.058813017,0.000019988696,0.000077408986,0.000034882167,0.000066951594,0.9356999,0.00014109843,0.0038506615,0.000009942286,0.0002447899],"about_ca_topic_score_codex":0.00019562116,"about_ca_topic_score_gemma":0.000057161,"teacher_disagreement_score":0.14667794,"about_ca_system_score_codex":0.00029563185,"about_ca_system_score_gemma":0.00028530814,"threshold_uncertainty_score":0.9171735},"labels":[],"label_agreement":null},{"id":"W2126735726","doi":"10.3233/sat190045","title":"A Switching Criterion for Intensification and Diversification in Local Search for SAT12","year":2008,"lang":"en","type":"article","venue":"Journal on Satisfiability Boolean Modeling and Computation","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":16,"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 New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; Technische Universiteit Delft","keywords":"Diversification (marketing strategy); Business; Economics; Marketing","score_opus":0.060497287460256816,"score_gpt":0.2991865808051254,"score_spread":0.23868929334486857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126735726","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.383905,0.000023512888,0.614745,0.0008919715,0.0000796771,0.00032088373,0.000001618853,0.000026241249,0.0000060875495],"genre_scores_gemma":[0.9092379,0.00007859711,0.09044858,0.0001563331,0.000038198308,0.00002170848,0.000009044951,0.0000068000495,0.0000028203328],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988335,0.00009733922,0.00039693367,0.00033293842,0.00018131315,0.00015800059],"domain_scores_gemma":[0.9990959,0.00026316434,0.000112619644,0.00010761949,0.0003330283,0.00008762734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009051457,0.00011234945,0.00015584857,0.00024531345,0.00043636738,0.00014835884,0.000079633275,0.00006592244,5.7794557e-7],"category_scores_gemma":[0.00010493685,0.00011372212,0.000045957262,0.00013023382,0.0000423385,0.00054096075,0.000027063852,0.00016952172,4.8702503e-7],"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.00011574735,0.000043007098,0.0032509025,0.00003918113,0.0000066855155,0.0000011274941,0.0025181824,0.44493034,0.00025019626,0.0039762696,0.000012494713,0.54485583],"study_design_scores_gemma":[0.0008914969,0.00017848433,0.014601109,0.000046623947,0.0000051783345,0.000086824984,0.0003723358,0.97528654,0.000035349713,0.008365927,0.000013501225,0.00011664169],"about_ca_topic_score_codex":0.00002431991,"about_ca_topic_score_gemma":0.000011226015,"teacher_disagreement_score":0.5447392,"about_ca_system_score_codex":0.00012858663,"about_ca_system_score_gemma":0.0000707736,"threshold_uncertainty_score":0.46374536},"labels":[],"label_agreement":null},{"id":"W2159832387","doi":"10.3233/sat190066","title":"Algorithms and Complexity Results for Input and Unit Resolution","year":2009,"lang":"en","type":"article","venue":"Journal on Satisfiability Boolean Modeling and Computation","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto","keywords":"Resolution (logic); Completeness (order theory); Space (punctuation); PSPACE; Computer science; Algorithm; Mathematics; Computational complexity theory; Artificial intelligence; Mathematical analysis","score_opus":0.05055338728897672,"score_gpt":0.27397125337858336,"score_spread":0.22341786608960662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159832387","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6590968,0.00022655341,0.34006953,0.00016912438,0.00009028042,0.00016707838,0.0000132566265,0.000056678007,0.000110678535],"genre_scores_gemma":[0.9920971,0.000083565166,0.0076295333,0.00005946812,0.00010195283,0.0000033667716,0.000011373085,0.000008663786,0.0000050037775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990735,0.00009727309,0.0003784826,0.00018108227,0.00012071041,0.00014897229],"domain_scores_gemma":[0.9995387,0.00012581579,0.00006341849,0.00007631688,0.000084010884,0.000111708374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010089626,0.0001318229,0.00018796792,0.00009621657,0.0002692484,0.000119440185,0.00003152024,0.00007123756,2.9947194e-7],"category_scores_gemma":[0.00005449185,0.00012471856,0.000032374224,0.00006198881,0.000043618886,0.00015883414,0.000007020806,0.0001993644,3.2446283e-7],"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.00028368382,0.000030783835,0.00023227946,0.000088740795,0.000025031855,0.0000014865099,0.00096341985,0.80125135,0.00016612443,0.0053760605,0.00008103355,0.1915],"study_design_scores_gemma":[0.00082648057,0.00026645386,0.0052578184,0.00007569375,0.00001351378,0.000046519337,0.00013122012,0.8579976,0.000011809454,0.13519467,0.00006119217,0.00011705662],"about_ca_topic_score_codex":0.0000061781066,"about_ca_topic_score_gemma":0.0000045324628,"teacher_disagreement_score":0.33300027,"about_ca_system_score_codex":0.000028686578,"about_ca_system_score_gemma":0.0000080554455,"threshold_uncertainty_score":0.5085875},"labels":[],"label_agreement":null},{"id":"W2163348426","doi":"10.3233/sat190036","title":"An Extended Semidefinite Relaxation for Satisfiability","year":2007,"lang":"en","type":"article","venue":"Journal on Satisfiability Boolean Modeling and Computation","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Technische Universiteit Delft","keywords":"Semidefinite programming; Relaxation (psychology); Satisfiability; Semidefinite embedding; Mathematics; Class (philosophy); Extension (predicate logic); Combinatorics; Mathematical optimization; Discrete mathematics; Computer science; Quadratically constrained quadratic program; Quadratic programming; Artificial intelligence","score_opus":0.046582195121019944,"score_gpt":0.35056300591015194,"score_spread":0.30398081078913197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163348426","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38220522,0.000027851833,0.61676186,0.00014033957,0.0003215082,0.00033922523,0.000002483617,0.00011440609,0.00008707321],"genre_scores_gemma":[0.54678833,0.000009183787,0.45291272,0.00015643763,0.00010226023,0.0000110955025,0.000006675636,0.0000104573755,0.000002866965],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971867,0.00039750323,0.00094660925,0.0005994968,0.00050661183,0.0003630398],"domain_scores_gemma":[0.9976573,0.00057490566,0.00044282802,0.0005055254,0.0005575721,0.00026187848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008756869,0.00022582065,0.0002678969,0.00025424626,0.00056132657,0.0003849054,0.0003404742,0.00015131003,0.0000019258334],"category_scores_gemma":[0.0007649407,0.00021681796,0.00010694291,0.00028001974,0.000061835555,0.001346016,0.000042702337,0.00040110803,0.0000035618787],"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.00017189202,0.00016401002,0.0013046091,0.00004267071,0.000013521547,0.0000014597528,0.0010087881,0.2156895,0.00055200484,0.0606692,0.000014462158,0.7203679],"study_design_scores_gemma":[0.00048101798,0.00056442304,0.01891815,0.000031739688,0.000010789077,0.000037356975,0.00010475086,0.7978942,0.00023345392,0.18148905,0.000038046815,0.00019702413],"about_ca_topic_score_codex":0.000015345991,"about_ca_topic_score_gemma":0.000008996042,"teacher_disagreement_score":0.72017086,"about_ca_system_score_codex":0.00024306415,"about_ca_system_score_gemma":0.00009613349,"threshold_uncertainty_score":0.884158},"labels":[],"label_agreement":null},{"id":"W2580735446","doi":"10.3233/sat190111","title":"Hard satisfiable 3-SAT instances via autocorrelation","year":2016,"lang":"en","type":"article","venue":"Journal on Satisfiability Boolean Modeling and Computation","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Autocorrelation; Boolean satisfiability problem; Reduction (mathematics); Satisfiability; Computer science; Mathematics; Combinatorics; Algorithm; Statistics","score_opus":0.03937523132885755,"score_gpt":0.2920864361888223,"score_spread":0.25271120485996473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2580735446","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27408552,0.000052744042,0.7241929,0.0006630735,0.0004810758,0.0002081059,0.0000013895652,0.00012386883,0.00019133976],"genre_scores_gemma":[0.6514786,0.000038854203,0.34820712,0.00013374706,0.00008358255,0.000012533352,0.0000011672278,0.000009206082,0.00003518798],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976899,0.0003891543,0.00066017336,0.0004604818,0.0005283602,0.00027191985],"domain_scores_gemma":[0.9986303,0.0002591109,0.00033352905,0.000342448,0.000272469,0.00016216587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019667386,0.00019993717,0.00023087859,0.00020308926,0.00040832753,0.0002975635,0.0002951189,0.00010559901,0.000007662057],"category_scores_gemma":[0.00027505585,0.00014471685,0.000076010205,0.00023789576,0.000063657746,0.0016724514,0.00006934804,0.00026660642,0.000038398004],"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.00004360751,0.00004633123,0.002713753,0.000016684526,0.000014516946,0.0000018671003,0.00037341725,0.10170863,0.0008182358,0.031904094,0.00004769118,0.8623112],"study_design_scores_gemma":[0.0004570481,0.00020472142,0.010859105,0.00010707509,0.00000692255,0.000048803115,0.000018823941,0.8309575,0.00013397582,0.15692976,0.00009713204,0.0001791366],"about_ca_topic_score_codex":0.000010472021,"about_ca_topic_score_gemma":0.0000021904661,"teacher_disagreement_score":0.862132,"about_ca_system_score_codex":0.00022587142,"about_ca_system_score_gemma":0.00008540383,"threshold_uncertainty_score":0.5901382},"labels":[],"label_agreement":null},{"id":"W2995736486","doi":"10.3233/sat190119","title":"MaxSAT Evaluation 2018: New Developments and Detailed Results","year":2019,"lang":"en","type":"article","venue":"Journal on Satisfiability Boolean Modeling and Computation","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":20,"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":"Carnegie Mellon Portugal; National Science Foundation","keywords":"Maximum satisfiability problem; Satisfiability; Boolean satisfiability problem; Series (stratigraphy); Computer science; Radiomics; Theoretical computer science; Artificial intelligence; Algorithm; Boolean function","score_opus":0.06352342221819057,"score_gpt":0.3266440326746796,"score_spread":0.26312061045648905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995736486","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46621713,0.000056538465,0.53265816,0.00024204675,0.00029770637,0.00025315033,5.539139e-7,0.000033039465,0.00024168367],"genre_scores_gemma":[0.6526798,0.000030062025,0.34708247,0.00011724425,0.00004305145,0.000003602767,0.0000035142878,0.000006119572,0.00003416058],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977236,0.00039362724,0.00060401816,0.00044753123,0.0006389829,0.0001922781],"domain_scores_gemma":[0.99886423,0.00014488756,0.0002814228,0.00026938858,0.00026967618,0.00017037068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037297574,0.00016017671,0.00019281975,0.00016624725,0.00020943698,0.00035759286,0.00019050704,0.00008344475,0.0000038365943],"category_scores_gemma":[0.00033356415,0.0001461521,0.00003542812,0.00017324484,0.00002080092,0.00084210926,0.00008235444,0.0002726061,0.000024424835],"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.00010031597,0.000028492455,0.0023964283,0.000017868653,0.000014562329,6.2739656e-7,0.0010644115,0.21120584,0.00012588558,0.0027349654,0.00006339881,0.7822472],"study_design_scores_gemma":[0.001172027,0.00017964032,0.02420705,0.000075156546,0.000010975844,0.000038462033,0.000050139577,0.9368488,0.00006048382,0.03714147,0.000057155827,0.00015862193],"about_ca_topic_score_codex":0.000012875316,"about_ca_topic_score_gemma":0.0000027865644,"teacher_disagreement_score":0.7820886,"about_ca_system_score_codex":0.00016984346,"about_ca_system_score_gemma":0.00018734139,"threshold_uncertainty_score":0.59599096},"labels":[],"label_agreement":null}]}