{"meta":{"query_hash":"6f429cfa8dcf","filters":{"venue":"Proceedings of the International Symposium on Memory Systems"},"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/6f429cfa8dcf","api":"https://metacan.xera.ac/api/v1/cohort?venue=Proceedings+of+the+International+Symposium+on+Memory+Systems"},"results":[{"id":"W2763812888","doi":"10.1145/3132402.3132428","title":"Task replication and control for highly parallel in-memory stores","year":2017,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Memory Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"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":"Computer science; Replication (statistics); Von Neumann architecture; Task (project management); Architecture; Computer architecture; Class (philosophy); Distributed computing; Control (management); Parallel computing; Operating system; Embedded system; Engineering","score_opus":0.015234232984545732,"score_gpt":0.2611896718994404,"score_spread":0.2459554389148947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2763812888","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.671868,0.00045307356,0.22349605,0.050215673,0.0060718497,0.0050550182,0.000055301934,0.00065778405,0.042127203],"genre_scores_gemma":[0.9946797,0.000021648631,0.0038947193,0.00017054504,0.00014742099,0.00014488984,9.412752e-7,0.000009536498,0.00093062065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877805,0.000011309886,0.0003466616,0.00040264407,0.00032589413,0.0001354551],"domain_scores_gemma":[0.9983937,0.000097494776,0.00067292363,0.00043196682,0.00036689697,0.000037028523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008443687,0.00012289059,0.00018829605,0.00009009151,0.00023065197,0.00039855822,0.0020323459,0.000064772146,2.702071e-7],"category_scores_gemma":[0.00030810953,0.00009549798,0.00006276645,0.00004639455,0.000068842994,0.0004401419,0.00023246554,0.00009021782,0.0000011296409],"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.000727786,0.0006277694,0.06878189,0.00081866124,0.00035102386,0.000002718318,0.0033394683,0.041702606,0.23805852,0.60849637,0.02790386,0.00918935],"study_design_scores_gemma":[0.0032987015,0.00030809842,0.025067098,0.000841994,0.00002260219,0.000043629436,0.00010788694,0.90903026,0.049871616,0.0058600167,0.0050397115,0.00050839153],"about_ca_topic_score_codex":0.000101790465,"about_ca_topic_score_gemma":0.0000020046123,"teacher_disagreement_score":0.86732763,"about_ca_system_score_codex":0.00007588403,"about_ca_system_score_gemma":0.000022196284,"threshold_uncertainty_score":0.38942945},"labels":[],"label_agreement":null},{"id":"W2907067508","doi":"10.1145/3240302.3240417","title":"Data-driven spatial locality","year":2018,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Memory Systems","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":7,"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 British Columbia","funders":"","keywords":"Locality; Computer science; Locality of reference; Cache; Spatial analysis; Bandwidth (computing); Database; Parallel computing; Computer network; Geography","score_opus":0.023849402917759863,"score_gpt":0.25570668457155293,"score_spread":0.23185728165379307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907067508","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.74952567,0.000069266345,0.05135904,0.013972197,0.032640874,0.0014260971,0.00031216693,0.0005192941,0.15017538],"genre_scores_gemma":[0.9974354,0.0000022295328,0.0005740133,0.00023686998,0.00092323375,0.000011543805,0.0000033923677,0.000009043228,0.0008042984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822617,0.000021317612,0.0003586232,0.00045782005,0.000758829,0.00017723892],"domain_scores_gemma":[0.99850875,0.000057686808,0.00034503345,0.00051829545,0.00051037583,0.000059868322],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0008241957,0.00014246593,0.00016655741,0.00006665498,0.00014758167,0.0002248814,0.0056061456,0.000056484212,0.000011927672],"category_scores_gemma":[0.00009077307,0.000099392506,0.000075514385,0.00020800314,0.00017478561,0.0006120641,0.0011602353,0.0001352249,0.000059041045],"study_design_candidate":"theoretical_or_conceptual","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.00021471245,0.0006099579,0.00792092,0.00022752314,0.00046806489,0.000004532166,0.0021207507,0.0008555846,0.14738916,0.80996305,0.023684386,0.0065413923],"study_design_scores_gemma":[0.0011242714,0.0004815926,0.0028577384,0.00064657314,0.00004020622,0.00014650892,0.00036891486,0.78241706,0.16790776,0.00984589,0.033529337,0.0006341696],"about_ca_topic_score_codex":0.000111802525,"about_ca_topic_score_gemma":0.000004636918,"teacher_disagreement_score":0.80011714,"about_ca_system_score_codex":0.000055317985,"about_ca_system_score_gemma":0.000028993984,"threshold_uncertainty_score":0.999774},"labels":[],"label_agreement":null},{"id":"W2984179089","doi":"10.1145/3357526.3357548","title":"A unifying abstraction for data structure splicing","year":2019,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Memory Systems","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":7,"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 British Columbia","funders":"","keywords":"Computer science; Locality; Abstraction; Cache; Data structure; RNA splicing; Data space; Parallel computing; Space (punctuation); Cache coherence; Distributed computing; Theoretical computer science; CPU cache; Programming language; Cache algorithms; Operating system; Artificial intelligence","score_opus":0.02552026042809518,"score_gpt":0.2690551292417009,"score_spread":0.2435348688136057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2984179089","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.94530404,0.00008759192,0.028287565,0.0055196094,0.010064473,0.0020432945,0.0002841058,0.00053677545,0.007872554],"genre_scores_gemma":[0.99136543,0.0000047565354,0.007767236,0.00007432743,0.00014728137,0.000018846578,0.00001297369,0.000013118944,0.0005960461],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998584,0.0000032004978,0.0002989966,0.0004653985,0.00049382634,0.00015461128],"domain_scores_gemma":[0.99848664,0.00010423963,0.0004932143,0.0006228692,0.00027261628,0.000020403992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003302798,0.0001320426,0.00015960878,0.000091179165,0.000076195625,0.00018379767,0.0047118976,0.000075154094,0.0000025024144],"category_scores_gemma":[0.00016787219,0.00009722659,0.00004447203,0.00016339413,0.000029263121,0.0013438358,0.0010375183,0.00016593497,0.000008272305],"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.00004626244,0.000036414473,0.0015544826,0.00028417257,0.00008088297,3.752711e-7,0.00018734414,0.0046870573,0.8579943,0.12990232,0.0027736188,0.0024527472],"study_design_scores_gemma":[0.0012029157,0.00022147427,0.0007679458,0.0010142598,0.000030439882,0.00015413095,0.0011441915,0.46241236,0.49690452,0.0077849887,0.027782882,0.0005798657],"about_ca_topic_score_codex":0.000041744985,"about_ca_topic_score_gemma":0.0000016713926,"teacher_disagreement_score":0.45772532,"about_ca_system_score_codex":0.00014203071,"about_ca_system_score_gemma":0.000020987294,"threshold_uncertainty_score":0.8755957},"labels":[],"label_agreement":null},{"id":"W2985229340","doi":"10.1145/3357526.3357532","title":"Co-ML: a case for Co llaborative ML acceleration using near-data processing","year":2019,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Memory Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"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; Byte; Computation; Parallel computing; Bandwidth (computing); Acceleration; Focus (optics); Computational science; Algorithm; Operating system; Telecommunications","score_opus":0.04889868365628411,"score_gpt":0.3239617906846056,"score_spread":0.2750631070283215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2985229340","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.70168304,0.00015182355,0.2676639,0.0027542866,0.0038262226,0.003597219,0.00014122434,0.00067904725,0.019503249],"genre_scores_gemma":[0.9761279,0.0000037881946,0.02276321,0.00016348866,0.00024575338,0.00004410919,0.000015227197,0.000024349123,0.0006121654],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805784,0.00002397961,0.00051909446,0.000584715,0.000605334,0.00020901184],"domain_scores_gemma":[0.997619,0.00009692771,0.00076643203,0.00036592898,0.0011008022,0.00005091546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009369074,0.00020239652,0.00025049876,0.00011367752,0.00030685897,0.0009590491,0.0023299628,0.00009546186,0.0000032936732],"category_scores_gemma":[0.000114401075,0.00016116221,0.00007396231,0.00031577842,0.000048051737,0.0013287698,0.00029646402,0.00015010178,0.000007067747],"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.0005582724,0.0011582804,0.0136981495,0.0030101705,0.0007561222,0.0000339675,0.015154427,0.3051154,0.5352444,0.07084719,0.044291727,0.0101318965],"study_design_scores_gemma":[0.0003912288,0.00009874387,0.000021137048,0.00032878492,0.000011141987,0.0002425595,0.00021291603,0.949982,0.04648939,0.00009090932,0.0019366656,0.00019450656],"about_ca_topic_score_codex":0.0000787818,"about_ca_topic_score_gemma":0.0000013227767,"teacher_disagreement_score":0.6448666,"about_ca_system_score_codex":0.00018124863,"about_ca_system_score_gemma":0.00014896685,"threshold_uncertainty_score":0.9248133},"labels":[],"label_agreement":null},{"id":"W7126205634","doi":"10.1145/3767110.3767122","title":"Stream-Aware Intelligent Memory Controller through HW/SW Co-Design","year":2025,"lang":"","type":"article","venue":"Proceedings of the International Symposium on Memory Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada); McMaster University","funders":"","keywords":"Bottleneck; Flat memory model; Scheduling (production processes); Memory management; Speedup; Memory hierarchy; Interleaved memory; Uniform memory access; Memory map","score_opus":0.024322504317572123,"score_gpt":0.2804338254639932,"score_spread":0.2561113211464211,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7126205634","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.0073783263,0.0016310293,0.70259917,0.016655425,0.018225025,0.0054704137,0.00008275046,0.0009130217,0.24704483],"genre_scores_gemma":[0.9618935,0.00038445927,0.003125539,0.0012824903,0.00055872014,0.00019471865,0.0000048512757,0.000050298553,0.032505434],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99434614,0.00016987923,0.0018493886,0.0012232487,0.0017900708,0.000621268],"domain_scores_gemma":[0.99482995,0.00048253767,0.0017306828,0.0005935972,0.0022354051,0.00012784445],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0021135306,0.0007023984,0.00093142886,0.00038496067,0.0005167415,0.0010533001,0.0057603177,0.00036488034,0.00003340049],"category_scores_gemma":[0.00033731357,0.0005637486,0.0005264694,0.0008756648,0.00030297137,0.00073910283,0.001009861,0.0006527109,0.000051424337],"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.0017810117,0.0023460018,0.0014524638,0.0018371252,0.003146736,0.000009068567,0.008185243,0.47931203,0.040995408,0.18470562,0.26628178,0.009947488],"study_design_scores_gemma":[0.0015910955,0.00036859565,0.00005314966,0.0036737544,0.00011446734,0.000036303256,0.00077776844,0.7164763,0.26524702,0.0018213568,0.009191535,0.00064862415],"about_ca_topic_score_codex":0.00029890196,"about_ca_topic_score_gemma":9.546986e-7,"teacher_disagreement_score":0.95451516,"about_ca_system_score_codex":0.00072421937,"about_ca_system_score_gemma":0.00031617488,"threshold_uncertainty_score":0.9999837},"labels":[],"label_agreement":null}]}