{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":3,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":3,"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"},"query_hash":"decca7156721","filters":{"venue":"2013 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)"}},"results":[{"id":"W4251821671","doi":"10.1109/iccad.2013.6691168","title":"Redundancy-aware Electromigration checking for mesh power grids","year":2013,"lang":"en","type":"article","venue":"2013 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)","topic":"Copper Interconnects and Reliability","field":"Materials Science","cited_by":26,"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":"Electromigration; Redundancy (engineering); Reliability (semiconductor); Grid; Computer science; Interconnection; Power grid; Reliability engineering; Circuit reliability; Algorithm; Power (physics); Electrical engineering; Mathematics; Engineering; Physics; Geometry; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.06861736363377133,"gpt":0.3001561103997518,"spread":0.2315387467659804,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0007953661,0.0004757586,0.0004741312,0.0002331455,0.0002703341,0.0008685951,0.001563942,0.0002409308,0.004466299],"category_scores_gemma":[0.0002187686,0.0004050509,0.000235069,0.0001374995,0.0001472065,0.0008047467,0.0001947014,0.0003229003,0.001219135],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002970225,"about_ca_system_score_gemma":0.0002519165,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000338556,"about_ca_topic_score_gemma":0.00003947901,"domain_scores_codex":[0.9966024,0.0002347225,0.000806235,0.00103174,0.0006767355,0.000648146],"domain_scores_gemma":[0.9966385,0.0005644709,0.0003685274,0.0008292712,0.001387632,0.000211643],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003817282,0.0005134998,0.0001221631,0.00005776278,0.0001248944,0.000007738567,0.0007463834,0.001241337,0.811752,0.0304028,0.1460044,0.00864532],"study_design_scores_gemma":[0.002620016,0.0032238,0.001593021,0.0005880049,0.00005316399,0.00006092945,0.0001954619,0.4874001,0.4311366,0.06610082,0.00545593,0.001572157],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3916137,0.00003287681,0.5916495,0.006378399,0.00668762,0.001799452,0.00006035293,0.0003275079,0.001450566],"genre_scores_gemma":[0.969997,0.00004383449,0.02659458,0.0009193381,0.0008049718,0.0004035325,0.00006596882,0.00004993035,0.001120841],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5783833,"threshold_uncertainty_score":0.9998401,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4237740194","doi":"10.1109/iccad.2013.6691124","title":"FPGA acceleration of enhanced boolean constraint propagation for SAT solvers","year":2013,"lang":"en","type":"article","venue":"2013 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Hardware acceleration; Field-programmable gate array; Parallel computing; Boolean satisfiability problem; Gate array; Embedded system; Software; Multi-core processor; Computer architecture; Computer hardware; Theoretical computer science; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.1346806322324103,"gpt":0.3298127657875132,"spread":0.1951321335551029,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009358671,0.0003908227,0.0004067351,0.0004049304,0.0001666026,0.0005185832,0.002434663,0.000207877,0.0002119578],"category_scores_gemma":[0.0002931753,0.0003823116,0.0001704963,0.000266259,0.0001830289,0.001830858,0.0002083543,0.0002714306,0.0002827276],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002252224,"about_ca_system_score_gemma":0.0002972783,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007128788,"about_ca_topic_score_gemma":0.000005092425,"domain_scores_codex":[0.9966629,0.0003087361,0.0009686585,0.0008389821,0.0007888738,0.0004319123],"domain_scores_gemma":[0.9957249,0.0005133467,0.0007920504,0.001000173,0.001807189,0.0001623047],"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.0001662591,0.0003708967,0.00002869869,0.00007999266,0.0001636968,0.000001893371,0.001077379,0.009798396,0.2490483,0.4495168,0.009037206,0.2807104],"study_design_scores_gemma":[0.0008220149,0.0006454657,0.0005065697,0.0001262661,0.000009678886,0.000008043537,0.00004103352,0.7259926,0.2449337,0.02637512,0.0001914735,0.0003480088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01242862,0.000007755337,0.9798586,0.001630011,0.002665537,0.001896929,0.00001507101,0.0002164517,0.00128096],"genre_scores_gemma":[0.506542,0.00002223937,0.4924825,0.0002741912,0.0001997626,0.0002709754,0.00003973145,0.00001737364,0.0001511674],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7161942,"threshold_uncertainty_score":0.9998629,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4251368852","doi":"10.1109/iccad.2013.6691170","title":"A Vectorless framework for power grid electromigration checking","year":2013,"lang":"en","type":"article","venue":"2013 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)","topic":"Copper Interconnects and Reliability","field":"Materials Science","cited_by":5,"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":"Electromigration; Computer science; Reliability (semiconductor); Workload; Conservatism; Grid; Pessimism; Power (physics); Power integrity; Very-large-scale integration; Reliability engineering; Chip; Power grid; Interconnection; Electronic engineering; Electrical engineering; Telecommunications; Engineering; Embedded system; Physics; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.07865958355693928,"gpt":0.3138129411733506,"spread":0.2351533576164113,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0007116295,0.0004495209,0.0004568784,0.000215543,0.000237274,0.0008849653,0.00154251,0.0002774171,0.004042198],"category_scores_gemma":[0.0003862921,0.0003820443,0.000218831,0.0001430056,0.0001322825,0.0006395722,0.0001786045,0.0003967722,0.00128416],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002649303,"about_ca_system_score_gemma":0.0001946473,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003512874,"about_ca_topic_score_gemma":0.0000285603,"domain_scores_codex":[0.9968249,0.000230521,0.0007207438,0.0009594916,0.0006406796,0.0006237007],"domain_scores_gemma":[0.9965135,0.001004352,0.0003626578,0.0008039538,0.001113309,0.0002022685],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0004853176,0.000623571,0.000194641,0.00006208411,0.0001452756,0.000008399397,0.0009777566,0.001753197,0.7879107,0.1344381,0.06499452,0.008406496],"study_design_scores_gemma":[0.002131226,0.002633223,0.003067769,0.0008750727,0.00005451907,0.00004950982,0.000186096,0.3316034,0.4059579,0.2468397,0.00488362,0.001717919],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3317037,0.00002591774,0.654967,0.004257013,0.007017428,0.001232223,0.00003901701,0.0002191787,0.0005386083],"genre_scores_gemma":[0.9061891,0.00003210794,0.09092475,0.00100471,0.001067733,0.000396289,0.00003745509,0.0000452373,0.0003025469],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5744855,"threshold_uncertainty_score":0.9998631,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}