{"meta":{"query_hash":"bccdcc870528","filters":{"venue":"International Symposium on Microarchitecture"},"cohort_total":5,"direct_labels_cover":0,"predictions_cover":5,"exported":5,"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/bccdcc870528","api":"https://metacan.xera.ac/api/v1/cohort?venue=International+Symposium+on+Microarchitecture"},"results":[{"id":"W2121522147","doi":"10.5555/563998.564024","title":"Mapping reference code to irregular DSPs within the retargetable, optimizing compiler COGEN(T)","year":2001,"lang":"en","type":"article","venue":"International Symposium on Microarchitecture","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","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 Guelph","funders":"","keywords":"Computer science; Compiler; Dead code; Unreachable code; Code (set theory); Parallel computing; Code generation; Programming language; Redundant code; Object code; Schedule; Abstraction; Set (abstract data type); Dead code elimination; Instruction set; Operating system","score_opus":0.01927482218811427,"score_gpt":0.25990138114751543,"score_spread":0.24062655895940116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121522147","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.017546643,0.000085910026,0.941143,0.025862617,0.0007692577,0.0003718097,0.000018575054,0.0005528059,0.013649378],"genre_scores_gemma":[0.6416408,0.000050083094,0.345469,0.009879876,0.00032429103,0.000056004297,0.00004482895,0.00003793306,0.0024972123],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978282,0.00016281706,0.00042249725,0.0006657828,0.00055712176,0.00036357177],"domain_scores_gemma":[0.99853295,0.00015457517,0.00019787505,0.0007380583,0.00024392919,0.00013258557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043394527,0.00028823756,0.00021246333,0.00023625567,0.0003502605,0.00041259718,0.002599477,0.00010816478,0.000037092766],"category_scores_gemma":[0.000059677022,0.00021619773,0.00010289097,0.0005707754,0.00007237614,0.00015647383,0.0005299448,0.00050166086,0.00010862209],"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.00010375647,0.0001384681,0.00048686907,0.000009749962,0.00012806611,0.00005617133,0.0039075017,0.89671725,0.05689343,0.022948006,0.01030679,0.0083039645],"study_design_scores_gemma":[0.00095383567,0.00030757647,0.0016683855,0.00040694096,0.000014416191,0.000644962,0.00011541982,0.46827725,0.046393212,0.0049620266,0.47504085,0.0012151244],"about_ca_topic_score_codex":0.00004528173,"about_ca_topic_score_gemma":0.000018263163,"teacher_disagreement_score":0.6240941,"about_ca_system_score_codex":0.0001213382,"about_ca_system_score_gemma":0.000052863554,"threshold_uncertainty_score":0.88162875},"labels":[],"label_agreement":null},{"id":"W2562506265","doi":"10.5555/3195638.3195690","title":"The bunker cache for spatio-value approximation","year":2016,"lang":"en","type":"article","venue":"International Symposium on Microarchitecture","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":37,"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":"Cache; Computer science; Parallel computing; Cache algorithms; Cache pollution; Cache coloring; Smart Cache; Cache invalidation; Page cache; Bunker; Cache-oblivious algorithm; CPU cache","score_opus":0.008961541499873363,"score_gpt":0.25387341801218455,"score_spread":0.2449118765123112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2562506265","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.0015343076,0.000030479046,0.9451411,0.049424496,0.00067206123,0.00031612717,0.000016714872,0.0002783685,0.0025863717],"genre_scores_gemma":[0.7478642,0.00009085701,0.24269608,0.0027971484,0.0007281362,0.00026922926,0.00003437711,0.000041173556,0.0054788487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99885184,0.00007005604,0.0002316902,0.00034896156,0.00027976825,0.00021769549],"domain_scores_gemma":[0.9987351,0.0005009674,0.0001385558,0.00039375635,0.00018581066,0.000045844114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028083785,0.00014698175,0.000087325316,0.0000756382,0.00026855676,0.00021885507,0.0012201013,0.00007005696,0.000005590577],"category_scores_gemma":[0.00012677751,0.00007965173,0.000102094295,0.00010628253,0.00006186737,0.00012620924,0.00013596882,0.00009688551,0.000028359234],"study_design_candidate":"not_applicable","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.00016557102,0.00014408995,0.00021268232,0.0000124083,0.00012761004,0.0000024815831,0.0007567,0.018715521,0.08329682,0.51421845,0.027043646,0.355304],"study_design_scores_gemma":[0.0015193594,0.00032435136,0.00065484445,0.00014849857,0.000010266649,0.000054094573,0.000007948688,0.18138745,0.16002172,0.056468047,0.59882885,0.00057453377],"about_ca_topic_score_codex":0.0000078498,"about_ca_topic_score_gemma":0.0000049267956,"teacher_disagreement_score":0.74632984,"about_ca_system_score_codex":0.000101684665,"about_ca_system_score_gemma":0.000034123088,"threshold_uncertainty_score":0.32481033},"labels":[],"label_agreement":null},{"id":"W2564142802","doi":"10.5555/3195638.3195698","title":"CHAINSAW: von-neumann accelerators to leverage fused instruction chains","year":2016,"lang":"en","type":"article","venue":"International Symposium on Microarchitecture","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","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":"Simon Fraser University","funders":"","keywords":"Computer science; Parallel computing; Compiler; Microarchitecture; Dataflow; SIMD; Very long instruction word; Von Neumann architecture; Pipeline (software); Code generation; Computer architecture; Leverage (statistics); Instruction scheduling; Partition (number theory); Programming language; Operand; Key (lock); Computer hardware; Operating system; Schedule","score_opus":0.010291208689817694,"score_gpt":0.2465166505645503,"score_spread":0.2362254418747326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2564142802","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.106787056,0.000011033204,0.8581976,0.029899197,0.0014493021,0.00025492365,0.00001978084,0.0007172737,0.0026637823],"genre_scores_gemma":[0.9594308,0.00002822403,0.034371752,0.003266133,0.00041286263,0.00003767854,0.00000803208,0.000027684277,0.0024168082],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99817693,0.00008455656,0.0003109954,0.0006585247,0.00044330984,0.00032569753],"domain_scores_gemma":[0.9989134,0.00009094811,0.00013001777,0.00052829384,0.00017878524,0.00015853177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015716425,0.00026285273,0.00017284646,0.00038254535,0.00016493828,0.00021811799,0.0015098412,0.0001164015,0.000037778933],"category_scores_gemma":[0.000056280358,0.00019361217,0.00011269943,0.00033315207,0.00004417512,0.00023210945,0.00032605114,0.0001875535,0.00014459345],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00023293619,0.00035030453,0.00096901535,0.000021065713,0.00017970777,0.00005226357,0.0030646976,0.033312537,0.5263194,0.08204582,0.011491807,0.34196046],"study_design_scores_gemma":[0.004214244,0.0011297101,0.008283265,0.0007101492,0.000013566193,0.0003092891,0.00002140911,0.029909914,0.6296655,0.0055429684,0.3180508,0.002149153],"about_ca_topic_score_codex":0.000020135478,"about_ca_topic_score_gemma":0.000009735419,"teacher_disagreement_score":0.8526438,"about_ca_system_score_codex":0.0002135625,"about_ca_system_score_gemma":0.000045100453,"threshold_uncertainty_score":0.78952754},"labels":[],"label_agreement":null},{"id":"W2898902424","doi":"","title":"EcoRNN: Efficient Computing of LSTM RNN on GPUs","year":2018,"lang":"en","type":"article","venue":"International Symposium on Microarchitecture","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Recurrent neural network; Parallel computing; Artificial intelligence; Artificial neural network","score_opus":0.007741681398862896,"score_gpt":0.25308549970870126,"score_spread":0.24534381830983837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898902424","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7362252,0.000036438683,0.20740084,0.01799427,0.0038979722,0.00043254843,0.00004719113,0.00022952458,0.033736058],"genre_scores_gemma":[0.9915569,0.0000027232386,0.0052549248,0.002221659,0.0006638748,0.0000058168666,0.000007942961,0.000011667849,0.00027451292],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99872845,0.000036709127,0.0002562282,0.00042587053,0.0003385966,0.00021416409],"domain_scores_gemma":[0.99907357,0.00013142225,0.0001532171,0.0004326028,0.00014222921,0.0000669547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011389307,0.0001577157,0.00013091769,0.000110332745,0.00012705487,0.000079237216,0.0011580472,0.000055300872,0.000025780362],"category_scores_gemma":[0.000010792639,0.0001307116,0.00009983305,0.00024363698,0.000111076515,0.00002961759,0.0002304497,0.00021237035,0.00013415217],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00019542717,0.0011059416,0.0004271491,0.000024431316,0.00015721246,0.000022519635,0.0020037314,0.13371977,0.39948714,0.2925589,0.015089487,0.15520829],"study_design_scores_gemma":[0.0013800188,0.0013297478,0.0045841006,0.00036111675,0.000015164283,0.00011777419,0.000020075458,0.39141694,0.41886136,0.00434907,0.17677356,0.00079108856],"about_ca_topic_score_codex":0.000013079911,"about_ca_topic_score_gemma":0.0000046477985,"teacher_disagreement_score":0.28820986,"about_ca_system_score_codex":0.000049912178,"about_ca_system_score_gemma":0.000019577361,"threshold_uncertainty_score":0.53302646},"labels":[],"label_agreement":null},{"id":"W2898977042","doi":"","title":"Design and Analysis of Efficient Inter-core Communication in GPUs","year":2018,"lang":"en","type":"article","venue":"International Symposium on Microarchitecture","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Core (optical fiber); Parallel computing; Multi-core processor; Computer architecture; Telecommunications","score_opus":0.014238400297660853,"score_gpt":0.27583450085834393,"score_spread":0.26159610056068305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898977042","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.13131231,0.000041487147,0.86615705,0.001270933,0.00008780768,0.00011812229,0.0000039236365,0.000070815244,0.00093752693],"genre_scores_gemma":[0.85200036,0.000019225748,0.14766686,0.00023878379,0.000014547693,0.0000065978775,0.000011013015,0.000004704312,0.000037894974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905825,0.00011164226,0.00026223794,0.0002791405,0.00017528985,0.0001134587],"domain_scores_gemma":[0.9991119,0.00017587133,0.00013801409,0.00039571564,0.00014746362,0.00003107369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028547255,0.00010825071,0.00016219166,0.0005880559,0.000049102044,0.000058199024,0.0008542329,0.00005704511,0.000010481561],"category_scores_gemma":[0.000030192683,0.00009796463,0.000054503176,0.0006676538,0.000115303155,0.00004312737,0.00025469676,0.00013592256,0.0000030909107],"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.00019802962,0.00044144847,0.005876504,0.000012661439,0.0005048702,0.000006454251,0.009649011,0.8711485,0.0562906,0.01902633,0.0004958792,0.036349695],"study_design_scores_gemma":[0.0002296497,0.00012763546,0.0043544117,0.00005333514,0.000016321836,0.0000065765007,0.000006726667,0.9732485,0.020687541,0.00079642644,0.0003533817,0.000119526674],"about_ca_topic_score_codex":0.00004596321,"about_ca_topic_score_gemma":0.000016857006,"teacher_disagreement_score":0.72068805,"about_ca_system_score_codex":0.000050787054,"about_ca_system_score_gemma":0.000016059816,"threshold_uncertainty_score":0.39948815},"labels":[],"label_agreement":null}]}