{"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039982595,0.00006263155,0.9565475,0.00027277524,0.000109453424,0.00045934855,0.0000010324975,0.00087684434,0.0016878155],"genre_scores_gemma":[0.5253552,0.00002742147,0.47447738,0.000057809964,0.00001598218,0.00002830723,0.0000020577368,0.000010429406,0.000025372537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791014,0.00009345011,0.00060675276,0.00060674746,0.00043106312,0.00035184724],"domain_scores_gemma":[0.99813175,0.00016077832,0.0005528982,0.0003642972,0.00064524985,0.00014503549],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011530969,0.00028552272,0.0003320906,0.00031194036,0.0002338086,0.00041009721,0.00086429337,0.00017490504,0.00001396872],"category_scores_gemma":[0.0007296462,0.0002974572,0.000051604642,0.00053479674,0.000103089005,0.0011309349,0.00012285526,0.00020903753,0.000011329329],"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.000055306027,0.00031934018,0.00087310077,0.00047553112,0.00010301208,0.0000039808588,0.009146926,0.057890043,0.1207002,0.77703166,0.001672068,0.031728834],"study_design_scores_gemma":[0.00037705104,0.00014431812,0.00031523933,0.00013750185,0.000013151612,0.000029923085,0.00009528713,0.8515596,0.13877055,0.008155389,0.00008192069,0.0003200783],"about_ca_topic_score_codex":0.000009020745,"about_ca_topic_score_gemma":3.9427488e-7,"teacher_disagreement_score":0.7936696,"about_ca_system_score_codex":0.000049893726,"about_ca_system_score_gemma":0.0002546681,"threshold_uncertainty_score":0.9999477},"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":"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.08719385,0.0001908688,0.9096335,0.000045070992,0.0005000464,0.0011357128,0.000014436584,0.0007081518,0.0005783397],"genre_scores_gemma":[0.6991915,0.00008814515,0.30015495,0.000051216954,0.000040738287,0.00035293002,0.000026043053,0.00006614111,0.000028326922],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971264,0.00012633191,0.0011138674,0.0005730876,0.00036214004,0.0006981562],"domain_scores_gemma":[0.99815106,0.0004620331,0.00036553713,0.0003922577,0.00043524953,0.00019388754],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002127457,0.0005319079,0.0009726912,0.00093433657,0.00015919795,0.00021896939,0.0006498769,0.00027928737,0.00014750741],"category_scores_gemma":[0.00023496682,0.0005358624,0.00032189232,0.0014594118,0.00007311112,0.0008350187,0.00002553736,0.00027871624,0.0000068826116],"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.0001280623,0.00011733994,0.00017502009,0.0006928355,0.0023100178,0.0000012851243,0.006927847,0.56875414,0.35509902,0.02902126,0.001730532,0.03504261],"study_design_scores_gemma":[0.0008720512,0.00013130289,0.00017974652,0.000111520574,0.00075280276,0.000004435196,0.00019538442,0.86833465,0.12645322,0.0016007462,0.00083498517,0.0005291852],"about_ca_topic_score_codex":0.000017868686,"about_ca_topic_score_gemma":0.00000532699,"teacher_disagreement_score":0.61199766,"about_ca_system_score_codex":0.00022106724,"about_ca_system_score_gemma":0.00009529208,"threshold_uncertainty_score":0.9997093},"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":"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.017692681,0.00010353693,0.97712463,0.00046330792,0.00012789134,0.001744291,0.000013239186,0.001789443,0.00094096235],"genre_scores_gemma":[0.90863425,0.00004513793,0.08990946,0.000035868612,0.000043078107,0.0012345455,0.000006151847,0.000053212818,0.000038329355],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99851334,0.000026053094,0.0005038223,0.00033310984,0.0002580926,0.0003655685],"domain_scores_gemma":[0.9986299,0.00031139495,0.00024389486,0.00030468803,0.00044817504,0.0000619312],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053630193,0.00031519466,0.00033762274,0.0004677339,0.00027370182,0.00013537545,0.00044864215,0.0002266648,0.000024982692],"category_scores_gemma":[0.00047376912,0.00024688605,0.000066399014,0.00064462755,0.00015764392,0.0004311281,0.000018151271,0.00022857798,0.000005407544],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.000107153,0.00011291798,0.00045722182,0.0008947498,0.00036320303,0.000001871162,0.0053034592,0.012208618,0.82158035,0.102905564,0.0061497027,0.049915187],"study_design_scores_gemma":[0.00069961365,0.0003706783,0.00022226422,0.00029460483,0.00008404286,0.000048067115,0.0014620945,0.12970708,0.82269186,0.041579865,0.0023376949,0.0005021221],"about_ca_topic_score_codex":0.0000071907757,"about_ca_topic_score_gemma":0.00000669324,"teacher_disagreement_score":0.89094156,"about_ca_system_score_codex":0.0000726173,"about_ca_system_score_gemma":0.000112510585,"threshold_uncertainty_score":0.99999833},"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":"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.009613523,0.00006327283,0.98417944,0.00004018261,0.0003097357,0.0015055704,0.000028204842,0.0026678958,0.001592188],"genre_scores_gemma":[0.6367944,0.000033415727,0.36246774,0.000057343794,0.00008495991,0.00041048077,0.000035039673,0.00007556303,0.000041075185],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795765,0.00004171027,0.00057606737,0.00052667747,0.00033245762,0.0005654276],"domain_scores_gemma":[0.9987254,0.00012453395,0.00018397401,0.000306975,0.00045952538,0.00019957665],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066121254,0.0004306533,0.00036343353,0.0003186098,0.00021916885,0.0003612007,0.0005056009,0.00030228822,0.000069973874],"category_scores_gemma":[0.00020266512,0.00046327058,0.00008729693,0.00036441817,0.00006053518,0.0006017502,0.000014886003,0.00020631445,0.000034736648],"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.00005558741,0.00045051478,0.00012331412,0.00075851654,0.0001584311,0.000005065037,0.0039553232,0.017955426,0.5652549,0.031951416,0.022533866,0.3567976],"study_design_scores_gemma":[0.00044655456,0.000186862,0.00005137483,0.00007479499,0.000035482695,0.000015331505,0.00012924864,0.71406454,0.28059053,0.002305068,0.0016384429,0.0004617618],"about_ca_topic_score_codex":0.000004917175,"about_ca_topic_score_gemma":8.808803e-7,"teacher_disagreement_score":0.6961091,"about_ca_system_score_codex":0.0001638667,"about_ca_system_score_gemma":0.00011382409,"threshold_uncertainty_score":0.9997819},"labels":[],"label_agreement":null}]}