{"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":"6b31ad525f57","filters":{"venue":"Journal on Satisfiability Boolean Modeling and Computation"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Strong","keywords":"Formal methods; Formal verification; Computer science; Programming language","authors":[{"name":"Marco Benedetti","is_ca":false},{"name":"Hratch Mangassarian","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08181267425518404,"gpt":0.3148733832200596,"spread":0.2330607089648755,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03474772,0.001620189,0.001010099,0.002329179,0.001010846,0.006292588,0.004108015,0.003102843,0.005935434],"category_scores_gemma":[0.02679964,0.0006998999,0.0007406559,0.002016255,0.006515711,0.01404786,0.00336442,0.00489675,0.001919359],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00321186,"about_ca_system_score_gemma":0.002220924,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003277296,"about_ca_topic_score_gemma":0.001437273,"domain_scores_codex":[0.9898371,0.005916516,0.0004824648,0.0007249531,0.002580361,0.0004586078],"domain_scores_gemma":[0.9711158,0.01899288,0.0004403239,0.002437769,0.005743041,0.001270124],"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.0004849376,0.0006130203,0.002307947,0.0012992,0.00007974484,0.0004737985,0.004751356,0.01274608,0.003054732,0.4310614,0.01502208,0.5281057],"study_design_scores_gemma":[0.0002632258,0.001007247,0.001127275,0.002794784,0.00005248359,0.001308011,0.004109359,0.03983252,0.009937045,0.5017534,0.4375811,0.0002336025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03003579,0.2359083,0.5909734,0.04121311,0.000990858,0.0001407565,0.0001569304,0.0007763334,0.09980455],"genre_scores_gemma":[0.3932811,0.2156586,0.3651131,0.004702924,0.002239456,0.0002331483,0.0005736348,0.0004177411,0.0177804],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03474772,"threshold_uncertainty_score":0.1837657,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Observability; Reachability; Mathematics; Computer science; Theoretical computer science; Applied mathematics","authors":[{"name":"Sean Safarpour","is_ca":true},{"name":"Andreas Veneris","is_ca":true},{"name":"Rolf Drechsler","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04621811252362271,"gpt":0.2875096499397546,"spread":0.2412915374161319,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001755707,0.001209654,0.001033007,0.001915352,0.0008357303,0.001474479,0.00245246,0.000946948,0.01094394],"category_scores_gemma":[0.007737207,0.0007863738,0.0024914,0.001394153,0.001588428,0.00355231,0.002078012,0.002589486,0.001722079],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001114842,"about_ca_system_score_gemma":0.002211731,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009166699,"about_ca_topic_score_gemma":0.01559023,"domain_scores_codex":[0.9973124,0.0006545528,0.0001415956,0.0005162826,0.001082613,0.0002926219],"domain_scores_gemma":[0.9946614,0.003177393,0.000206382,0.001223856,0.0006571868,0.00007382951],"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.0006172396,0.0004102224,0.003403353,0.0004646784,0.0002658705,0.0005705839,0.0002775073,0.4301204,0.02093199,0.2466091,0.00876113,0.2875679],"study_design_scores_gemma":[0.00005270805,0.00005141778,0.0003625841,0.00002853535,0.00007793475,0.00007407989,0.00002085331,0.9250606,0.006650711,0.06504443,0.002548508,0.00002759971],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01248755,0.0001328502,0.9771428,0.0002551793,0.0000880058,0.00009682836,0.0002737726,0.003225635,0.006297426],"genre_scores_gemma":[0.4648927,0.0003196303,0.5242916,0.0003648097,0.000105325,0.0002651593,0.001515064,0.0006845589,0.007561081],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01094394,"threshold_uncertainty_score":0.03661114,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Fahiem Bacchus","is_ca":true},{"name":"Matti J„ärvisalo","is_ca":false},{"name":"Ruben Martins","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06352342221819057,"gpt":0.3266440326746796,"spread":0.263120610456489,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0270087,0.003165847,0.002190009,0.006257552,0.001577457,0.008258489,0.003660685,0.001824471,0.01920052],"category_scores_gemma":[0.05806659,0.001293497,0.00210701,0.006802089,0.001496938,0.008768754,0.004682876,0.006034166,0.007381381],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004481051,"about_ca_system_score_gemma":0.006188413,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006527297,"about_ca_topic_score_gemma":0.007308567,"domain_scores_codex":[0.9667131,0.01231264,0.001919923,0.002526267,0.0141615,0.002366471],"domain_scores_gemma":[0.9734476,0.01009717,0.0007597798,0.003404443,0.01080509,0.001485985],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.002298959,0.001140771,0.003521606,0.003472674,0.0003616443,0.000212982,0.0003529053,0.02607729,0.005467865,0.0637282,0.4056265,0.4877386],"study_design_scores_gemma":[0.0007251049,0.001426428,0.00607145,0.003932602,0.0004410751,0.0005376498,0.000509538,0.1003149,0.02462181,0.05963809,0.8014976,0.0002838607],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1170402,0.1705127,0.2847382,0.03100869,0.01644008,0.002744081,0.04138402,0.03763797,0.2984941],"genre_scores_gemma":[0.3020131,0.04967615,0.3736862,0.008381559,0.004644119,0.002661964,0.1819914,0.02970488,0.04724078],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0270087,"threshold_uncertainty_score":0.1428373,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Wanxia Wei","is_ca":true},{"name":"Chu Min Li","is_ca":false},{"name":"Harry Zhang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06049728746025682,"gpt":0.2991865808051254,"spread":0.2386892933448686,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005304999,0.0006783611,0.001369763,0.00197484,0.000838933,0.001662359,0.001827454,0.001320774,0.004105168],"category_scores_gemma":[0.01653216,0.000447741,0.0007350732,0.001385074,0.0021361,0.002679283,0.003650585,0.002164185,0.0004963356],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001398333,"about_ca_system_score_gemma":0.0007918209,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007062323,"about_ca_topic_score_gemma":0.0008744976,"domain_scores_codex":[0.9976579,0.0009704009,0.0001700345,0.0002970728,0.0006780388,0.0002265053],"domain_scores_gemma":[0.9924204,0.004852464,0.0004710803,0.0008707953,0.0009209926,0.0004642089],"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.0005777077,0.000239088,0.005480198,0.0002688589,0.0001701061,0.0002800067,0.0007641963,0.3354134,0.02365376,0.3355913,0.004243713,0.2933178],"study_design_scores_gemma":[0.0001146478,0.0003053118,0.001185475,0.00004915327,0.00004398203,0.0001493525,0.00007327042,0.867892,0.005356849,0.1223947,0.002388742,0.0000465728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0513768,0.0003342792,0.938663,0.0004254849,0.00003668845,0.0001709166,0.00006120912,0.0004031116,0.008528413],"genre_scores_gemma":[0.6315013,0.0002146283,0.3633893,0.0004457654,0.0001253037,0.0005623744,0.0001760599,0.000284643,0.003300683],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005304999,"threshold_uncertainty_score":0.02805579,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Miguel F. Anjos","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06582800461354198,"gpt":0.267172676926121,"spread":0.201344672312579,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004291086,0.002241384,0.001431425,0.001235165,0.0007449885,0.002554865,0.002355563,0.001658193,0.01004724],"category_scores_gemma":[0.008985318,0.001004769,0.001736865,0.001996575,0.002053334,0.004044949,0.002401141,0.007202327,0.001896036],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001698451,"about_ca_system_score_gemma":0.001482607,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001053536,"about_ca_topic_score_gemma":0.002115388,"domain_scores_codex":[0.9975292,0.001274613,0.0001062094,0.0002864421,0.0006660072,0.0001375186],"domain_scores_gemma":[0.9939443,0.004692768,0.0003209856,0.0003177517,0.0005664595,0.0001576089],"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.00004023317,0.0001454528,0.0001626799,0.0004591538,0.00006895353,0.00008237411,0.0001371609,0.1509815,0.0008823097,0.7864858,0.01309147,0.04746297],"study_design_scores_gemma":[0.00001676169,0.00002659897,0.00004789318,0.00004684436,0.00001031028,0.00004658282,0.00004045877,0.3751034,0.0004466827,0.6171298,0.007069262,0.00001533525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001545431,0.001405801,0.9809566,0.001068131,0.0001382141,0.00004469099,0.0001189589,0.00008232829,0.01463986],"genre_scores_gemma":[0.1986606,0.008938327,0.762917,0.001683399,0.001520906,0.0007968961,0.001105148,0.0005798416,0.0237979],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01004724,"threshold_uncertainty_score":0.03361142,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Alexander Hertel","is_ca":true},{"name":"Alasdair Urquhart","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05055338728897672,"gpt":0.2739712533785834,"spread":0.2234178660896066,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006814409,0.001339341,0.001582536,0.002145363,0.002046832,0.008039156,0.005752695,0.002460674,0.02011345],"category_scores_gemma":[0.03892464,0.000959091,0.003758333,0.003559553,0.003268418,0.01563707,0.005350575,0.007558139,0.001687673],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003152332,"about_ca_system_score_gemma":0.002321385,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001189627,"about_ca_topic_score_gemma":0.001438507,"domain_scores_codex":[0.9874104,0.004169631,0.0008319226,0.001870841,0.004328507,0.001388725],"domain_scores_gemma":[0.9446141,0.04495379,0.001722354,0.006589426,0.001640106,0.0004803472],"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.0003033478,0.0003697995,0.001465299,0.0014836,0.0001742892,0.0002768988,0.0006608172,0.08776175,0.004803831,0.782087,0.005909213,0.1147042],"study_design_scores_gemma":[0.00006439943,0.0000650973,0.0003492657,0.0001303741,0.0001023611,0.0003083348,0.0001901639,0.2561465,0.01074676,0.7251694,0.006684862,0.00004249261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02259606,0.0008080018,0.9567423,0.001672519,0.00006403776,0.0002566633,0.0004281374,0.00108707,0.01634522],"genre_scores_gemma":[0.3303891,0.001553339,0.6569571,0.0006812799,0.0003595124,0.0006456629,0.00153906,0.0008258875,0.007049004],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02011345,"threshold_uncertainty_score":0.06728613,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Miguel F. Anjos","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04658219512101994,"gpt":0.3505630059101519,"spread":0.303980810789132,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003139426,0.001176593,0.0006808022,0.0006043916,0.0005008402,0.001440107,0.001446137,0.000829313,0.007652834],"category_scores_gemma":[0.005826679,0.0006848325,0.001494183,0.0007514943,0.001518288,0.003031297,0.001696658,0.00481453,0.001217604],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008905915,"about_ca_system_score_gemma":0.001058935,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000764162,"about_ca_topic_score_gemma":0.001002585,"domain_scores_codex":[0.9980603,0.0007925613,0.00009871099,0.0003216534,0.0005706314,0.0001560873],"domain_scores_gemma":[0.9974511,0.001593683,0.0002024954,0.0003397709,0.0002981714,0.0001146938],"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.0002454934,0.0002707979,0.0003099505,0.0005602697,0.00008496317,0.0003198697,0.0004373064,0.2281615,0.008291162,0.6438201,0.01154421,0.1059543],"study_design_scores_gemma":[0.00008458431,0.0002025038,0.0001850468,0.0001229076,0.00002907142,0.0002428544,0.00009984362,0.5554534,0.003486414,0.4162477,0.0237962,0.00004950831],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008588866,0.000247073,0.9736909,0.0006390642,0.0001150573,0.0001125013,0.0002222208,0.000197195,0.01618723],"genre_scores_gemma":[0.2224057,0.0008895507,0.7593737,0.0008429088,0.000429719,0.0005727907,0.001181858,0.0002906304,0.01401321],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007652834,"threshold_uncertainty_score":0.02560133,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Srinivasan Arunachalam","is_ca":false},{"name":"Ilias Kotsireas","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03937523132885755,"gpt":0.2920864361888223,"spread":0.2527112048599647,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009975258,0.0007840034,0.0007188983,0.000865557,0.0006826066,0.001773491,0.001642403,0.001055471,0.008841068],"category_scores_gemma":[0.006778875,0.0005734655,0.002226142,0.001307642,0.001084523,0.002078496,0.002189602,0.00350028,0.0007502161],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001324122,"about_ca_system_score_gemma":0.001351042,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002550536,"about_ca_topic_score_gemma":0.004430546,"domain_scores_codex":[0.9980939,0.0005515738,0.0001214135,0.0003790337,0.0005926741,0.0002614244],"domain_scores_gemma":[0.9960845,0.002721925,0.0002813981,0.0005537383,0.0002295739,0.0001289725],"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.0004169741,0.0006180546,0.002508295,0.0006176132,0.0001648308,0.0008443246,0.0005563725,0.2758872,0.01631319,0.6012068,0.02126126,0.07960489],"study_design_scores_gemma":[0.0001770852,0.0001152261,0.000878475,0.00005411887,0.00006750327,0.0003906724,0.000192633,0.3684247,0.01035702,0.6074534,0.01184452,0.00004460579],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2740509,0.0005681146,0.6612709,0.003534677,0.0002128418,0.0005993932,0.003372569,0.00218917,0.05420151],"genre_scores_gemma":[0.7212376,0.0003250774,0.2616428,0.0008452841,0.0001419742,0.0004875436,0.004130758,0.0006661967,0.01052281],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008841068,"threshold_uncertainty_score":0.0295763,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}