{"meta":{"query_hash":"b4fd5c9f61cf","filters":{"venue":"[1992] Proceedings 29th ACM/IEEE Design Automation Conference"},"cohort_total":4,"direct_labels_cover":0,"predictions_cover":4,"exported":4,"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/b4fd5c9f61cf","api":"https://metacan.xera.ac/api/v1/cohort?venue=%5B1992%5D+Proceedings+29th+ACM%2FIEEE+Design+Automation+Conference"},"results":[{"id":"W4230145123","doi":"10.1109/dac.1992.227851","title":"Optimal scheduling and allocation of embedded VLSI chips","year":2003,"lang":"en","type":"article","venue":"[1992] Proceedings 29th ACM/IEEE Design Automation Conference","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":25,"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 Waterloo","funders":"","keywords":"Chaining; Computer science; Very-large-scale integration; Parallel computing; Scheduling (production processes); Integer programming; Clock rate; Processor scheduling; Job shop scheduling; High-level synthesis; Embedded system; Mathematical optimization; Algorithm; Routing (electronic design automation); Field-programmable gate array; Chip; Mathematics; Operating system","score_opus":0.04843505675267619,"score_gpt":0.27701922632313103,"score_spread":0.22858416957045485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230145123","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.023658343,0.00039889963,0.9672753,0.000102053506,0.000038739538,0.0000466507,0.00008187735,0.00027789368,0.008120268],"genre_scores_gemma":[0.53943264,0.00088681607,0.44993734,0.00009452486,0.00004617229,0.0002750172,0.00033541486,0.00023877746,0.008753234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994848,0.00015316889,0.000025110185,0.00007852454,0.00016303344,0.00009531129],"domain_scores_gemma":[0.9997309,0.00011561598,0.00004301761,0.000044900014,0.00004561283,0.000019954685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049653027,0.00068137527,0.00060391397,0.00036650567,0.00028003016,0.0008447651,0.0008159252,0.00043306433,0.00287935],"category_scores_gemma":[0.0012649093,0.0005228875,0.000414309,0.00053429627,0.00054275006,0.0009234674,0.0005007039,0.0006267826,0.00042743926],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.00004346737,0.000021041047,0.00011524063,0.000056618384,0.000009954568,0.000032986653,0.000023618019,0.94435346,0.00409357,0.031405717,0.00072296127,0.01912129],"study_design_scores_gemma":[0.000010468015,0.000025660744,0.000042788328,0.000004730826,0.000005904144,0.000010705073,0.0000069625694,0.9830366,0.0018331197,0.012966755,0.0020530592,0.0000033280278],"about_ca_topic_score_codex":0.0020380905,"about_ca_topic_score_gemma":0.002582266,"teacher_disagreement_score":0.00287935,"about_ca_system_score_codex":0.0011949679,"about_ca_system_score_gemma":0.0012855944,"threshold_uncertainty_score":0.009632409},"labels":[],"label_agreement":null},{"id":"W4233542360","doi":"10.1109/dac.1992.227836","title":"Generalized moment-matching methods for transient analysis of interconnect networks","year":2003,"lang":"en","type":"article","venue":"[1992] Proceedings 29th ACM/IEEE Design Automation Conference","topic":"Low-power high-performance VLSI design","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Moment (physics); Waveform; Transient (computer programming); Matching (statistics); Lossy compression; Computer science; Stability (learning theory); Nonlinear system; Interconnection; Algorithm; Set (abstract data type); Electronic engineering; Mathematics; Engineering; Artificial intelligence; Telecommunications; Physics; Machine learning","score_opus":0.04627078040494223,"score_gpt":0.3048754043771716,"score_spread":0.2586046239722294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233542360","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.0010773994,0.0003156135,0.99695206,0.00004208541,0.00003606061,0.0000125160595,0.00003333996,0.0002462564,0.0012845771],"genre_scores_gemma":[0.14302348,0.0023427678,0.84041655,0.00015569458,0.00031320605,0.00025916833,0.00033510162,0.0006234569,0.012530542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958533,0.00016303522,0.000018606153,0.000051671977,0.00015516319,0.000026221544],"domain_scores_gemma":[0.99952006,0.00024252676,0.000055942466,0.000089006106,0.00007608429,0.000016236523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073386653,0.0008878489,0.0006082171,0.0010819894,0.00029444072,0.0006545297,0.0008874667,0.00081086665,0.0039200746],"category_scores_gemma":[0.0024381147,0.00030720662,0.0008605386,0.0012442719,0.00053531426,0.0012150876,0.0007712194,0.0010292105,0.0014426674],"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.00012134414,0.000045128756,0.00034202787,0.0003650916,0.000089396715,0.00015189631,0.00016014448,0.31804127,0.024380933,0.40945086,0.0072792913,0.23957263],"study_design_scores_gemma":[0.000013064513,0.000029564624,0.0001325968,0.000021665452,0.000014648315,0.00008363605,0.000013767839,0.8990399,0.0028825651,0.08620238,0.011545605,0.000020512358],"about_ca_topic_score_codex":0.001062849,"about_ca_topic_score_gemma":0.00084226707,"teacher_disagreement_score":0.0039200746,"about_ca_system_score_codex":0.00046539737,"about_ca_system_score_gemma":0.00042691498,"threshold_uncertainty_score":0.0131139755},"labels":[],"label_agreement":null},{"id":"W4234875748","doi":"10.1109/dac.1992.227777","title":"TEMPT: technology mapping for the exploration of FPGA architectures with hard-wired connections","year":2003,"lang":"en","type":"article","venue":"[1992] Proceedings 29th ACM/IEEE Design Automation Conference","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":9,"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":"Netlist; Field-programmable gate array; Computer science; Set (abstract data type); Parallel computing; Embedded system","score_opus":0.07288281590620302,"score_gpt":0.2520814451196865,"score_spread":0.17919862921348348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234875748","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.061727405,0.0004444675,0.9133152,0.00018136937,0.00005000746,0.0001927416,0.00042429144,0.009393718,0.014270861],"genre_scores_gemma":[0.20408362,0.00025497563,0.7874365,0.00007453321,0.00002042547,0.0003403839,0.00082117727,0.0007077647,0.006260648],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984026,0.000045069675,0.000008796734,0.000023218849,0.000057897323,0.000024670297],"domain_scores_gemma":[0.99965096,0.00020233403,0.000029300572,0.000043156957,0.000055540866,0.000018736078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036691982,0.0009947366,0.00038500456,0.0008069944,0.00044119213,0.0007572006,0.0008066238,0.000467734,0.011446017],"category_scores_gemma":[0.001428911,0.00036805787,0.0008447724,0.00051462144,0.0003689229,0.0011826747,0.0008406326,0.0005455901,0.0015370182],"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.000501561,0.00015284015,0.0051435106,0.00049982313,0.00010453981,0.00049804855,0.00034179125,0.38749382,0.022570627,0.04200195,0.020014979,0.5206765],"study_design_scores_gemma":[0.000071913935,0.000118643075,0.00041228015,0.00003743577,0.000021891825,0.00015368292,0.00007356122,0.96371377,0.007390916,0.01979311,0.008199642,0.000013097275],"about_ca_topic_score_codex":0.0013015653,"about_ca_topic_score_gemma":0.002446607,"teacher_disagreement_score":0.011446017,"about_ca_system_score_codex":0.00043893236,"about_ca_system_score_gemma":0.0007792788,"threshold_uncertainty_score":0.0382908},"labels":[],"label_agreement":null},{"id":"W4255840877","doi":"10.1109/dac.1992.227805","title":"An efficient algorithm for microword length minimization","year":2003,"lang":"en","type":"article","venue":"[1992] Proceedings 29th ACM/IEEE Design Automation Conference","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":7,"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 Calgary","funders":"","keywords":"Minification; Computer science; Graph; Algorithm; Mathematical optimization; Theoretical computer science; Mathematics; Programming language","score_opus":0.03351824797113805,"score_gpt":0.2569164784611113,"score_spread":0.22339823048997326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255840877","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.0017330137,0.00017377138,0.9928514,0.00011239239,0.000077955796,0.00010312958,0.000063682004,0.0017025447,0.0031821164],"genre_scores_gemma":[0.021590168,0.0001639472,0.97137195,0.0001056805,0.00004336759,0.00031051246,0.00033901102,0.00040680022,0.0056684692],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992513,0.00009583858,0.00005343385,0.00017298837,0.00033680146,0.000089636465],"domain_scores_gemma":[0.9994129,0.00019198471,0.000046957415,0.000111652036,0.00020812273,0.000028439776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050058897,0.001586774,0.0009656965,0.0016345722,0.0010742592,0.0013866198,0.0017791562,0.001422007,0.0142258825],"category_scores_gemma":[0.0018892239,0.0006626722,0.00093339116,0.0017106923,0.0007017242,0.001946745,0.002010389,0.00140777,0.0067578247],"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.0001714181,0.000103293445,0.00032481886,0.00029073673,0.000053992513,0.00013244862,0.00012827119,0.07668924,0.021335622,0.042622875,0.022457603,0.8356898],"study_design_scores_gemma":[0.00022048737,0.00019836628,0.0003809733,0.000069444504,0.00005001919,0.0005177127,0.00012355608,0.82235175,0.020229567,0.09558462,0.060211316,0.00006214958],"about_ca_topic_score_codex":0.0014641852,"about_ca_topic_score_gemma":0.0029542851,"teacher_disagreement_score":0.0142258825,"about_ca_system_score_codex":0.00079167786,"about_ca_system_score_gemma":0.0014090114,"threshold_uncertainty_score":0.047590256},"labels":[],"label_agreement":null}]}