{"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24938191,0.0002268235,0.7473264,0.0001173341,0.000027491791,0.0004504566,5.1611386e-7,0.00011881247,0.0023502917],"genre_scores_gemma":[0.83063865,0.00004060563,0.16893023,0.00016233324,0.00008599452,0.0000750783,0.0000015125888,0.000006304472,0.00005929209],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875396,0.00021801138,0.00035316218,0.0003469179,0.00010725654,0.00022066588],"domain_scores_gemma":[0.9979486,0.0007466911,0.00015635372,0.0008598247,0.00017278912,0.000115739706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015733291,0.00012551897,0.00017365062,0.00003724318,0.0004010969,0.000028764485,0.00051722024,0.000040716368,0.0000129615755],"category_scores_gemma":[0.00013790447,0.00012558754,0.000020784424,0.0009686204,0.00008723722,0.00027605696,0.00043502613,0.00012043646,0.000007824563],"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.000013613521,0.000026598747,0.009199713,0.000014492317,0.000004092301,3.3481534e-8,0.0007204666,0.0029864423,0.0007456951,0.31344467,0.000059844828,0.6727843],"study_design_scores_gemma":[0.00026194085,0.0002887884,0.29556695,0.00042067046,0.000024884583,0.000008563193,0.00006503349,0.19270502,0.003322607,0.50543463,0.0012617629,0.0006391304],"about_ca_topic_score_codex":0.000014648574,"about_ca_topic_score_gemma":0.000009586831,"teacher_disagreement_score":0.6721452,"about_ca_system_score_codex":0.00001997298,"about_ca_system_score_gemma":0.000048826314,"threshold_uncertainty_score":0.5121311},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031294398,0.00012318016,0.96621805,0.000062857274,0.000051220617,0.00072406576,0.0000121767425,0.000093807925,0.001420217],"genre_scores_gemma":[0.41558835,6.5757854e-7,0.58405155,0.00003515738,0.000058861744,0.00024313922,0.000002601813,0.0000045180723,0.000015173505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899566,0.00017035729,0.0003069691,0.00022825677,0.000107536594,0.00019123922],"domain_scores_gemma":[0.9964233,0.002622175,0.00017871814,0.0005284967,0.00017788682,0.000069413356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026458413,0.00009112584,0.00012082229,0.00005093918,0.00017141843,0.000035405636,0.00025084475,0.000044520213,0.000007674213],"category_scores_gemma":[0.001253021,0.000088530986,0.00003009638,0.00026424156,0.00016625671,0.00069684937,0.00011911045,0.000059039845,0.0000034624984],"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.0000045709508,0.00008322503,0.0038291155,0.000060547816,0.0000044922263,5.790359e-9,0.00043250388,0.00000798896,0.0037348468,0.6203495,0.000004608587,0.37148857],"study_design_scores_gemma":[0.00035706395,0.00013123886,0.051170763,0.00003012312,0.00003534873,0.000016844679,0.00021674659,0.0069157244,0.044622127,0.8937448,0.002463171,0.0002960217],"about_ca_topic_score_codex":0.0000057928523,"about_ca_topic_score_gemma":2.0175568e-7,"teacher_disagreement_score":0.38429394,"about_ca_system_score_codex":0.00002022204,"about_ca_system_score_gemma":0.000016817474,"threshold_uncertainty_score":0.36101887},"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":"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.951317,0.00006176134,0.03745164,0.00024874334,0.0000348781,0.0013977311,0.00016309584,0.000047219386,0.0092779165],"genre_scores_gemma":[0.9744726,0.000004461707,0.02516764,0.000047407742,0.0000495836,0.00020793764,0.0000018604028,0.000013281861,0.00003522174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963791,0.00030180434,0.0014636376,0.0007552824,0.00089509354,0.00020510901],"domain_scores_gemma":[0.97792435,0.01758469,0.0013920477,0.0009883149,0.0020024187,0.00010819406],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.012169705,0.00022396228,0.00046176426,0.00021834452,0.0003442945,0.000097903816,0.0011008697,0.00010321916,0.00008066932],"category_scores_gemma":[0.026251072,0.00016309436,0.00008216904,0.0013520219,0.0017116178,0.0002853253,0.00056054874,0.00025216347,0.0000033676847],"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.000061756175,0.00016834687,0.08498379,0.000074499105,0.000012543463,3.1275274e-8,0.0005931867,0.00018082584,0.02212686,0.6962647,0.0000026341347,0.19553082],"study_design_scores_gemma":[0.00031746132,0.000054792617,0.16644691,0.00016161748,0.00002463156,0.000007674851,0.0018541749,0.00047837946,0.004122901,0.82634914,0.000055901877,0.0001264007],"about_ca_topic_score_codex":0.0000583432,"about_ca_topic_score_gemma":0.000008049067,"teacher_disagreement_score":0.19540441,"about_ca_system_score_codex":0.00004793584,"about_ca_system_score_gemma":0.00013960079,"threshold_uncertainty_score":0.98195124},"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":"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.22192778,0.00042088173,0.7746386,0.00044123133,0.00003180078,0.0013732406,0.00009993062,0.00013150151,0.0009350285],"genre_scores_gemma":[0.9345054,0.00002062845,0.06508345,0.00007159125,0.000073313175,0.00018916011,0.000015335754,0.000011198457,0.000029924151],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99622315,0.000625267,0.0009590121,0.0010516075,0.00068241294,0.00045856123],"domain_scores_gemma":[0.98755777,0.009204621,0.00041534496,0.0011039006,0.0014935688,0.00022479199],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.006230524,0.0002921986,0.000518175,0.0003336956,0.00043359742,0.00011837754,0.0011373359,0.000117523094,0.00011638523],"category_scores_gemma":[0.0059459493,0.00027557416,0.000055606037,0.0032215524,0.0016841722,0.0004271364,0.0004823722,0.00036334505,0.0000019599397],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041469528,0.00029201218,0.16932334,0.0002519099,0.000037377547,3.8570852e-7,0.0003644046,0.0057649086,0.0030301218,0.026411071,0.000021690335,0.7944613],"study_design_scores_gemma":[0.0017887284,0.00027692493,0.35580942,0.00044031735,0.00011994576,0.000027008862,0.0003726513,0.20945194,0.0061374903,0.42256275,0.0017176161,0.0012952201],"about_ca_topic_score_codex":0.011120538,"about_ca_topic_score_gemma":0.021895345,"teacher_disagreement_score":0.7931661,"about_ca_system_score_codex":0.000260376,"about_ca_system_score_gemma":0.0014261623,"threshold_uncertainty_score":0.99996966},"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":"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.9617162,0.000082552215,0.021506744,0.00034820123,0.000029753668,0.0014039361,0.00016908858,0.000049892486,0.014693677],"genre_scores_gemma":[0.9685466,0.0000050263843,0.031008577,0.000059753947,0.000080390004,0.00020707518,0.000001756764,0.000013175404,0.000077630124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962449,0.00037946677,0.0015351616,0.0007476415,0.000885239,0.00020757136],"domain_scores_gemma":[0.9731753,0.02237291,0.0014065102,0.0009854332,0.0019529863,0.00010686851],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.013496848,0.00022291638,0.00046064018,0.00021945695,0.00033121827,0.00009883671,0.0011159746,0.00010201048,0.00015344642],"category_scores_gemma":[0.024658011,0.00016248932,0.00008184443,0.001211717,0.0015297165,0.00032664105,0.000569203,0.00025144476,0.0000046643963],"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.000054453434,0.00014173896,0.09653308,0.00005481423,0.000010458618,1.373736e-8,0.00046995672,0.00008483041,0.017261606,0.49667528,0.000008089682,0.38870567],"study_design_scores_gemma":[0.0002803645,0.0000495817,0.19102806,0.00014120617,0.000028992965,0.000007768589,0.0017473018,0.0027775338,0.004076818,0.79941136,0.00029695852,0.00015408128],"about_ca_topic_score_codex":0.000028569602,"about_ca_topic_score_gemma":0.000008555808,"teacher_disagreement_score":0.3885516,"about_ca_system_score_codex":0.000040540872,"about_ca_system_score_gemma":0.00009811691,"threshold_uncertainty_score":0.9835577},"labels":[],"label_agreement":null}]}