{"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":"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.0031780603,0.00022292077,0.97481865,0.00066426175,0.00038534895,0.00030919455,0.002345433,0.00619365,0.011882563],"genre_scores_gemma":[0.056318384,0.00036757675,0.9302328,0.0004918491,0.00012292546,0.0005267811,0.004829142,0.0011984176,0.0059121912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998251,0.0003792192,0.0002185564,0.00025298787,0.00071709737,0.00018102242],"domain_scores_gemma":[0.9974825,0.0011721608,0.00016831719,0.00054035656,0.0005653944,0.000071213595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009989329,0.0012013271,0.0006370039,0.0016593887,0.00069687894,0.002156643,0.0020452996,0.0012126773,0.015826797],"category_scores_gemma":[0.0072545586,0.0007276554,0.0018104394,0.0024019936,0.0010227511,0.0036880684,0.0020186557,0.0030268894,0.0039346223],"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.00024647947,0.00032409152,0.0007079037,0.00093488744,0.00007119938,0.0006011703,0.00052632956,0.051951684,0.009577032,0.46881238,0.0571624,0.40908444],"study_design_scores_gemma":[0.00020245928,0.00014217306,0.00036175246,0.0003463949,0.000106618965,0.0007465679,0.00024486013,0.48010448,0.024739478,0.314988,0.17790788,0.00010938348],"about_ca_topic_score_codex":0.003981939,"about_ca_topic_score_gemma":0.00972398,"teacher_disagreement_score":0.015826797,"about_ca_system_score_codex":0.001578767,"about_ca_system_score_gemma":0.0023471285,"threshold_uncertainty_score":0.052945912},"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":"methods","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011414085,0.0014165704,0.96779233,0.0045853066,0.001126055,0.00018638161,0.00027898277,0.0025943117,0.0106060915],"genre_scores_gemma":[0.27596632,0.0015100101,0.6810084,0.003276294,0.0022268463,0.00042770535,0.002250452,0.002058638,0.031275373],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972658,0.0012116275,0.000105043335,0.000644381,0.0006214345,0.00015167409],"domain_scores_gemma":[0.9875416,0.008439149,0.0004286664,0.0019809287,0.0011980929,0.00041154466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048813066,0.0011005858,0.0012660325,0.0009628958,0.00085940695,0.0027241898,0.0030293483,0.0031226405,0.015098417],"category_scores_gemma":[0.028397538,0.0005347329,0.0008767353,0.0011396647,0.0020667512,0.007429593,0.0019004452,0.003272427,0.004638122],"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.00049451203,0.00043645655,0.0017951448,0.00028287966,0.00011819392,0.00011639734,0.00019667535,0.115689285,0.0031172459,0.17880078,0.08833967,0.61061275],"study_design_scores_gemma":[0.00014677552,0.0003397799,0.00042224512,0.000091289134,0.00006440333,0.00021935577,0.000054915457,0.79934996,0.008358265,0.15368098,0.03720992,0.00006215139],"about_ca_topic_score_codex":0.0019483782,"about_ca_topic_score_gemma":0.0015180634,"teacher_disagreement_score":0.015098417,"about_ca_system_score_codex":0.001510054,"about_ca_system_score_gemma":0.0017916637,"threshold_uncertainty_score":0.050509274},"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":"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.0031624972,0.0012382941,0.9782728,0.0013982925,0.00007860266,0.000053280815,0.00021361897,0.00030641118,0.015276184],"genre_scores_gemma":[0.19199228,0.004039382,0.790016,0.00088992604,0.00034149503,0.00045604486,0.00115309,0.0005423621,0.010569414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99655044,0.0014950841,0.00020866719,0.00070626277,0.0007355564,0.00030404355],"domain_scores_gemma":[0.9978739,0.0008558648,0.00015856171,0.00076283,0.00023910891,0.00010974654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028769579,0.0011515438,0.00090542407,0.0012042085,0.0008718997,0.0044869767,0.0020375533,0.0014571644,0.006195673],"category_scores_gemma":[0.005759105,0.0008545426,0.0016023421,0.0025277475,0.004183811,0.007993332,0.0039478755,0.004573026,0.0010746993],"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.000012577401,0.0000098823075,0.00011562213,0.00009853619,0.00001711592,0.00004101172,0.0001675473,0.022829158,0.0003879849,0.9550521,0.0022719859,0.018996432],"study_design_scores_gemma":[0.000007398307,0.000009324648,0.00006185619,0.00006996195,0.000018645676,0.0000452733,0.00008073587,0.05199279,0.0006481299,0.9245219,0.022532552,0.000011388899],"about_ca_topic_score_codex":0.004140526,"about_ca_topic_score_gemma":0.004245706,"teacher_disagreement_score":0.006195673,"about_ca_system_score_codex":0.0018446284,"about_ca_system_score_gemma":0.0020153287,"threshold_uncertainty_score":0.020726562},"labels":[],"label_agreement":null}]}