{"meta":{"query_hash":"d01fbe005067","filters":{"venue":"Theory and Applications of Satisfiability Testing"},"cohort_total":5,"direct_labels_cover":0,"predictions_cover":5,"exported":5,"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/d01fbe005067","api":"https://metacan.xera.ac/api/v1/cohort?venue=Theory+and+Applications+of+Satisfiability+Testing"},"results":[{"id":"W1545528108","doi":"","title":"Network Modulation : A New Dimension to Enhance Wireless Network Performance","year":2011,"lang":"en","type":"article","venue":"Theory and Applications of Satisfiability Testing","topic":"Cooperative Communication and Network Coding","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 Victoria","funders":"","keywords":"Computer science; Dimension (graph theory); Modulation (music); Wireless network; Computer network; Wireless WAN; Wireless; Radio networks; Telecommunications; Key distribution in wireless sensor networks; Physics; Mathematics","score_opus":0.039141049212891,"score_gpt":0.2722447304205683,"score_spread":0.2331036812076773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1545528108","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.033975843,0.0046035093,0.9343942,0.004975912,0.00042005547,0.00006410028,0.000109499255,0.00045517884,0.021001764],"genre_scores_gemma":[0.81871825,0.0040578023,0.16878979,0.0011654339,0.0011632314,0.00010908431,0.00011769802,0.00013195665,0.0057468265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831367,0.0006097707,0.000066861816,0.00017746694,0.00070125906,0.00013085503],"domain_scores_gemma":[0.99157274,0.0057036714,0.00049095316,0.0012440861,0.0008327289,0.0001558816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002098793,0.0007606811,0.001079466,0.0010155414,0.0005677341,0.0023273604,0.0017256383,0.0012729567,0.004257717],"category_scores_gemma":[0.0127660725,0.00029529788,0.00029716158,0.0012105947,0.0019288126,0.0058842446,0.0019597122,0.002067056,0.00057600206],"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.00036439532,0.00021976729,0.0021639634,0.00044609958,0.00009680159,0.00016663356,0.00027685123,0.073014885,0.041757654,0.5620552,0.0059578726,0.3134799],"study_design_scores_gemma":[0.00008015411,0.00036782635,0.00073213887,0.00018540716,0.00009388444,0.0004335616,0.00010348189,0.47719172,0.01775224,0.48087502,0.022112742,0.00007183913],"about_ca_topic_score_codex":0.0004962615,"about_ca_topic_score_gemma":0.00064095866,"teacher_disagreement_score":0.004257717,"about_ca_system_score_codex":0.000876382,"about_ca_system_score_gemma":0.0008905343,"threshold_uncertainty_score":0.014243484},"labels":[],"label_agreement":null},{"id":"W2403478642","doi":"","title":"Single-Solver Algorithms for 2QBF (Poster Presentation)","year":2012,"lang":"en","type":"article","venue":"Theory and Applications of Satisfiability Testing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"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 British Columbia","funders":"","keywords":"Solver; Computer science; Boolean satisfiability problem; DPLL algorithm; Algorithm; Heuristic; Set (abstract data type); Satisfiability; Theoretical computer science; Programming language; Artificial intelligence","score_opus":0.07232481774454069,"score_gpt":0.3347471103248786,"score_spread":0.2624222925803379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403478642","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.0026419307,0.0003715158,0.97949433,0.0006772727,0.00012388651,0.00020856076,0.0007255934,0.008416913,0.0073399562],"genre_scores_gemma":[0.042477846,0.00020579442,0.9454821,0.00042436685,0.00007444621,0.00043286264,0.0022318638,0.0018541825,0.006816601],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974571,0.0005930895,0.0002142404,0.0007182614,0.0006791535,0.00033814434],"domain_scores_gemma":[0.99488527,0.0028363122,0.00025903934,0.0010983002,0.0007835668,0.00013754799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002173395,0.0022979677,0.0012637145,0.0013483923,0.0012402608,0.0032835978,0.0035446486,0.002689337,0.07364502],"category_scores_gemma":[0.010779339,0.0013881907,0.0026432225,0.0022499035,0.0009986165,0.005795626,0.0046352195,0.003368626,0.018123308],"study_design_candidate":"not_applicable","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.00036617028,0.00032361288,0.001214806,0.000982464,0.00012927546,0.0002281929,0.00035189473,0.101249024,0.004661599,0.18645604,0.07742125,0.6266157],"study_design_scores_gemma":[0.00030128978,0.00006401037,0.00023465301,0.00010951494,0.000051457228,0.00018942256,0.00009590693,0.61186874,0.004812715,0.3459548,0.03627492,0.000042579955],"about_ca_topic_score_codex":0.0059215017,"about_ca_topic_score_gemma":0.011574902,"teacher_disagreement_score":0.07364502,"about_ca_system_score_codex":0.002851749,"about_ca_system_score_gemma":0.0033778853,"threshold_uncertainty_score":0.24636716},"labels":[],"label_agreement":null},{"id":"W2911534100","doi":"","title":"Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing","year":2004,"lang":"en","type":"article","venue":"Theory and Applications of Satisfiability Testing","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of British Columbia","funders":"","keywords":"Satisfiability; Computer science; Theoretical computer science; Programming language","score_opus":0.11405158357332226,"score_gpt":0.3873354442747253,"score_spread":0.2732838607014031,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911534100","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01205186,0.063867934,0.7813469,0.014427023,0.03415942,0.0003155432,0.00056735624,0.0010117899,0.09225216],"genre_scores_gemma":[0.19881542,0.06201309,0.5285864,0.004256598,0.02887857,0.0007444901,0.0038698025,0.0012650243,0.17157063],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99508625,0.002013691,0.0003848695,0.0006440429,0.0015362543,0.00033494885],"domain_scores_gemma":[0.989611,0.005471617,0.00026683943,0.0014603639,0.0024718787,0.00071829377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00828847,0.0015780696,0.0029631555,0.002332092,0.0010869411,0.0070967474,0.002498361,0.002393191,0.02991711],"category_scores_gemma":[0.013427692,0.00089227373,0.0020497942,0.002107628,0.002911796,0.004446982,0.0022867576,0.0049231877,0.0054038162],"study_design_candidate":"not_applicable","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.00086493423,0.0005266036,0.001645849,0.00075795484,0.000384255,0.00048003395,0.00052420003,0.015468695,0.0052940683,0.18047006,0.1844068,0.6091766],"study_design_scores_gemma":[0.00018451932,0.0004476861,0.0023191313,0.0007365928,0.00033619764,0.0010393971,0.00033414745,0.13998607,0.0052346773,0.29774326,0.55150616,0.00013211118],"about_ca_topic_score_codex":0.004284677,"about_ca_topic_score_gemma":0.004129018,"teacher_disagreement_score":0.02991711,"about_ca_system_score_codex":0.0023315283,"about_ca_system_score_gemma":0.0031332984,"threshold_uncertainty_score":0.100082755},"labels":[],"label_agreement":null},{"id":"W2912010915","doi":"","title":"Theory and Applications of Satisfiability Testing: 7th International Conference, SAT 2004, Vancouver, BC, Canada, May 10-13, 2004, Revised Selected Papers (Lecture Notes in Computer Science)","year":2005,"lang":"en","type":"article","venue":"Theory and Applications of Satisfiability Testing","topic":"Software Reliability and Analysis Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Satisfiability; Computer science; Mathematics education; Theoretical computer science; Library science; Mathematics","score_opus":0.013809007036564742,"score_gpt":0.265525670005974,"score_spread":0.25171666296940926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912010915","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008170591,0.20569511,0.6919751,0.02313071,0.006271405,0.00018493115,0.00089583034,0.0016067809,0.062069573],"genre_scores_gemma":[0.18072931,0.1954842,0.54307896,0.0032473363,0.009947843,0.0005154476,0.004413015,0.0010753049,0.061508656],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9956612,0.0011838973,0.00033236816,0.0006694871,0.0018765489,0.0002765857],"domain_scores_gemma":[0.98993146,0.005485975,0.0002505196,0.001013953,0.002816758,0.0005013086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006291431,0.0019062798,0.0022094788,0.005212774,0.0015272937,0.007637015,0.0028105942,0.002188033,0.014563576],"category_scores_gemma":[0.012521279,0.002460088,0.001459442,0.0070124227,0.0063837487,0.0056598173,0.002386737,0.005581865,0.0025440678],"study_design_candidate":"not_applicable","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.00017143459,0.00018112868,0.0023862303,0.0008395746,0.00014321328,0.00016192881,0.0003489904,0.027336301,0.0023632096,0.28464693,0.12499013,0.5564309],"study_design_scores_gemma":[0.00008338552,0.00012200899,0.0029107144,0.00087939814,0.00017716347,0.00072513125,0.00028131262,0.16097721,0.0032694673,0.5416059,0.28887635,0.00009194855],"about_ca_topic_score_codex":0.030571492,"about_ca_topic_score_gemma":0.031746592,"teacher_disagreement_score":0.030571492,"about_ca_system_score_codex":0.007809036,"about_ca_system_score_gemma":0.00816162,"threshold_uncertainty_score":0.06078708},"labels":[],"label_agreement":null},{"id":"W2914729178","doi":"","title":"Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing","year":2005,"lang":"en","type":"article","venue":"Theory and Applications of Satisfiability Testing","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trinity College; University of Toronto","funders":"","keywords":"Satisfiability; Computer science; Theoretical computer science","score_opus":0.11442289335141183,"score_gpt":0.39109894401829093,"score_spread":0.2766760506668791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914729178","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011541965,0.057707913,0.7909264,0.013733016,0.031671684,0.00031006942,0.00055990077,0.0009558064,0.092593275],"genre_scores_gemma":[0.20054099,0.05562366,0.5367871,0.004164632,0.026700424,0.00072421995,0.0037205846,0.001179965,0.17055836],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9952277,0.001944962,0.00037476447,0.0006261787,0.0014938624,0.00033241103],"domain_scores_gemma":[0.9901867,0.0051472667,0.00025139304,0.0013814352,0.0023817432,0.0006514242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008147174,0.0015546408,0.0028729516,0.002321268,0.0010718115,0.0070442907,0.0025273028,0.0022965567,0.03141949],"category_scores_gemma":[0.01331957,0.0008771,0.0020044004,0.0020297302,0.0027709221,0.0042896294,0.0023140626,0.0049112234,0.0054274965],"study_design_candidate":"not_applicable","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.00079874834,0.000521793,0.0015521881,0.00073851156,0.0003721398,0.00047335267,0.0005209231,0.015817882,0.005099199,0.18765664,0.17834343,0.6081051],"study_design_scores_gemma":[0.00018782743,0.00042693163,0.0023106164,0.00072975375,0.00032134252,0.0010134797,0.0003220618,0.14943331,0.005226894,0.30975413,0.5301364,0.0001372234],"about_ca_topic_score_codex":0.0041897455,"about_ca_topic_score_gemma":0.0040224516,"teacher_disagreement_score":0.03141949,"about_ca_system_score_codex":0.0023334723,"about_ca_system_score_gemma":0.0030974315,"threshold_uncertainty_score":0.10510868},"labels":[],"label_agreement":null}]}