{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":4,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":4,"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":"b4fd5c9f61cf","filters":{"venue":"[1992] Proceedings 29th ACM/IEEE Design Automation Conference"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Eli Chiprout","is_ca":true},{"name":"M. Nakhla","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04627078040494223,"gpt":0.3048754043771716,"spread":0.2586046239722294,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007338665,0.0008878489,0.0006082171,0.001081989,0.0002944407,0.0006545297,0.0008874667,0.0008108667,0.003920075],"category_scores_gemma":[0.002438115,0.0003072066,0.0008605386,0.001244272,0.0005353143,0.001215088,0.0007712194,0.001029211,0.001442667],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004653974,"about_ca_system_score_gemma":0.000426915,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001062849,"about_ca_topic_score_gemma":0.0008422671,"domain_scores_codex":[0.9995853,0.0001630352,0.00001860615,0.00005167198,0.0001551632,0.00002622154],"domain_scores_gemma":[0.9995201,0.0002425268,0.00005594247,0.00008900611,0.00007608429,0.00001623652],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001213441,0.00004512876,0.0003420279,0.0003650916,0.00008939672,0.0001518963,0.0001601445,0.3180413,0.02438093,0.4094509,0.007279291,0.2395726],"study_design_scores_gemma":[0.00001306451,0.00002956462,0.0001325968,0.00002166545,0.00001464832,0.00008363605,0.00001376784,0.8990399,0.002882565,0.08620238,0.01154561,0.00002051236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001077399,0.0003156135,0.9969521,0.00004208541,0.00003606061,0.00001251606,0.00003333996,0.0002462564,0.001284577],"genre_scores_gemma":[0.1430235,0.002342768,0.8404166,0.0001556946,0.0003132061,0.0002591683,0.0003351016,0.0006234569,0.01253054],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003920075,"threshold_uncertainty_score":0.01311398,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Catherine H. Gebotys","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04843505675267619,"gpt":0.277019226323131,"spread":0.2285841695704549,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004965303,0.0006813753,0.000603914,0.0003665057,0.0002800302,0.0008447651,0.0008159252,0.0004330643,0.00287935],"category_scores_gemma":[0.001264909,0.0005228875,0.000414309,0.0005342963,0.0005427501,0.0009234674,0.0005007039,0.0006267826,0.0004274393],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001194968,"about_ca_system_score_gemma":0.001285594,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00203809,"about_ca_topic_score_gemma":0.002582266,"domain_scores_codex":[0.9994848,0.0001531689,0.00002511018,0.00007852454,0.0001630334,0.00009531129],"domain_scores_gemma":[0.9997309,0.000115616,0.00004301761,0.00004490001,0.00004561283,0.00001995468],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004346737,0.00002104105,0.0001152406,0.00005661838,0.000009954568,0.00003298665,0.00002361802,0.9443535,0.00409357,0.03140572,0.0007229613,0.01912129],"study_design_scores_gemma":[0.00001046801,0.00002566074,0.00004278833,0.000004730826,0.000005904144,0.00001070507,0.000006962569,0.9830366,0.00183312,0.01296675,0.002053059,0.000003328028],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02365834,0.0003988996,0.9672753,0.0001020535,0.00003873954,0.0000466507,0.00008187735,0.0002778937,0.008120268],"genre_scores_gemma":[0.5394326,0.0008868161,0.4499373,0.00009452486,0.00004617229,0.0002750172,0.0003354149,0.0002387775,0.008753234],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00287935,"threshold_uncertainty_score":0.009632409,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Kevin Chung","is_ca":true},{"name":"Jonathan Rose","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07288281590620302,"gpt":0.2520814451196865,"spread":0.1791986292134835,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003669198,0.0009947366,0.0003850046,0.0008069944,0.0004411921,0.0007572006,0.0008066238,0.000467734,0.01144602],"category_scores_gemma":[0.001428911,0.0003680579,0.0008447724,0.0005146214,0.0003689229,0.001182675,0.0008406326,0.0005455901,0.001537018],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004389324,"about_ca_system_score_gemma":0.0007792788,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001301565,"about_ca_topic_score_gemma":0.002446607,"domain_scores_codex":[0.9998403,0.00004506968,0.000008796734,0.00002321885,0.00005789732,0.0000246703],"domain_scores_gemma":[0.999651,0.000202334,0.00002930057,0.00004315696,0.00005554087,0.00001873608],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000501561,0.0001528401,0.005143511,0.0004998231,0.0001045398,0.0004980486,0.0003417913,0.3874938,0.02257063,0.04200195,0.02001498,0.5206765],"study_design_scores_gemma":[0.00007191394,0.0001186431,0.0004122801,0.00003743577,0.00002189182,0.0001536829,0.00007356122,0.9637138,0.007390916,0.01979311,0.008199642,0.00001309727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0617274,0.0004444675,0.9133152,0.0001813694,0.00005000746,0.0001927416,0.0004242914,0.009393718,0.01427086],"genre_scores_gemma":[0.2040836,0.0002549756,0.7874365,0.00007453321,0.00002042547,0.0003403839,0.0008211773,0.0007077647,0.006260648],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01144602,"threshold_uncertainty_score":0.0382908,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Minification; Computer science; Graph; Algorithm; Mathematical optimization; Theoretical computer science; Mathematics; Programming language","authors":[{"name":"R. Puri","is_ca":true},{"name":"Jinxiang Gu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03351824797113805,"gpt":0.2569164784611113,"spread":0.2233982304899733,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000500589,0.001586774,0.0009656965,0.001634572,0.001074259,0.00138662,0.001779156,0.001422007,0.01422588],"category_scores_gemma":[0.001889224,0.0006626722,0.0009333912,0.001710692,0.0007017242,0.001946745,0.002010389,0.00140777,0.006757825],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007916779,"about_ca_system_score_gemma":0.001409011,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001464185,"about_ca_topic_score_gemma":0.002954285,"domain_scores_codex":[0.9992513,0.00009583858,0.00005343385,0.0001729884,0.0003368015,0.00008963647],"domain_scores_gemma":[0.9994129,0.0001919847,0.00004695742,0.000111652,0.0002081227,0.00002843978],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001714181,0.0001032934,0.0003248189,0.0002907367,0.00005399251,0.0001324486,0.0001282712,0.07668924,0.02133562,0.04262288,0.0224576,0.8356898],"study_design_scores_gemma":[0.0002204874,0.0001983663,0.0003809733,0.0000694445,0.00005001919,0.0005177127,0.0001235561,0.8223518,0.02022957,0.09558462,0.06021132,0.00006214958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001733014,0.0001737714,0.9928514,0.0001123924,0.0000779558,0.0001031296,0.000063682,0.001702545,0.003182116],"genre_scores_gemma":[0.02159017,0.0001639472,0.9713719,0.0001056805,0.00004336759,0.0003105125,0.000339011,0.0004068002,0.005668469],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01422588,"threshold_uncertainty_score":0.04759026,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}