{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001830806,0.0006027185,0.0003205402,0.0005917752,0.0003200925,0.0003987489,0.000751811,0.0002709701,0.003248132],"category_scores_gemma":[0.0007075226,0.000297157,0.000289068,0.0004690887,0.0002620034,0.000575526,0.000510859,0.0003947353,0.0006250413],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004473142,"about_ca_system_score_gemma":0.000451067,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00183457,"about_ca_topic_score_gemma":0.004504795,"domain_scores_codex":[0.9998048,0.00003857138,0.000009596499,0.00002772531,0.00008750291,0.00003174972],"domain_scores_gemma":[0.9998083,0.00007605863,0.00002316514,0.00004894733,0.00003594674,0.000007611969],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002864656,0.00006021025,0.0009514566,0.0001706432,0.00003844631,0.0002478634,0.0001054009,0.3550952,0.05269536,0.01903889,0.005375687,0.5659344],"study_design_scores_gemma":[0.000077244,0.0002026461,0.0006261817,0.00002533979,0.00004205712,0.000242796,0.0000553303,0.930833,0.03396537,0.01771661,0.01619148,0.0000219592],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03714437,0.0004406174,0.953089,0.00009506605,0.00005871037,0.00008186683,0.00007523492,0.003844343,0.005170898],"genre_scores_gemma":[0.3624257,0.0003328247,0.633041,0.00008158477,0.00004286213,0.000104358,0.000298933,0.0003510047,0.003321698],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003248132,"threshold_uncertainty_score":0.01086605,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002088001,0.0009119358,0.0007700894,0.0007876292,0.0004915986,0.002014586,0.001599334,0.0008215044,0.001455319],"category_scores_gemma":[0.009731301,0.0006706838,0.001223544,0.0009901017,0.003088231,0.003789415,0.001459461,0.001769024,0.0002994847],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009026011,"about_ca_system_score_gemma":0.001469973,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002074827,"about_ca_topic_score_gemma":0.002491815,"domain_scores_codex":[0.995899,0.0007373462,0.0003667694,0.0006372983,0.00202262,0.0003369076],"domain_scores_gemma":[0.9919409,0.004912884,0.001173332,0.001313131,0.0005914436,0.00006823453],"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.0006527189,0.0000714468,0.002145042,0.0003450133,0.00008981559,0.0006108375,0.0003727188,0.659848,0.07323227,0.1743281,0.0005805867,0.08772335],"study_design_scores_gemma":[0.00009119303,0.0002468223,0.0002358528,0.00004183088,0.00007094504,0.0002512511,0.00005961116,0.7606446,0.1189789,0.1160637,0.003275803,0.00003943771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06231468,0.00006836695,0.9359515,0.00005478267,0.00001642003,0.00004067338,0.00008953825,0.0007371005,0.0007267699],"genre_scores_gemma":[0.6583925,0.0001926492,0.3398675,0.00005775889,0.00003661124,0.0001004662,0.0001973583,0.0001640251,0.0009912029],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002088001,"threshold_uncertainty_score":0.01104254,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}