{"meta":{"query_hash":"1d86f0620173","filters":{"venue":"IEEE/ACM International Conference on Computer Aided Design, 2002. ICCAD 2002."},"cohort_total":2,"direct_labels_cover":0,"predictions_cover":2,"exported":2,"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/1d86f0620173","api":"https://metacan.xera.ac/api/v1/cohort?venue=IEEE%2FACM+International+Conference+on+Computer+Aided+Design%2C+2002.+ICCAD+2002."},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Datapath; Computer science; Arithmetic; Block (permutation group theory); Algorithm; Polynomial; Parallel computing; Mathematics","score_opus":0.12733888875087176,"score_gpt":0.3312783967356497,"score_spread":0.20393950798477792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231140189","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.06231468,0.00006836695,0.93595153,0.00005478267,0.000016420026,0.000040673378,0.00008953825,0.00073710055,0.0007267699],"genre_scores_gemma":[0.6583925,0.00019264921,0.3398675,0.000057758894,0.00003661124,0.00010046621,0.00019735833,0.00016402511,0.0009912029],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995899,0.00073734624,0.0003667694,0.00063729833,0.0020226198,0.00033690757],"domain_scores_gemma":[0.9919409,0.0049128844,0.0011733322,0.0013131314,0.0005914436,0.000068234534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002088001,0.00091193576,0.00077008945,0.00078762916,0.0004915986,0.0020145865,0.0015993341,0.0008215044,0.0014553192],"category_scores_gemma":[0.009731301,0.0006706838,0.0012235444,0.0009901017,0.0030882307,0.0037894154,0.0014594606,0.0017690236,0.0002994847],"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.0006527189,0.0000714468,0.002145042,0.00034501328,0.00008981559,0.0006108375,0.00037271882,0.65984803,0.07323227,0.17432815,0.00058058667,0.08772335],"study_design_scores_gemma":[0.000091193026,0.00024682234,0.00023585283,0.00004183088,0.00007094504,0.0002512511,0.00005961116,0.7606446,0.11897892,0.11606369,0.0032758026,0.000039437713],"about_ca_topic_score_codex":0.0020748274,"about_ca_topic_score_gemma":0.002491815,"teacher_disagreement_score":0.002088001,"about_ca_system_score_codex":0.00090260105,"about_ca_system_score_gemma":0.0014699725,"threshold_uncertainty_score":0.011042535},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07900521087211489,"score_gpt":0.291412927817465,"score_spread":0.2124077169453501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238593108","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.03714437,0.0004406174,0.953089,0.00009506605,0.000058710368,0.000081866834,0.00007523492,0.0038443434,0.0051708976],"genre_scores_gemma":[0.3624257,0.0003328247,0.633041,0.00008158477,0.000042862128,0.000104357954,0.00029893295,0.00035100468,0.0033216977],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998048,0.000038571383,0.000009596499,0.000027725311,0.000087502915,0.000031749718],"domain_scores_gemma":[0.99980825,0.000076058626,0.000023165136,0.000048947328,0.000035946745,0.000007611969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001830806,0.0006027185,0.00032054022,0.00059177517,0.0003200925,0.00039874887,0.00075181096,0.00027097008,0.0032481316],"category_scores_gemma":[0.0007075226,0.00029715704,0.00028906798,0.0004690887,0.0002620034,0.000575526,0.00051085895,0.00039473534,0.0006250413],"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.0002864656,0.000060210252,0.0009514566,0.00017064315,0.000038446313,0.0002478634,0.00010540094,0.35509524,0.052695356,0.019038888,0.0053756866,0.5659344],"study_design_scores_gemma":[0.000077244,0.0002026461,0.0006261817,0.000025339787,0.000042057116,0.000242796,0.000055330296,0.93083304,0.03396537,0.01771661,0.016191479,0.000021959204],"about_ca_topic_score_codex":0.0018345698,"about_ca_topic_score_gemma":0.0045047947,"teacher_disagreement_score":0.0032481316,"about_ca_system_score_codex":0.00044731417,"about_ca_system_score_gemma":0.000451067,"threshold_uncertainty_score":0.010866046},"labels":[],"label_agreement":null}]}