{"meta":{"query_hash":"f5197417711c","filters":{"venue":"Symposium on Abstraction, Reformulation and Approximation"},"cohort_total":3,"direct_labels_cover":0,"predictions_cover":3,"exported":3,"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/f5197417711c","api":"https://metacan.xera.ac/api/v1/cohort?venue=Symposium+on+Abstraction%2C+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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012499912340134072,"score_gpt":0.24658291382864672,"score_spread":0.23408300148851266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2240863283","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.021506172,0.0000057302695,0.9635247,0.0052792006,0.00036985145,0.0009729256,0.0000025243478,0.00030541467,0.008033492],"genre_scores_gemma":[0.86338484,0.000014204558,0.1358161,0.00022193954,0.00011944491,0.00006152051,0.00006438823,0.000014604648,0.00030294785],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858356,0.000035018085,0.0005020507,0.00042305468,0.0002289709,0.00022735368],"domain_scores_gemma":[0.99901754,0.000119746095,0.00028138087,0.00022797269,0.00018858936,0.00016479507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027173344,0.00020660547,0.00016207992,0.00023727477,0.00042752392,0.00040498635,0.00012751069,0.00013848045,0.00013151279],"category_scores_gemma":[0.000052803185,0.00019446113,0.00007229551,0.00023127954,0.000039858398,0.002069647,0.000016943834,0.0001408464,0.000058791073],"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.000024755398,0.000056111752,0.00083068665,0.00009059781,0.000028365555,2.3120431e-7,0.0030602587,0.010410429,0.04812656,0.13099888,0.0003722988,0.8060008],"study_design_scores_gemma":[0.002074114,0.00019641206,0.025848042,0.00010122446,0.000022714577,0.000043762437,0.0005495947,0.9304955,0.010130805,0.02848372,0.0014426399,0.00061144744],"about_ca_topic_score_codex":0.00006502718,"about_ca_topic_score_gemma":0.000021351545,"teacher_disagreement_score":0.9200851,"about_ca_system_score_codex":0.00011996071,"about_ca_system_score_gemma":0.000078574376,"threshold_uncertainty_score":0.7929895},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02071115116405118,"score_gpt":0.26619460171127557,"score_spread":0.2454834505472244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2248206634","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.68457526,0.000051118473,0.27818897,0.01643367,0.00034304726,0.0012056462,0.0000038840617,0.0005031876,0.018695181],"genre_scores_gemma":[0.9836585,0.00015686326,0.014609016,0.00068887934,0.000099586985,0.000057529298,0.00008350636,0.0000141577,0.0006319503],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858266,0.000086880165,0.00037029205,0.00044260733,0.00031565927,0.00020189708],"domain_scores_gemma":[0.999091,0.00014727752,0.00019093859,0.0002549729,0.00021496454,0.000100830985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000275599,0.00016872693,0.00012744563,0.00015146258,0.00045449004,0.0005830432,0.00009643418,0.0001092083,0.000056485642],"category_scores_gemma":[0.00005515839,0.00015110255,0.000031282245,0.00029691728,0.000041865173,0.0038127538,0.000039837403,0.00017872285,0.00011653538],"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.000057372832,0.00039366813,0.006773103,0.00014588881,0.000046536257,0.000002964725,0.0082087265,0.018322945,0.39260566,0.36541972,0.0006685655,0.20735484],"study_design_scores_gemma":[0.0012277269,0.00025915058,0.2891486,0.0000510243,0.000012809421,0.00007547244,0.00059044576,0.6746682,0.017679647,0.013759863,0.0020830068,0.0004440689],"about_ca_topic_score_codex":0.00012819302,"about_ca_topic_score_gemma":0.000004299545,"teacher_disagreement_score":0.65634525,"about_ca_system_score_codex":0.00008070852,"about_ca_system_score_gemma":0.000022886115,"threshold_uncertainty_score":0.6161783},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.009107650882841841,"score_gpt":0.24771174964520062,"score_spread":0.23860409876235877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2262254779","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.23179407,0.000012118841,0.7566571,0.0029188462,0.00020802961,0.00047748905,0.000003899549,0.00026363932,0.0076648006],"genre_scores_gemma":[0.98217505,0.0000689544,0.017285924,0.00028969295,0.000043078726,0.00003506007,0.00004735228,0.000006732408,0.000048136557],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998866,0.000042235657,0.0003519589,0.00036980314,0.00020137096,0.00016863624],"domain_scores_gemma":[0.99934745,0.000024292889,0.00013581802,0.00019067917,0.00017148985,0.00013025418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016129535,0.00017055462,0.000122654,0.00012444967,0.00029349685,0.00039817052,0.00007605788,0.000118589865,0.00006746987],"category_scores_gemma":[0.000015846608,0.00015762827,0.00003089867,0.00019064582,0.000057401972,0.0018950766,0.000030595485,0.00010949516,0.000054875127],"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.000030314619,0.00016823244,0.0038882762,0.00007610824,0.000039229417,9.251019e-7,0.0006781284,0.08703083,0.0062967828,0.4451485,0.00014845691,0.4564942],"study_design_scores_gemma":[0.0004911028,0.00005380585,0.03773259,0.000022208145,0.0000063920706,0.00006618529,0.00007910512,0.95193785,0.000268848,0.009074261,0.00007766865,0.00018998052],"about_ca_topic_score_codex":0.00006984662,"about_ca_topic_score_gemma":0.000011223946,"teacher_disagreement_score":0.864907,"about_ca_system_score_codex":0.00011423326,"about_ca_system_score_gemma":0.000028783717,"threshold_uncertainty_score":0.6427894},"labels":[],"label_agreement":null}]}