{"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002559225,0.00017098317,0.98567235,0.00042477914,0.0035244075,0.0005864811,0.000054552744,0.00027208362,0.006735104],"genre_scores_gemma":[0.15888213,0.00037269323,0.83840966,0.0008924297,0.00033168122,0.000078213336,0.00002945579,0.000053777072,0.0009499478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955434,0.00054345524,0.0008760934,0.0012866572,0.0010466819,0.0007036625],"domain_scores_gemma":[0.9973252,0.00034494663,0.00033224613,0.0012681965,0.00040762688,0.0003218305],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013967846,0.00057782873,0.0004740079,0.00044790067,0.0002920774,0.0010672528,0.0026603248,0.00025076044,0.00044514955],"category_scores_gemma":[0.00021057177,0.0005716072,0.00013532386,0.00044614717,0.00018608366,0.0019010553,0.00023372643,0.0006469723,0.0003230979],"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.00030076745,0.00085247296,0.00022326114,0.00011335604,0.000403129,0.00017434216,0.002246261,0.003032759,0.055123296,0.5182343,0.036098577,0.3831975],"study_design_scores_gemma":[0.002764132,0.0007840333,0.0004859127,0.00033126716,0.000042754815,0.0003962496,0.00004647266,0.8600212,0.08599167,0.018285833,0.029259395,0.0015911106],"about_ca_topic_score_codex":0.00003307134,"about_ca_topic_score_gemma":0.0000027425044,"teacher_disagreement_score":0.85698843,"about_ca_system_score_codex":0.00023967861,"about_ca_system_score_gemma":0.00020706822,"threshold_uncertainty_score":0.9999697},"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":"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.0011465818,0.00003291316,0.9687831,0.00023613703,0.0018074843,0.0011021099,0.00015029649,0.0006701841,0.026071219],"genre_scores_gemma":[0.66836596,0.00016693927,0.32601988,0.0013349331,0.0006461013,0.00058141956,0.00012768437,0.00015432468,0.0026027532],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976522,0.00012514918,0.00059577613,0.0005590637,0.00056055054,0.0005073139],"domain_scores_gemma":[0.9985426,0.00028000065,0.00012213275,0.00054838305,0.00032485707,0.00018200191],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003150097,0.0004953106,0.0003620413,0.00043061157,0.00016000817,0.00024876918,0.0008399518,0.0002027358,0.0015030236],"category_scores_gemma":[0.000069201014,0.00051434385,0.00016308947,0.00018878648,0.000058340323,0.00027243805,0.000048006932,0.00032919427,0.0004183158],"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.00014784475,0.0004096792,0.00005262282,0.000036381545,0.00036230165,0.000025933103,0.00027112383,0.6826408,0.0069082025,0.049314782,0.2546992,0.005131103],"study_design_scores_gemma":[0.0019483601,0.0009790165,0.00006452615,0.00025712224,0.00004083928,0.000027733522,0.000035960515,0.9221646,0.052178644,0.002526063,0.018893294,0.00088384666],"about_ca_topic_score_codex":0.00000711765,"about_ca_topic_score_gemma":0.0000036747892,"teacher_disagreement_score":0.6672194,"about_ca_system_score_codex":0.0003533693,"about_ca_system_score_gemma":0.00008368237,"threshold_uncertainty_score":0.9997308},"labels":[],"label_agreement":null}]}