{"meta":{"query_hash":"63636435038e","filters":{"venue":"Proceedings - IEEE International Parallel and Distributed Processing Symposium"},"cohort_total":14,"direct_labels_cover":0,"predictions_cover":14,"exported":14,"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/63636435038e","api":"https://metacan.xera.ac/api/v1/cohort?venue=Proceedings+-+IEEE+International+Parallel+and+Distributed+Processing+Symposium"},"results":[{"id":"W2094571222","doi":"10.1109/ipdps.2008.4536452","title":"Parallel option pricing with Fourier Space Time-stepping method on Graphics Processing Units","year":2008,"lang":"en","type":"article","venue":"Proceedings - IEEE International Parallel and Distributed Processing Symposium","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":12,"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; Graphics; Valuation of options; Range (aeronautics); Computational finance; Graphics processing unit; Fourier transform; Parallel computing; Mathematical optimization; Computational science; Computer graphics (images); Finance; Mathematics; Economics","score_opus":0.03488705910142149,"score_gpt":0.251743064700783,"score_spread":0.21685600559936152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094571222","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.021431264,0.0006216729,0.96601015,0.0032329892,0.00013333188,0.00042412276,0.00016682949,0.00021760362,0.0077620116],"genre_scores_gemma":[0.9507406,0.00022711806,0.046985544,0.00046956624,0.00041697692,0.00026595226,0.00017954146,0.00007246357,0.0006422825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975827,0.0000041740295,0.00072580564,0.0009225926,0.0002515438,0.0005132371],"domain_scores_gemma":[0.9980873,0.00005928522,0.0008279395,0.00013625008,0.0006928141,0.0001964519],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003703498,0.0004280294,0.00050929387,0.00037319903,0.00086321787,0.00035746788,0.0004017939,0.00021053173,0.000011820082],"category_scores_gemma":[0.00013846174,0.00042572583,0.00006998043,0.0010359006,0.00019877029,0.00088817545,0.00007141607,0.00039735105,0.00005136859],"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.0011266846,0.00075562834,0.012690543,0.0007537219,0.0002849402,0.000031521133,0.0039635454,0.009894272,0.0016240753,0.9632251,0.0015176742,0.0041322894],"study_design_scores_gemma":[0.0063042305,0.00092994695,0.014168009,0.0016524222,0.00016975873,0.0010080901,0.0007438038,0.7663347,0.0008462308,0.17097585,0.03357141,0.0032955352],"about_ca_topic_score_codex":0.000057021567,"about_ca_topic_score_gemma":0.0000017358288,"teacher_disagreement_score":0.9293093,"about_ca_system_score_codex":0.00014765885,"about_ca_system_score_gemma":0.00012384726,"threshold_uncertainty_score":0.99981946},"labels":[],"label_agreement":null},{"id":"W2097036372","doi":"10.1109/ipdps.2008.4536368","title":"Designing hybrid integrative evolutionary approaches to the car sequencing problem","year":2008,"lang":"en","type":"article","venue":"Proceedings - IEEE International Parallel and Distributed Processing Symposium","topic":"Assembly Line Balancing Optimization","field":"Engineering","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":"Université du Québec à Chicoutimi","funders":"","keywords":"Crossover; Computer science; Genetic algorithm; Evolutionary computation; Evolutionary algorithm; Computation; Hybrid algorithm (constraint satisfaction); Integer programming; Genetic representation; Mathematical optimization; Artificial intelligence; Algorithm; Machine learning; Mathematics; Local consistency","score_opus":0.04134679589058809,"score_gpt":0.22457018077196647,"score_spread":0.18322338488137838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097036372","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.1404302,0.0006108956,0.84610665,0.0033679644,0.0004660731,0.00074426085,0.000116358795,0.00084312895,0.0073144836],"genre_scores_gemma":[0.966914,0.000099016725,0.03186383,0.000107469874,0.00038641418,0.00022044432,0.00016777078,0.000048898997,0.00019215613],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983827,0.000011504155,0.0004120669,0.00041759273,0.00040094298,0.00037519986],"domain_scores_gemma":[0.99924964,0.000044881283,0.00012510514,0.00008131651,0.00035824985,0.00014078077],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002031341,0.00033642328,0.0002424598,0.0001509607,0.0005072477,0.00020885868,0.0003653162,0.000086739106,0.000004108905],"category_scores_gemma":[0.000068263886,0.00026664618,0.00005639885,0.00035934043,0.000101423124,0.00073774194,0.00007037856,0.00031179708,0.0000138953865],"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.000102042046,0.00006137828,0.0062445183,0.000250982,0.00016660313,0.000016149777,0.006850132,0.94751436,0.019965,0.0010755763,0.01703007,0.0007232179],"study_design_scores_gemma":[0.00052867195,0.00007007829,0.0010991951,0.00035866056,0.000051006205,0.0005611788,0.001391423,0.981753,0.009673801,0.0007349476,0.0031342083,0.0006438077],"about_ca_topic_score_codex":0.000017819248,"about_ca_topic_score_gemma":0.000002418397,"teacher_disagreement_score":0.8264838,"about_ca_system_score_codex":0.00037976567,"about_ca_system_score_gemma":0.00010426529,"threshold_uncertainty_score":0.9999786},"labels":[],"label_agreement":null},{"id":"W2108099581","doi":"10.1109/ipdps.2008.4536237","title":"A new diffusion-based multilevel algorithm for computing graph partitions of very high quality","year":2008,"lang":"en","type":"article","venue":"Proceedings - IEEE International Parallel and Distributed Processing Symposium","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Graph partition; Computer science; Partition (number theory); Graph; Heuristic; Algorithm; Vertex (graph theory); Theoretical computer science; Parallel computing; Mathematics; Combinatorics; Artificial intelligence","score_opus":0.027036500708916063,"score_gpt":0.27406991313517715,"score_spread":0.2470334124262611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108099581","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.091218375,0.00013859561,0.90693593,0.00020370043,0.00021619909,0.00025414972,0.00036652866,0.0004250623,0.00024143909],"genre_scores_gemma":[0.91502464,0.00006788603,0.08428211,0.000047663798,0.00019607518,0.00006239552,0.00024372808,0.000028664186,0.000046847348],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865454,0.000005116042,0.00050917425,0.0002854197,0.0002795751,0.00026617307],"domain_scores_gemma":[0.9991144,0.0000903145,0.0001796057,0.00006087376,0.00042471325,0.00013011236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014529185,0.00023745158,0.00030507773,0.00015249166,0.00021418219,0.00007674744,0.00021502255,0.00013212023,0.0000073912674],"category_scores_gemma":[0.0000388481,0.00023888468,0.000102106766,0.00017742426,0.00009598116,0.00029148685,0.0000255654,0.00014255349,9.3603404e-7],"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.00094109675,0.0021951215,0.04701219,0.0056404187,0.0011855582,0.000030527935,0.0055061863,0.075074,0.5504491,0.008731439,0.07882733,0.22440703],"study_design_scores_gemma":[0.0027908923,0.00014618991,0.009007657,0.0004930208,0.00007344143,0.000043316955,0.00010857455,0.9282164,0.050427202,0.0068941643,0.0010582405,0.0007409182],"about_ca_topic_score_codex":0.000060347287,"about_ca_topic_score_gemma":9.1639845e-7,"teacher_disagreement_score":0.8531424,"about_ca_system_score_codex":0.000057964986,"about_ca_system_score_gemma":0.00006718477,"threshold_uncertainty_score":0.97414345},"labels":[],"label_agreement":null},{"id":"W2118688197","doi":"10.1109/ipdps.2008.4536497","title":"A mesh hybrid adaptive service discovery protocol (MesHASeDiP): Protocol design and proof of correctness","year":2008,"lang":"en","type":"article","venue":"Proceedings - IEEE International Parallel and Distributed Processing Symposium","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"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 Ottawa","funders":"","keywords":"Service discovery; Computer science; Computer network; Scalability; Overhead (engineering); Correctness; Protocol (science); Distributed computing; Routing protocol; Service (business); Neighbor Discovery Protocol; Service provider; Routing (electronic design automation); Internet protocol suite; Web service; World Wide Web; The Internet; Database","score_opus":0.029047908998655527,"score_gpt":0.27625385243801476,"score_spread":0.24720594343935923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118688197","genre_codex":"methods","genre_gemma":"protocol","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.0029334198,0.000019187897,0.8408467,0.0007120307,0.00013296807,0.15450567,0.000042301373,0.00018835538,0.00061934715],"genre_scores_gemma":[0.46250272,0.000004597438,0.02011358,0.00020690695,0.00019272747,0.5167609,0.000021915741,0.000032983135,0.00016369356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971464,0.000036207595,0.0007090284,0.0009057086,0.0007437329,0.00045888216],"domain_scores_gemma":[0.9976481,0.00010035628,0.00071346905,0.00017704807,0.0011557023,0.00020529826],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039603855,0.00043630408,0.00044261417,0.00015613128,0.00033329675,0.0004940728,0.00095180515,0.0001331336,0.000005058593],"category_scores_gemma":[0.000051945342,0.0003861621,0.000063261185,0.00053954497,0.0002652551,0.002788391,0.00035640242,0.00031472705,0.0000016958307],"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.059037898,0.024080697,0.09002663,0.037901197,0.0038652285,0.0015726018,0.04551684,0.16995192,0.12145904,0.11930418,0.15777776,0.16950603],"study_design_scores_gemma":[0.0045843744,0.0007419486,0.0007415584,0.00094071985,0.00003517601,0.0009904744,0.00009498038,0.95047635,0.033283647,0.003863682,0.0033752127,0.0008718567],"about_ca_topic_score_codex":0.000026272948,"about_ca_topic_score_gemma":0.0000012464047,"teacher_disagreement_score":0.82073313,"about_ca_system_score_codex":0.00009295317,"about_ca_system_score_gemma":0.00033960326,"threshold_uncertainty_score":0.99985904},"labels":[],"label_agreement":null},{"id":"W2126795434","doi":"10.1109/ipdps.2008.4536190","title":"Extended characterization of DMA transfers on the Cell BE processor","year":2008,"lang":"en","type":"article","venue":"Proceedings - IEEE International Parallel and Distributed Processing Symposium","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; University of Victoria","keywords":"Computer science; Copying; Thread (computing); Message passing; Parallel computing; Multi-core processor; Computer architecture; Latency (audio); Embedded system; Distributed computing; Operating system","score_opus":0.024188566500641315,"score_gpt":0.24702972936264353,"score_spread":0.22284116286200223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126795434","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.3002575,0.000044268003,0.6845066,0.009608288,0.00020135379,0.00034789625,0.000054316264,0.00040857837,0.004571218],"genre_scores_gemma":[0.99335957,0.00022750546,0.005303892,0.00056817924,0.000083836036,0.000067227615,0.000064727625,0.000015987102,0.0003090618],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998275,0.000017880042,0.00044643044,0.00047604938,0.0005251363,0.0002595078],"domain_scores_gemma":[0.9987465,0.000053425487,0.00034435722,0.00013137577,0.000635975,0.000088379114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002426952,0.00024866988,0.0002231834,0.00015545497,0.0003892613,0.00022547973,0.00088610966,0.00010553583,0.0000055582614],"category_scores_gemma":[0.00004238875,0.00019089437,0.00007012406,0.0004354778,0.00016451908,0.0007144441,0.0000771241,0.00020189061,0.0000024976032],"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.0012752177,0.0037768518,0.009977525,0.0015778607,0.00036834224,0.000047553774,0.02244436,0.009218554,0.8051849,0.11955853,0.015368763,0.011201523],"study_design_scores_gemma":[0.0020842839,0.0007257356,0.0085138455,0.0004900974,0.000048084778,0.00021967533,0.00019006593,0.5995966,0.37861413,0.0039527323,0.004429037,0.001135666],"about_ca_topic_score_codex":0.000004587245,"about_ca_topic_score_gemma":1.0559668e-7,"teacher_disagreement_score":0.69310206,"about_ca_system_score_codex":0.000040635987,"about_ca_system_score_gemma":0.00009673116,"threshold_uncertainty_score":0.77844465},"labels":[],"label_agreement":null},{"id":"W2127431051","doi":"10.1109/ipdps.2008.4536467","title":"A linear solver for benchmarking partitioners","year":2008,"lang":"en","type":"article","venue":"Proceedings - IEEE International Parallel and Distributed Processing Symposium","topic":"Interconnection Networks and Systems","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":"University of New Brunswick","funders":"","keywords":"Computer science; Graph partition; Benchmarking; Partition (number theory); Parallel computing; Solver; Workload; Benchmark (surveying); Graph; Theoretical computer science; Mathematics; Programming language","score_opus":0.032850772555789165,"score_gpt":0.2692368145060563,"score_spread":0.23638604195026713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127431051","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.027240828,0.00012051,0.96503,0.003125797,0.0012948031,0.00027526767,0.000032822227,0.0002523226,0.002627613],"genre_scores_gemma":[0.9822032,0.00007308672,0.015631419,0.00038140488,0.00094168534,0.00017351522,0.0000655792,0.0000150849055,0.0005150642],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983958,0.0000069257267,0.0004085742,0.00052334636,0.0003233168,0.00034204274],"domain_scores_gemma":[0.9988326,0.000047159596,0.00023989276,0.00008102159,0.0006692804,0.00013008929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002464094,0.00021240841,0.00021049676,0.00011858949,0.00055370264,0.00036478235,0.000456829,0.000111131296,0.000006901702],"category_scores_gemma":[0.00003513037,0.00019706106,0.00009657541,0.00022247488,0.00008634397,0.0011274744,0.00008029259,0.00013877287,0.0000067429496],"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.0017030033,0.0020630015,0.07244319,0.0022034463,0.0013426024,0.00014142368,0.023670074,0.05113991,0.04336031,0.38225916,0.39756703,0.022106852],"study_design_scores_gemma":[0.0011479284,0.00014748843,0.00064518687,0.0001867174,0.000017038683,0.00039574996,0.00010950524,0.9552539,0.0007808993,0.0030331155,0.037825745,0.0004567063],"about_ca_topic_score_codex":0.000012516464,"about_ca_topic_score_gemma":0.0000013073334,"teacher_disagreement_score":0.9549623,"about_ca_system_score_codex":0.00007328265,"about_ca_system_score_gemma":0.00006740392,"threshold_uncertainty_score":0.80359167},"labels":[],"label_agreement":null},{"id":"W2128106933","doi":"10.1109/ipdps.2008.4536332","title":"Smart proxies in Java RMI with dynamic aspect-oriented programming","year":2008,"lang":"en","type":"article","venue":"Proceedings - IEEE International Parallel and Distributed Processing Symposium","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":5,"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 Waterloo","funders":"","keywords":"Computer science; Java; Remote procedure call; Abstraction; Proxy (statistics); Programming language; Remote evaluation; Distributed computing; Operating system; Server; Client","score_opus":0.02057417183602137,"score_gpt":0.2705028757412961,"score_spread":0.24992870390527475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128106933","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.096265785,0.00031335338,0.90074164,0.0011435174,0.0002511399,0.00028172976,0.000008694102,0.0006549416,0.00033921434],"genre_scores_gemma":[0.71691537,0.00010384767,0.28255633,0.00004327904,0.000046161484,0.00013765646,0.000025682026,0.00002118574,0.00015049182],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978982,0.000014394597,0.00039951727,0.00071234244,0.00048498638,0.0004905186],"domain_scores_gemma":[0.9990057,0.000096144526,0.00022554785,0.00012761052,0.00042602982,0.0001189626],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026658294,0.00033346348,0.0003186713,0.000265224,0.00023577518,0.0002620871,0.0006501512,0.00010857797,0.0000012748006],"category_scores_gemma":[0.00020328046,0.0002911618,0.00004026723,0.00069739314,0.00020913052,0.0015791694,0.00016990125,0.00033333752,0.0000034217435],"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.002801221,0.0034689459,0.531396,0.0031382032,0.0009081158,0.0016462456,0.042627968,0.19406836,0.05096995,0.06009143,0.0020179483,0.106865644],"study_design_scores_gemma":[0.01297754,0.002058992,0.14573109,0.0034276024,0.00010164809,0.007063407,0.0026311458,0.7545739,0.014189821,0.02888969,0.021876696,0.006478502],"about_ca_topic_score_codex":0.00001483474,"about_ca_topic_score_gemma":0.0000041191174,"teacher_disagreement_score":0.6206496,"about_ca_system_score_codex":0.00017666742,"about_ca_system_score_gemma":0.00010833834,"threshold_uncertainty_score":0.99995404},"labels":[],"label_agreement":null},{"id":"W2130538196","doi":"10.1109/ipdps.2008.4536475","title":"Finite-difference time-domain on the cell/B.E. processor","year":2008,"lang":"en","type":"article","venue":"Proceedings - IEEE International Parallel and Distributed Processing Symposium","topic":"Electromagnetic Simulation and Numerical Methods","field":"Engineering","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":"University of Manitoba","funders":"","keywords":"SIMD; Computer science; Parallel computing; PowerPC; Speedup; Microarchitecture; Single-core; Multi-core processor; Coprocessor; Finite-difference time-domain method; Computation; Instruction set; Computational science; Algorithm","score_opus":0.01950249187029085,"score_gpt":0.24536724089195538,"score_spread":0.22586474902166453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130538196","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.8912182,0.0004930628,0.06270611,0.0053616366,0.00039409247,0.00046655638,0.00006883245,0.000795305,0.038496234],"genre_scores_gemma":[0.99558395,0.00014242105,0.0022962722,0.00037190417,0.00018939604,0.00009614243,0.000035017252,0.000034439596,0.0012504744],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986275,0.000014011087,0.00032052398,0.00032057363,0.0003882588,0.00032912847],"domain_scores_gemma":[0.99926496,0.00021351957,0.00010063348,0.0000750898,0.00021985838,0.00012596726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016519455,0.0002781613,0.00020827596,0.00008889147,0.0003122228,0.00015923953,0.0003357684,0.00010878279,0.000072161914],"category_scores_gemma":[0.00009878856,0.0002080093,0.000054071385,0.0003070739,0.00014024688,0.00017770872,0.000029429195,0.00030660088,0.000046631572],"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.0015342506,0.001603989,0.017468713,0.0016059923,0.0004895524,0.000075558346,0.008994866,0.11806757,0.7584451,0.00863169,0.0666379,0.016444856],"study_design_scores_gemma":[0.0018245756,0.0004114858,0.005313306,0.0002598082,0.000049241837,0.00013911846,0.00020132423,0.9332012,0.035637695,0.007861568,0.014001203,0.0010994747],"about_ca_topic_score_codex":0.0000019169715,"about_ca_topic_score_gemma":9.792434e-8,"teacher_disagreement_score":0.81513363,"about_ca_system_score_codex":0.000058677724,"about_ca_system_score_gemma":0.00003182337,"threshold_uncertainty_score":0.8482373},"labels":[],"label_agreement":null},{"id":"W2133485530","doi":"10.1109/ipdps.2008.4536510","title":"Configuration Scheduling Using Temporal Locality and Kernel Correlation","year":2008,"lang":"en","type":"article","venue":"Proceedings - IEEE International Parallel and Distributed Processing Symposium","topic":"Embedded Systems Design 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 Waterloo","funders":"","keywords":"Computer science; Locality; Control reconfiguration; Scheduling (production processes); Kernel (algebra); Parallel computing; Execution time; Software; Embedded system; Distributed computing; Locality of reference; Field-programmable gate array; SystemC; Linux kernel; Operating system; Cache; Mathematical optimization","score_opus":0.038130433879571324,"score_gpt":0.28361219083085326,"score_spread":0.24548175695128194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133485530","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.19131052,0.00020835207,0.8062868,0.00067762873,0.0002148348,0.00021609773,0.00001058055,0.00033814897,0.0007370517],"genre_scores_gemma":[0.951621,0.00006078292,0.04788305,0.000110124296,0.00015963789,0.000030138639,0.000040608757,0.000014960884,0.00007967521],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981415,0.000021247664,0.0005123354,0.00059572305,0.00046182703,0.0002673541],"domain_scores_gemma":[0.99867237,0.00003794429,0.0004097767,0.00009952504,0.00064022356,0.00014017736],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003792458,0.00025517214,0.0002441128,0.0001578646,0.00045447823,0.00055132696,0.00037793824,0.00016986132,0.000001927453],"category_scores_gemma":[0.00006868,0.0002527237,0.00004066927,0.00027265423,0.0001705194,0.0021612446,0.000113801034,0.00022238317,0.0000030534716],"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.0006145646,0.0008792397,0.47833574,0.0017236415,0.0003964463,0.0001524771,0.014500612,0.017146043,0.32180762,0.15097529,0.0034197217,0.01004861],"study_design_scores_gemma":[0.0005799769,0.000060221424,0.002840573,0.0002268662,0.000016388587,0.0006436489,0.000118074924,0.9860744,0.0043957825,0.004340701,0.00031532353,0.00038806396],"about_ca_topic_score_codex":0.000077063305,"about_ca_topic_score_gemma":9.699845e-7,"teacher_disagreement_score":0.96892834,"about_ca_system_score_codex":0.00012732722,"about_ca_system_score_gemma":0.00011407414,"threshold_uncertainty_score":0.9999925},"labels":[],"label_agreement":null},{"id":"W2136942149","doi":"10.1109/ipdps.2008.4536524","title":"On the efficiency and accuracy of hybrid pseudo-random number generators for FPGA-based simulations","year":2008,"lang":"en","type":"article","venue":"Proceedings - IEEE International Parallel and Distributed Processing Symposium","topic":"Chaos-based Image/Signal Encryption","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":"University of Alberta","funders":"","keywords":"Field-programmable gate array; Random number generation; Computer science; Pseudorandom number generator; Range (aeronautics); Parallel computing; Algorithm; Computer hardware; Engineering","score_opus":0.02343086121392259,"score_gpt":0.2735070975637733,"score_spread":0.2500762363498507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136942149","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.4497209,0.00003960266,0.54669124,0.0027713783,0.0001330367,0.00029735954,0.00009662754,0.00007234638,0.00017753079],"genre_scores_gemma":[0.99201673,0.000021149293,0.007273754,0.00040546063,0.00010440012,0.000079941274,0.000056668217,0.000014254714,0.000027611059],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984383,0.0000144903215,0.00040120957,0.00046284354,0.00043737842,0.00024576476],"domain_scores_gemma":[0.99819404,0.0005405411,0.0003496199,0.000111006426,0.00070981216,0.000094953146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026154378,0.00022724025,0.00020691946,0.00011107437,0.00049524056,0.000278859,0.0004824002,0.000049520586,0.000008128251],"category_scores_gemma":[0.00038193067,0.00017504136,0.000073522715,0.00028121803,0.00020781657,0.0006975282,0.00006441816,0.0001409821,0.0000026283597],"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.0046658753,0.0041081216,0.029648451,0.002008823,0.00059254817,0.00005455751,0.0063611753,0.3486642,0.3767466,0.18336876,0.033949018,0.009831904],"study_design_scores_gemma":[0.0021096778,0.000118943484,0.0003462279,0.00012581592,0.000024040413,0.00007604344,0.000021312371,0.94293785,0.046406627,0.0072359247,0.00032355887,0.0002740048],"about_ca_topic_score_codex":0.00000985708,"about_ca_topic_score_gemma":3.880752e-7,"teacher_disagreement_score":0.5942736,"about_ca_system_score_codex":0.00005592379,"about_ca_system_score_gemma":0.00014026239,"threshold_uncertainty_score":0.713798},"labels":[],"label_agreement":null},{"id":"W2138518227","doi":"10.1109/ipdps.2008.4536502","title":"Web-based e-learning in 3D large scale distributed interactive simulations using HLA/RTI","year":2008,"lang":"en","type":"article","venue":"Proceedings - IEEE International Parallel and Distributed Processing Symposium","topic":"Simulation Techniques and Applications","field":"Decision Sciences","cited_by":17,"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 Ottawa","funders":"","keywords":"VRML; Computer science; X3D; Web application; High-level architecture; Virtual reality; Overhead (engineering); Architecture; Distributed Interactive Simulation; Class (philosophy); Human–computer interaction; Computer architecture; Distributed computing; Artificial intelligence; Operating system; Interoperability","score_opus":0.05939915003485275,"score_gpt":0.36918457859259896,"score_spread":0.3097854285577462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138518227","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.7263514,0.00005220896,0.26916906,0.0019275808,0.00015079338,0.00037850166,0.00052006514,0.00027663194,0.0011737992],"genre_scores_gemma":[0.9919447,0.000018735485,0.0069072447,0.00021230926,0.00014908516,0.00007781199,0.0004174281,0.000029309942,0.00024342796],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99648255,0.000042235526,0.0010714404,0.00086012256,0.0010775384,0.00046612284],"domain_scores_gemma":[0.9970873,0.0003954277,0.00066151633,0.00016063864,0.0015023376,0.00019277126],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006981396,0.0003339009,0.00040176034,0.00057054975,0.0007872545,0.00059276377,0.0006114134,0.00019548411,0.0001356939],"category_scores_gemma":[0.0007394551,0.0003089854,0.00011414883,0.0014461991,0.00019641599,0.0013096452,0.00014595273,0.00047281114,0.00002027775],"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.00042549442,0.0009020971,0.66108656,0.000046012647,0.000046515135,0.000016200433,0.0017156679,0.3107643,0.020197984,0.00072691235,0.0023512559,0.0017209841],"study_design_scores_gemma":[0.0015950868,0.000042825373,0.025343386,0.00012240032,0.00002061277,0.0000422633,0.00046237453,0.9569138,0.0010144896,0.0021703443,0.01188468,0.00038768924],"about_ca_topic_score_codex":0.000040700066,"about_ca_topic_score_gemma":0.000014584609,"teacher_disagreement_score":0.6461495,"about_ca_system_score_codex":0.0002507083,"about_ca_system_score_gemma":0.00022263065,"threshold_uncertainty_score":0.9999362},"labels":[],"label_agreement":null},{"id":"W2152514708","doi":"10.1109/ipdps.2008.4536574","title":"Formal modeling and analysis of real-time resource-sharing protocols in Real-Time Maude","year":2008,"lang":"en","type":"article","venue":"Proceedings - IEEE International Parallel and Distributed Processing Symposium","topic":"Real-Time Systems Scheduling","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":"McGill University","funders":"","keywords":"Computer science; Model checking; Distributed computing; Scheduling (production processes); Shared resource; Formal methods; Real-time computing; Theoretical computer science; Programming language; Operating system; Mathematical optimization","score_opus":0.028858538383555787,"score_gpt":0.2853864491754042,"score_spread":0.2565279107918484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152514708","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.9104619,0.000056338282,0.0804017,0.00041515267,0.00004530296,0.0018463572,0.000046010548,0.0002803582,0.0064469],"genre_scores_gemma":[0.9824955,0.000096108044,0.016268337,0.000021799797,0.000089915295,0.00066471717,0.000093451265,0.00002762124,0.00024255132],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966499,0.000023312365,0.0010949466,0.00093701953,0.0007306626,0.00056415255],"domain_scores_gemma":[0.99835086,0.00006770725,0.00061357114,0.00021793369,0.0005456357,0.00020431173],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085991155,0.00037021507,0.0007107619,0.0008022138,0.00028862426,0.00051573146,0.00094673247,0.00018830644,0.000006815529],"category_scores_gemma":[0.000077192926,0.0003639894,0.00012651035,0.001289133,0.00012891703,0.0025123993,0.00042056944,0.00023774282,0.0000048228076],"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.001358551,0.0010407406,0.24787326,0.0020010099,0.001830257,0.00014769268,0.019124784,0.31868804,0.39416832,0.0100174295,0.0005405709,0.0032093523],"study_design_scores_gemma":[0.0008896166,0.0000797043,0.00452734,0.0004313739,0.000074359785,0.00011209182,0.000097594246,0.99199593,0.00085659145,0.0005196567,0.000032735377,0.0003830058],"about_ca_topic_score_codex":0.00027188845,"about_ca_topic_score_gemma":0.0000032463136,"teacher_disagreement_score":0.6733079,"about_ca_system_score_codex":0.00015296144,"about_ca_system_score_gemma":0.00011114657,"threshold_uncertainty_score":0.9998812},"labels":[],"label_agreement":null},{"id":"W2170078808","doi":"10.1109/ipdps.2008.4536466","title":"A parallel sewing method for solving tridiagonal Toeplitz strictly diagonally dominant systems","year":2008,"lang":"en","type":"article","venue":"Proceedings - IEEE International Parallel and Distributed Processing Symposium","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":3,"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 New Brunswick","funders":"","keywords":"Toeplitz matrix; Tridiagonal matrix; Diagonal; Computer science; Diagonally dominant matrix; Coefficient matrix; Parallel computing; Linear system; Band matrix; Matrix (chemical analysis); Scale (ratio); Algorithm; Mathematics; Symmetric matrix; Square matrix; Mathematical analysis; Pure mathematics; Geometry","score_opus":0.0254816714249268,"score_gpt":0.2831043667954523,"score_spread":0.2576226953705255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170078808","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.007498054,0.00086882635,0.98667896,0.0018263619,0.0009754806,0.0005974092,0.00015160812,0.00028706584,0.0011162529],"genre_scores_gemma":[0.8151703,0.00025244188,0.18174525,0.0003402504,0.00096710725,0.00051626534,0.00012022116,0.000044524924,0.00084366236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967131,0.000028549568,0.0008075428,0.0010286393,0.00070726697,0.00071488146],"domain_scores_gemma":[0.9977469,0.0003442659,0.0005402282,0.00017181406,0.0008991712,0.0002976349],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009682049,0.00047693672,0.0005323511,0.0002567069,0.0009052266,0.0009998934,0.0012259118,0.00019634183,0.00000466242],"category_scores_gemma":[0.00018509486,0.00043441934,0.00019313261,0.00044988288,0.00012434622,0.0018285542,0.000245066,0.00030691322,0.000007253362],"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.0036153719,0.002795206,0.009610637,0.004418592,0.0016989933,0.00040136304,0.018919269,0.051224705,0.09848585,0.74179786,0.032291263,0.034740895],"study_design_scores_gemma":[0.0031733934,0.00022741675,0.000517613,0.00033981516,0.00006834114,0.0011061393,0.00034382462,0.9671594,0.0023700683,0.013273701,0.010434956,0.0009853377],"about_ca_topic_score_codex":0.000030553398,"about_ca_topic_score_gemma":4.2562942e-7,"teacher_disagreement_score":0.9159347,"about_ca_system_score_codex":0.00014710338,"about_ca_system_score_gemma":0.00025211682,"threshold_uncertainty_score":0.99981076},"labels":[],"label_agreement":null},{"id":"W2170949421","doi":"10.1109/ipdps.2008.4536144","title":"A Hybrid MPI design using SCTP and iWARP","year":2008,"lang":"en","type":"article","venue":"Proceedings - IEEE International Parallel and Distributed Processing Symposium","topic":"IPv6, Mobility, Handover, Networks, Security","field":"Engineering","cited_by":6,"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":"Stream Control Transmission Protocol; Computer science; Remote direct memory access; Middleware (distributed applications); Protocol stack; Computer network; Implementation; Protocol (science); Operating system; Exploit; InfiniBand; Stack (abstract data type)","score_opus":0.02947974303796063,"score_gpt":0.24326138638622533,"score_spread":0.2137816433482647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170949421","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.81307507,0.0020494387,0.18154314,0.00029035273,0.0007413289,0.00039927484,0.00010280923,0.00056540105,0.0012332117],"genre_scores_gemma":[0.99388534,0.00054281665,0.004794592,0.00008475409,0.0004540927,0.00005258819,0.000059191338,0.00005412029,0.00007249218],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810517,0.000011812004,0.00046056203,0.0005247472,0.00041057827,0.00048713837],"domain_scores_gemma":[0.9991641,0.000051396015,0.00013817109,0.000085539046,0.0003469754,0.00021378897],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026149309,0.00039362817,0.0003421095,0.00014319485,0.00036910997,0.0003228088,0.00026656056,0.00014760777,0.0000124323415],"category_scores_gemma":[0.000045889316,0.0004087193,0.000059733335,0.00020058612,0.00024195443,0.0009297813,0.000089467554,0.00033910168,0.0000048980887],"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.0038178482,0.0020827865,0.16341598,0.007507124,0.0022568244,0.0006417773,0.015976649,0.4993081,0.23713997,0.00403676,0.048902016,0.014914166],"study_design_scores_gemma":[0.0016976405,0.000077314195,0.0020944276,0.00028197045,0.00009793208,0.0012075525,0.00010540698,0.98284847,0.0057836934,0.002721774,0.0022599904,0.0008238618],"about_ca_topic_score_codex":0.00002197687,"about_ca_topic_score_gemma":0.0000011024788,"teacher_disagreement_score":0.48354033,"about_ca_system_score_codex":0.00017451195,"about_ca_system_score_gemma":0.000059605707,"threshold_uncertainty_score":0.99983644},"labels":[],"label_agreement":null}]}