{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":1,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":1,"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":"e264deb27c80","filters":{"venue":"2022 27th Asia and South Pacific Design Automation Conference (ASP-DAC)"}},"results":[{"id":"W4213347724","doi":"10.1109/asp-dac52403.2022.9712571","title":"CGRA Mapping Using Zero-Suppressed Binary Decision Diagrams","year":2022,"lang":"en","type":"article","venue":"2022 27th Asia and South Pacific Design Automation Conference (ASP-DAC)","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":7,"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":"Binary decision diagram; Enumeration; Speedup; Computer science; Routing (electronic design automation); Binary number; Linear programming; Integer programming; Integer (computer science); Parallel computing; Zero (linguistics); Theoretical computer science; Algorithm; Mathematical optimization; Mathematics; Discrete mathematics; Programming language; Arithmetic","authors":[{"name":"Rami Beidas","is_ca":true},{"name":"Jason H. Anderson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05438602426746155,"gpt":0.2594936338598557,"spread":0.2051076095923942,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002414835,0.0004961859,0.0006034382,0.0007475752,0.001227648,0.0008426927,0.001370317,0.0001951473,0.0002159089],"category_scores_gemma":[0.0001743124,0.000515428,0.0001520518,0.001397932,0.0001189317,0.001099111,0.0007816007,0.0005543086,0.00005289692],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002477693,"about_ca_system_score_gemma":0.0004398858,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002647398,"about_ca_topic_score_gemma":0.000001066757,"domain_scores_codex":[0.9944971,0.001431582,0.0009456671,0.00118031,0.001227273,0.0007181044],"domain_scores_gemma":[0.9971799,0.0004802011,0.000612828,0.001201965,0.0002466431,0.0002784197],"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.0003931558,0.001126672,0.01091923,0.000772724,0.0005160756,0.0011124,0.1565355,0.014687,0.3245295,0.1495936,0.04104452,0.2987697],"study_design_scores_gemma":[0.0007280322,0.0003485515,0.001323828,0.0001711731,0.00002927355,0.0001657196,0.006021319,0.973988,0.002091984,0.01240977,0.00188935,0.0008330102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03292148,0.000256543,0.9619597,0.000193724,0.0007407842,0.00129762,0.0000317298,0.001364631,0.001233814],"genre_scores_gemma":[0.8720354,0.00001918301,0.1270124,0.00008956293,0.00004496664,0.0003288943,0.00003658148,0.00004184385,0.0003911629],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.959301,"threshold_uncertainty_score":0.9997298,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}