{"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":"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.33759546,0.00084298564,0.6498174,0.00045788797,0.0002009437,0.00013762957,0.00009447809,0.0007914417,0.010061751],"genre_scores_gemma":[0.9752295,0.0001546221,0.02165555,0.00002890271,0.000041890282,0.000058287384,0.000032589855,0.00004974746,0.0027489695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995035,0.0001073989,0.000035884623,0.00008113607,0.00015948137,0.000112714624],"domain_scores_gemma":[0.99827623,0.0007183078,0.00024418018,0.00033438715,0.00029319036,0.00013367941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010526523,0.00039402474,0.00054529327,0.0003489441,0.00069451064,0.001474826,0.0016111839,0.00036589804,0.0023339775],"category_scores_gemma":[0.004015584,0.00023311563,0.00023160226,0.0004693403,0.0007341953,0.0010281805,0.000985819,0.0006418017,0.00023043904],"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.0012521351,0.00036289188,0.0021681862,0.0003044848,0.00006697765,0.0003650448,0.00055239705,0.72288465,0.07572762,0.120778844,0.0032307268,0.07230613],"study_design_scores_gemma":[0.00003023957,0.000050379076,0.00023600209,0.000004366306,0.000008510132,0.000021737147,0.00003063188,0.9821394,0.00398476,0.012880217,0.00060617813,0.000007557658],"about_ca_topic_score_codex":0.0041976967,"about_ca_topic_score_gemma":0.005543281,"teacher_disagreement_score":0.0041976967,"about_ca_system_score_codex":0.0007993074,"about_ca_system_score_gemma":0.0010395631,"threshold_uncertainty_score":0.008346498},"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":"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.1218998,0.002798672,0.7852403,0.0036575196,0.00045960696,0.0002815152,0.0015223947,0.008539527,0.075600676],"genre_scores_gemma":[0.77936655,0.0012072427,0.18224344,0.0012896538,0.00016170915,0.0004922925,0.0012740948,0.002313188,0.031651784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974195,0.00044940942,0.00012858762,0.0004584916,0.0012013591,0.00034270893],"domain_scores_gemma":[0.991699,0.0019421938,0.00043309675,0.0033303266,0.0023004785,0.00029506395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016356449,0.0004895455,0.00060018076,0.00084524025,0.0013913773,0.0019755627,0.002731515,0.0008252155,0.010326759],"category_scores_gemma":[0.0103939045,0.0006742988,0.00056139764,0.0018372069,0.0022290503,0.006548276,0.0047901818,0.0017216614,0.0029402128],"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.00082733156,0.00036370123,0.010531906,0.0010326585,0.0001388666,0.0005474343,0.0019483377,0.09309191,0.061138753,0.55400974,0.057158273,0.21921112],"study_design_scores_gemma":[0.00014702821,0.00027495206,0.0022375092,0.00014185284,0.00011546894,0.0010495089,0.00084981613,0.3091029,0.08621796,0.4623379,0.13737886,0.00014631094],"about_ca_topic_score_codex":0.0028450168,"about_ca_topic_score_gemma":0.0048544933,"teacher_disagreement_score":0.010326759,"about_ca_system_score_codex":0.001681389,"about_ca_system_score_gemma":0.0023001092,"threshold_uncertainty_score":0.034546494},"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":"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.0018912575,0.001396385,0.9829422,0.0013002824,0.0008119433,0.00021970177,0.0002655944,0.0023095552,0.008862996],"genre_scores_gemma":[0.06438381,0.0034899781,0.9008902,0.0032101523,0.00239905,0.00096225785,0.0012747402,0.003077634,0.020312246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9906002,0.0015282716,0.0015027612,0.0019286699,0.0035503553,0.0008896358],"domain_scores_gemma":[0.9854827,0.0024962875,0.00090186426,0.008177588,0.0024970435,0.00044448607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063889925,0.0017237378,0.002288144,0.0033164457,0.0034459927,0.009235708,0.0069996677,0.003392884,0.0076013645],"category_scores_gemma":[0.01565596,0.0016642008,0.0059001707,0.0060323845,0.008618477,0.019951876,0.012061862,0.010436071,0.0057832613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00009509051,0.00008356058,0.0008293534,0.00043137756,0.00005486375,0.00040731384,0.001029424,0.0028344265,0.0042134696,0.8878995,0.014140219,0.08798144],"study_design_scores_gemma":[0.000054524484,0.0001531759,0.0003562629,0.00028146492,0.00017621933,0.0018762001,0.00031099532,0.019081935,0.010175607,0.7096025,0.25779247,0.00013868015],"about_ca_topic_score_codex":0.002657023,"about_ca_topic_score_gemma":0.002251964,"teacher_disagreement_score":0.009235708,"about_ca_system_score_codex":0.0020896143,"about_ca_system_score_gemma":0.0045208675,"threshold_uncertainty_score":0.03378862},"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":"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.11095086,0.0152353225,0.53549075,0.047821622,0.00432851,0.00029637298,0.0003788906,0.009246561,0.2762511],"genre_scores_gemma":[0.6350915,0.002767672,0.30738822,0.009299851,0.0016469113,0.00029889034,0.0006327719,0.0022440902,0.040630095],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99655414,0.000717679,0.00013249821,0.00047538892,0.0013420903,0.00077822973],"domain_scores_gemma":[0.9900947,0.002504304,0.0005796776,0.004172584,0.0017653954,0.0008833748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030816786,0.0010369117,0.00082738424,0.0009483936,0.0014712792,0.0048314338,0.0037453778,0.0021607503,0.017632557],"category_scores_gemma":[0.010844115,0.0005879729,0.00055463397,0.001618969,0.0022990229,0.009559571,0.006667823,0.0038905295,0.008789904],"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.0016890254,0.00070111954,0.008842929,0.00079496816,0.00008943605,0.0015694046,0.00073454273,0.010057491,0.024512025,0.37261748,0.0832161,0.49517545],"study_design_scores_gemma":[0.0002472594,0.0010272434,0.004266201,0.0007404689,0.00010494873,0.004099885,0.0010166249,0.1644527,0.053062342,0.22663422,0.5441659,0.00018217739],"about_ca_topic_score_codex":0.0011659464,"about_ca_topic_score_gemma":0.002819482,"teacher_disagreement_score":0.017632557,"about_ca_system_score_codex":0.0010071482,"about_ca_system_score_gemma":0.001903646,"threshold_uncertainty_score":0.058986723},"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":"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.09046364,0.0013409492,0.88272417,0.00035798323,0.00025955465,0.0003656785,0.00017842503,0.0059248987,0.018384714],"genre_scores_gemma":[0.6266908,0.00049925124,0.3609698,0.00042926616,0.000102047925,0.00042609923,0.00042071418,0.00066867535,0.009793308],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995427,0.00006494131,0.000028699982,0.00009165331,0.00019240796,0.00007953187],"domain_scores_gemma":[0.9995468,0.00008052474,0.00006770027,0.000099154764,0.00016470076,0.000041100568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042921113,0.000810799,0.00031488374,0.00040520317,0.00023286305,0.00089276186,0.001694025,0.0002726148,0.0037560523],"category_scores_gemma":[0.0006203339,0.00028245494,0.00035031617,0.00025310472,0.00031775833,0.0007724671,0.00072879496,0.0007437411,0.00095627026],"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.0007291261,0.00048413727,0.0042811413,0.0007337641,0.0002880892,0.00052351016,0.00031964414,0.19587055,0.354721,0.01889612,0.017530592,0.40562233],"study_design_scores_gemma":[0.00014795065,0.001015607,0.0012843509,0.000051258245,0.00017667295,0.00031141893,0.000096158066,0.7725842,0.17809758,0.005837129,0.040356163,0.00004160852],"about_ca_topic_score_codex":0.0007881371,"about_ca_topic_score_gemma":0.0024641284,"teacher_disagreement_score":0.0037560523,"about_ca_system_score_codex":0.00042883793,"about_ca_system_score_gemma":0.0010319665,"threshold_uncertainty_score":0.012565255},"labels":[],"label_agreement":null}]}