{"meta":{"query_hash":"16d2512e059f","filters":{"venue":"Proceedings. 42nd Design Automation Conference, 2005."},"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/16d2512e059f","api":"https://metacan.xera.ac/api/v1/cohort?venue=Proceedings.+42nd+Design+Automation+Conference%2C+2005."},"results":[{"id":"W4211201338","doi":"10.1109/dac.2005.193848","title":"Incremental retiming for FPGA physical synthesis","year":2005,"lang":"en","type":"article","venue":"Proceedings. 42nd Design Automation Conference, 2005.","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Alterra Power (Canada)","funders":"","keywords":"Retiming; Field-programmable gate array; Computer science; Glitch; Stratix; Reset (finance); Floorplan; Parallel computing; Embedded system; Computer hardware; Algorithm","score_opus":0.04762207711787992,"score_gpt":0.2853582250161972,"score_spread":0.23773614789831726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211201338","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006573089,0.00038096742,0.9889318,0.00004859739,0.00003611541,0.000022424269,0.000018137123,0.0010441644,0.002944725],"genre_scores_gemma":[0.2536206,0.00058140577,0.7412755,0.00010109852,0.000049693743,0.00009124193,0.00010183043,0.00020022814,0.003978431],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978393,0.00005146995,0.000010805472,0.000026480215,0.00010513838,0.000022136213],"domain_scores_gemma":[0.99971706,0.00014975786,0.000024340985,0.000053297437,0.00004853865,0.000007030758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026511424,0.0004390447,0.0002021838,0.00046540092,0.00026706388,0.0003700448,0.0006628484,0.00023321722,0.004282759],"category_scores_gemma":[0.0009385523,0.00022067137,0.00025920197,0.00033901256,0.0002577711,0.00052877463,0.00033809946,0.0005242929,0.0006805158],"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.00016245861,0.000048908372,0.00025113323,0.00025551333,0.00002811785,0.00012478522,0.00008014699,0.24384362,0.05874825,0.048555117,0.0032949413,0.64460695],"study_design_scores_gemma":[0.000058229125,0.00018018021,0.00020184713,0.000034531015,0.000036522106,0.00013736819,0.000017421089,0.92226946,0.036996443,0.024512244,0.015533654,0.000022092578],"about_ca_topic_score_codex":0.0014284798,"about_ca_topic_score_gemma":0.0042127063,"teacher_disagreement_score":0.004282759,"about_ca_system_score_codex":0.00048203094,"about_ca_system_score_gemma":0.00060262746,"threshold_uncertainty_score":0.014327288},"labels":[],"label_agreement":null},{"id":"W4237557932","doi":"10.1109/dac.2005.193820","title":"Design methodology for wireless nodes with printed antennas","year":2005,"lang":"en","type":"article","venue":"Proceedings. 42nd Design Automation Conference, 2005.","topic":"Antenna Design and Analysis","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"University of Colorado Boulder","keywords":"Computer science; Wireless; Antenna (radio); Wireless network; Node (physics); Wi-Fi array; Range (aeronautics); Electronic engineering; Electrical engineering; Computer network; Telecommunications; Engineering","score_opus":0.07432916659593122,"score_gpt":0.2709913418314867,"score_spread":0.1966621752355555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237557932","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.0006502492,0.000069753936,0.99594563,0.00003385307,0.000035689704,0.00004724124,0.000018341374,0.00018384954,0.0030154472],"genre_scores_gemma":[0.048066575,0.0006209408,0.93806595,0.00010424141,0.00004029829,0.00047669586,0.00010050731,0.00020655434,0.012318148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995233,0.00008347083,0.000030388033,0.00005320687,0.0002881586,0.000021564108],"domain_scores_gemma":[0.99973005,0.000066309905,0.000037565456,0.000048157188,0.00011097886,0.00000695184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043791614,0.0006511627,0.00028825557,0.0004987417,0.0002648788,0.000769964,0.0011202743,0.0005246206,0.004973578],"category_scores_gemma":[0.0010107862,0.00038221575,0.00056681246,0.0003843551,0.0004044832,0.0006890463,0.0004355834,0.0007721224,0.0030626957],"study_design_candidate":"bench_or_experimental","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.000037861108,0.00007060554,0.00042647563,0.0010998705,0.0001063742,0.0005416213,0.0004961156,0.1979426,0.21727253,0.29032364,0.007054144,0.28462818],"study_design_scores_gemma":[0.00008158082,0.00037489834,0.00036016575,0.00018438321,0.00010981178,0.0014611983,0.00014513012,0.40629128,0.15337196,0.07727408,0.36028054,0.000064976244],"about_ca_topic_score_codex":0.00032502625,"about_ca_topic_score_gemma":0.00046618746,"teacher_disagreement_score":0.004973578,"about_ca_system_score_codex":0.00040335752,"about_ca_system_score_gemma":0.0005086426,"threshold_uncertainty_score":0.016638339},"labels":[],"label_agreement":null},{"id":"W4237811248","doi":"10.1109/dac.2005.193889","title":"A unified optimization framework for equalization filter synthesis","year":2005,"lang":"en","type":"article","venue":"Proceedings. 42nd Design Automation Conference, 2005.","topic":"Photonic and Optical Devices","field":"Engineering","cited_by":4,"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":"Computer science; Equalization (audio); Filter (signal processing); Algorithm; Computer vision","score_opus":0.03923183387556088,"score_gpt":0.2581216117356575,"score_spread":0.2188897778600966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237811248","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.00025090482,0.000076149416,0.9985114,0.000027053642,0.000010248447,0.0000074092063,0.000014997913,0.000042825595,0.0010589964],"genre_scores_gemma":[0.06540642,0.0006472625,0.9273479,0.000107750406,0.00011469534,0.00027024563,0.00017514455,0.00019325908,0.005737472],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994412,0.00016051094,0.000024072657,0.00008642432,0.00022941621,0.000058306327],"domain_scores_gemma":[0.99974185,0.00012175171,0.000019171785,0.000029578585,0.00007475033,0.000012867254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010705945,0.0013539379,0.00099322,0.00069246744,0.00043094347,0.001207157,0.0011059158,0.0010224764,0.0046369224],"category_scores_gemma":[0.0014065881,0.0006409452,0.0010945502,0.00084685255,0.0006430225,0.0010439075,0.0012474855,0.0014059319,0.001168532],"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.000024062192,0.000041709172,0.00008906676,0.000111356916,0.000042252253,0.000049886985,0.000041604493,0.7718827,0.004469078,0.14728099,0.0026733563,0.0732939],"study_design_scores_gemma":[0.000010994395,0.000024437908,0.000022187442,0.000012035019,0.000009612583,0.000018994871,0.00000733885,0.96783876,0.00087628304,0.026842717,0.0043286816,0.000007903506],"about_ca_topic_score_codex":0.0024132587,"about_ca_topic_score_gemma":0.0040285653,"teacher_disagreement_score":0.0046369224,"about_ca_system_score_codex":0.0007250112,"about_ca_system_score_gemma":0.0014232119,"threshold_uncertainty_score":0.015512049},"labels":[],"label_agreement":null},{"id":"W4239560685","doi":"10.1109/dac.2005.193910","title":"Efficient SAT solving: beyond supercubes","year":2005,"lang":"en","type":"article","venue":"Proceedings. 42nd Design Automation Conference, 2005.","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"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":"Pruning; Computer science; Speedup; Boolean satisfiability problem; Benchmark (surveying); Maximum satisfiability problem; Solver; Theoretical computer science; Boolean function; Algorithm; Programming language; Parallel computing","score_opus":0.040639984663566754,"score_gpt":0.27470770246718795,"score_spread":0.2340677178036212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239560685","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029138865,0.0016236234,0.9478704,0.0017219982,0.000121224024,0.00017409511,0.00018558574,0.002026593,0.017137682],"genre_scores_gemma":[0.17436391,0.0013095589,0.8175706,0.0006721506,0.000096264004,0.0003437829,0.0006535323,0.0006567694,0.0043333885],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966208,0.0012969291,0.0001820109,0.00043613766,0.0011676063,0.0002964517],"domain_scores_gemma":[0.9953377,0.002188921,0.00018694715,0.0016287753,0.0005416753,0.000115858915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020550594,0.00069991825,0.0014313877,0.00096536026,0.0010798671,0.0021694687,0.002679971,0.0011367064,0.0060501164],"category_scores_gemma":[0.0075889113,0.00075680885,0.0011828509,0.0022738823,0.001633771,0.0052781985,0.003306476,0.0025679597,0.0015296326],"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.00025772868,0.00018375457,0.0013833884,0.0005081684,0.000113202084,0.00018488184,0.00043164787,0.15185282,0.009126751,0.35685778,0.017638655,0.46146125],"study_design_scores_gemma":[0.00007895636,0.0000743297,0.00026995115,0.00008341585,0.000036008336,0.00011143203,0.00016576081,0.69143105,0.006474548,0.2671984,0.034057412,0.000018757786],"about_ca_topic_score_codex":0.0057836478,"about_ca_topic_score_gemma":0.008262059,"teacher_disagreement_score":0.0060501164,"about_ca_system_score_codex":0.0013186057,"about_ca_system_score_gemma":0.0018721332,"threshold_uncertainty_score":0.020239651},"labels":[],"label_agreement":null},{"id":"W4247533534","doi":"10.1109/dac.2005.193932","title":"A non-parametric approach for dynamic range estimation of nonlinear systems","year":2005,"lang":"en","type":"article","venue":"Proceedings. 42nd Design Automation Conference, 2005.","topic":"Blind Source Separation Techniques","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 Toronto","funders":"","keywords":"Computer science; Datapath; Nonlinear system; Algorithm; Gaussian; Dynamic range; Parametric statistics; Range (aeronautics); Orthonormal basis; High dynamic range; Independent component analysis; Gaussian process; Mathematical optimization; Mathematics; Artificial intelligence; Statistics","score_opus":0.03145764093773942,"score_gpt":0.28030365232303706,"score_spread":0.24884601138529763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247533534","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.0009761246,0.00019714677,0.99801624,0.000041838965,0.000015670861,0.00001060399,0.000009530799,0.0001408333,0.0005919216],"genre_scores_gemma":[0.14011997,0.0010720893,0.85341626,0.0001304276,0.00015282101,0.0002004397,0.00010615182,0.00011298531,0.0046889167],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937785,0.0001481722,0.000025492793,0.00012720846,0.0002904767,0.000030844752],"domain_scores_gemma":[0.99940944,0.0003237083,0.000055927314,0.0001056096,0.00009157766,0.000013782465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005552682,0.0007519607,0.00066321203,0.0008800514,0.00043421204,0.00062934303,0.0006868964,0.0007134862,0.0016123878],"category_scores_gemma":[0.0026246444,0.00031938226,0.0005290353,0.00070241065,0.00071805646,0.0009527834,0.0007894822,0.0013336645,0.0006871458],"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.000118021075,0.00007538207,0.00048384804,0.0002456837,0.00009691673,0.00019411715,0.00017525419,0.14500682,0.066505075,0.05772976,0.0021596246,0.7272095],"study_design_scores_gemma":[0.000011995173,0.00009658714,0.0008355314,0.000026013413,0.000027330023,0.0005462354,0.000030136081,0.93635756,0.026233876,0.02369364,0.0120814275,0.000059749163],"about_ca_topic_score_codex":0.0006987137,"about_ca_topic_score_gemma":0.0010738826,"teacher_disagreement_score":0.0016123878,"about_ca_system_score_codex":0.00031570587,"about_ca_system_score_gemma":0.0005927478,"threshold_uncertainty_score":0.005393982},"labels":[],"label_agreement":null}]}