{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":3,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":3,"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":"f5197417711c","filters":{"venue":"Symposium on Abstraction, Reformulation and Approximation"}},"results":[{"id":"W2240863283","doi":"","title":"New Encoding for Translating Pseudo-Boolean Constraints into SAT.","year":2013,"lang":"en","type":"article","venue":"Symposium on Abstraction, Reformulation and Approximation","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Constraint (computer-aided design); Conjunctive normal form; Constraint satisfaction problem; Local consistency; Computer science; Benchmark (surveying); Boolean data type; Propositional calculus; Propositional formula; Set (abstract data type); Transformation (genetics); Boolean function; Propositional variable; Theoretical computer science; Algorithm; Mathematics; Programming language; Artificial intelligence","authors":[{"name":"Amir Aavani","is_ca":true},{"name":"David G. M. Mitchell","is_ca":true},{"name":"Eugenia Ternovska","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01249991234013407,"gpt":0.2465829138286467,"spread":0.2340830014885127,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002717334,0.0002066055,0.0001620799,0.0002372748,0.0004275239,0.0004049863,0.0001275107,0.0001384804,0.0001315128],"category_scores_gemma":[0.00005280319,0.0001944611,0.00007229551,0.0002312795,0.0000398584,0.002069647,0.00001694383,0.0001408464,0.00005879107],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001199607,"about_ca_system_score_gemma":0.00007857438,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006502718,"about_ca_topic_score_gemma":0.00002135155,"domain_scores_codex":[0.9985836,0.00003501809,0.0005020507,0.0004230547,0.0002289709,0.0002273537],"domain_scores_gemma":[0.9990175,0.0001197461,0.0002813809,0.0002279727,0.0001885894,0.0001647951],"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.0000247554,0.00005611175,0.0008306867,0.00009059781,0.00002836556,2.312043e-7,0.003060259,0.01041043,0.04812656,0.1309989,0.0003722988,0.8060008],"study_design_scores_gemma":[0.002074114,0.0001964121,0.02584804,0.0001012245,0.00002271458,0.00004376244,0.0005495947,0.9304955,0.0101308,0.02848372,0.00144264,0.0006114474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02150617,0.00000573027,0.9635247,0.005279201,0.0003698514,0.0009729256,0.000002524348,0.0003054147,0.008033492],"genre_scores_gemma":[0.8633848,0.00001420456,0.1358161,0.0002219395,0.0001194449,0.00006152051,0.00006438823,0.00001460465,0.0003029479],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9200851,"threshold_uncertainty_score":0.7929895,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2262254779","doi":"","title":"Modeling, Global Constraints, and Decomposition","year":2013,"lang":"en","type":"article","venue":"Symposium on Abstraction, Reformulation and Approximation","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"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":"Constraint programming; Computer science; Constraint (computer-aided design); Mathematical optimization; Decomposition; Constraint satisfaction problem; Solver; Theoretical computer science; Local consistency; Concurrent constraint logic programming; Combinatorial optimization; Constraint logic programming; Constraint satisfaction; Mathematics; Artificial intelligence; Algorithm; Programming language; Stochastic programming","authors":[{"name":"J. Christopher Beck","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009107650882841841,"gpt":0.2477117496452006,"spread":0.2386040987623588,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001612953,0.0001705546,0.000122654,0.0001244497,0.0002934969,0.0003981705,0.00007605788,0.0001185899,0.00006746987],"category_scores_gemma":[0.00001584661,0.0001576283,0.00003089867,0.0001906458,0.00005740197,0.001895077,0.00003059549,0.0001094952,0.00005487513],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001142333,"about_ca_system_score_gemma":0.00002878372,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006984662,"about_ca_topic_score_gemma":0.00001122395,"domain_scores_codex":[0.998866,0.00004223566,0.0003519589,0.0003698031,0.000201371,0.0001686362],"domain_scores_gemma":[0.9993474,0.00002429289,0.000135818,0.0001906792,0.0001714899,0.0001302542],"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.00003031462,0.0001682324,0.003888276,0.00007610824,0.00003922942,9.251019e-7,0.0006781284,0.08703083,0.006296783,0.4451485,0.0001484569,0.4564942],"study_design_scores_gemma":[0.0004911028,0.00005380585,0.03773259,0.00002220815,0.000006392071,0.00006618529,0.00007910512,0.9519379,0.000268848,0.009074261,0.00007766865,0.0001899805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2317941,0.00001211884,0.7566571,0.002918846,0.0002080296,0.0004774891,0.000003899549,0.0002636393,0.007664801],"genre_scores_gemma":[0.9821751,0.0000689544,0.01728592,0.000289693,0.00004307873,0.00003506007,0.00004735228,0.000006732408,0.00004813656],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.864907,"threshold_uncertainty_score":0.6427894,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2248206634","doi":"","title":"Position Paper: Representation Search through Generate and Test","year":2013,"lang":"en","type":"article","venue":"Symposium on Abstraction, Reformulation and Approximation","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Representation (politics); Artificial intelligence; Machine learning; Feature learning; Search problem; Simple (philosophy); Artificial neural network; Element (criminal law); Theoretical computer science; Algorithm","authors":[{"name":"Ashique Rupam Mahmood","is_ca":true},{"name":"Richard S. Sutton","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02071115116405118,"gpt":0.2661946017112756,"spread":0.2454834505472244,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000275599,0.0001687269,0.0001274456,0.0001514626,0.00045449,0.0005830432,0.00009643418,0.0001092083,0.00005648564],"category_scores_gemma":[0.00005515839,0.0001511025,0.00003128224,0.0002969173,0.00004186517,0.003812754,0.0000398374,0.0001787229,0.0001165354],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008070852,"about_ca_system_score_gemma":0.00002288612,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000128193,"about_ca_topic_score_gemma":0.000004299545,"domain_scores_codex":[0.9985827,0.00008688017,0.0003702921,0.0004426073,0.0003156593,0.0002018971],"domain_scores_gemma":[0.999091,0.0001472775,0.0001909386,0.0002549729,0.0002149645,0.000100831],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005737283,0.0003936681,0.006773103,0.0001458888,0.00004653626,0.000002964725,0.008208727,0.01832294,0.3926057,0.3654197,0.0006685655,0.2073548],"study_design_scores_gemma":[0.001227727,0.0002591506,0.2891486,0.0000510243,0.00001280942,0.00007547244,0.0005904458,0.6746682,0.01767965,0.01375986,0.002083007,0.0004440689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6845753,0.00005111847,0.278189,0.01643367,0.0003430473,0.001205646,0.000003884062,0.0005031876,0.01869518],"genre_scores_gemma":[0.9836585,0.0001568633,0.01460902,0.0006888793,0.00009958699,0.0000575293,0.00008350636,0.0000141577,0.0006319503],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6563452,"threshold_uncertainty_score":0.6161783,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}