{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":2,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":2,"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":"1d86f0620173","filters":{"venue":"IEEE/ACM International Conference on Computer Aided Design, 2002. ICCAD 2002."}},"results":[{"id":"W4238593108","doi":"10.1109/iccad.2002.1167616","title":"Incremental placement for layout-driven optimizations on FPGAs","year":2003,"lang":"en","type":"article","venue":"IEEE/ACM International Conference on Computer Aided Design, 2002. ICCAD 2002.","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":8,"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; Computer science; Logic optimization; Logic synthesis; Place and route; Restructuring; Field-programmable gate array; Logic block; Placement; Logic gate; Logic family; Parallel computing; Computer architecture; Programmable logic device; Computer engineering; Algorithm; Physical design; Embedded system; Circuit design","authors":[{"name":"Deshanand P. Singh","is_ca":true},{"name":"Stephen D. Brown","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07900521087211489,"gpt":0.291412927817465,"spread":0.2124077169453501,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003150097,0.0004953106,0.0003620413,0.0004306116,0.0001600082,0.0002487692,0.0008399518,0.0002027358,0.001503024],"category_scores_gemma":[0.00006920101,0.0005143438,0.0001630895,0.0001887865,0.00005834032,0.000272438,0.00004800693,0.0003291943,0.0004183158],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003533693,"about_ca_system_score_gemma":0.00008368237,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000711765,"about_ca_topic_score_gemma":0.000003674789,"domain_scores_codex":[0.9976522,0.0001251492,0.0005957761,0.0005590637,0.0005605505,0.0005073139],"domain_scores_gemma":[0.9985426,0.0002800006,0.0001221328,0.000548383,0.0003248571,0.0001820019],"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.0001478448,0.0004096792,0.00005262282,0.00003638155,0.0003623017,0.0000259331,0.0002711238,0.6826408,0.006908203,0.04931478,0.2546992,0.005131103],"study_design_scores_gemma":[0.00194836,0.0009790165,0.00006452615,0.0002571222,0.00004083928,0.00002773352,0.00003596051,0.9221646,0.05217864,0.002526063,0.01889329,0.0008838467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001146582,0.00003291316,0.9687831,0.000236137,0.001807484,0.00110211,0.0001502965,0.0006701841,0.02607122],"genre_scores_gemma":[0.668366,0.0001669393,0.3260199,0.001334933,0.0006461013,0.0005814196,0.0001276844,0.0001543247,0.002602753],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6672194,"threshold_uncertainty_score":0.9997308,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4231140189","doi":"10.1109/iccad.2002.1167524","title":"Specifying and verifying imprecise sequential datapaths by arithmetic transforms","year":2003,"lang":"en","type":"article","venue":"IEEE/ACM International Conference on Computer Aided Design, 2002. ICCAD 2002.","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Datapath; Computer science; Arithmetic; Block (permutation group theory); Algorithm; Polynomial; Parallel computing; Mathematics","authors":[{"name":"K. Radecka","is_ca":true},{"name":"Z. Zilic","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1273388887508718,"gpt":0.3312783967356497,"spread":0.2039395079847779,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001396785,0.0005778287,0.0004740079,0.0004479007,0.0002920774,0.001067253,0.002660325,0.0002507604,0.0004451495],"category_scores_gemma":[0.0002105718,0.0005716072,0.0001353239,0.0004461472,0.0001860837,0.001901055,0.0002337264,0.0006469723,0.0003230979],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002396786,"about_ca_system_score_gemma":0.0002070682,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003307134,"about_ca_topic_score_gemma":0.000002742504,"domain_scores_codex":[0.9955434,0.0005434552,0.0008760934,0.001286657,0.001046682,0.0007036625],"domain_scores_gemma":[0.9973252,0.0003449466,0.0003322461,0.001268197,0.0004076269,0.0003218305],"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.0003007675,0.000852473,0.0002232611,0.000113356,0.000403129,0.0001743422,0.002246261,0.003032759,0.0551233,0.5182343,0.03609858,0.3831975],"study_design_scores_gemma":[0.002764132,0.0007840333,0.0004859127,0.0003312672,0.00004275481,0.0003962496,0.00004647266,0.8600212,0.08599167,0.01828583,0.02925939,0.001591111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002559225,0.0001709832,0.9856724,0.0004247791,0.003524408,0.0005864811,0.00005455274,0.0002720836,0.006735104],"genre_scores_gemma":[0.1588821,0.0003726932,0.8384097,0.0008924297,0.0003316812,0.00007821334,0.00002945579,0.00005377707,0.0009499478],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8569884,"threshold_uncertainty_score":0.9999697,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}