{"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":"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.017045505,0.00010536341,0.97982466,0.00010201746,0.000051449973,0.00004205897,0.000032303233,0.0003626791,0.0024338746],"genre_scores_gemma":[0.17798543,0.0001690482,0.8187926,0.000051762723,0.00004002008,0.00011981129,0.0000988307,0.00012710206,0.002615335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997588,0.00006881575,0.000016425161,0.000020757336,0.00011442193,0.000020806763],"domain_scores_gemma":[0.9996032,0.00016456387,0.000024424453,0.00006342197,0.0001185057,0.000025986732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004751189,0.00038785065,0.0005673389,0.00039844282,0.00033174417,0.0005858542,0.0009526391,0.0005233904,0.0019956012],"category_scores_gemma":[0.0016829803,0.00018751113,0.00055996655,0.0007353426,0.0003725853,0.00061874726,0.0005192816,0.0007027887,0.00042121037],"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.00020372348,0.00013107057,0.0014542176,0.0000902658,0.0000854027,0.0003778162,0.0001156032,0.67137074,0.016424963,0.11582409,0.0049775806,0.1889446],"study_design_scores_gemma":[0.000011495689,0.000008275558,0.00005965942,0.0000015621744,0.0000019729791,0.0000265512,0.0000023796679,0.9948906,0.00072026264,0.003614907,0.0006585652,0.0000037982077],"about_ca_topic_score_codex":0.0043643955,"about_ca_topic_score_gemma":0.0031087159,"teacher_disagreement_score":0.0043643955,"about_ca_system_score_codex":0.00034779,"about_ca_system_score_gemma":0.0008961624,"threshold_uncertainty_score":0.008678019},"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":"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.039755102,0.0001485114,0.9540485,0.00007525029,0.000017850667,0.000105508494,0.000009946219,0.0001702159,0.0056690797],"genre_scores_gemma":[0.32849208,0.0002751051,0.6674134,0.000121925375,0.000028827111,0.00038759486,0.00008254716,0.00011504076,0.0030833608],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995851,0.00012775353,0.000015055479,0.000066102555,0.00014724521,0.000058733767],"domain_scores_gemma":[0.99961805,0.00020415474,0.00003730938,0.000044353965,0.00006460872,0.00003152404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010394155,0.0008164817,0.0005911979,0.0007449037,0.00044322351,0.00060919434,0.0018699318,0.00075781095,0.0027836096],"category_scores_gemma":[0.0014932987,0.0004516504,0.0006423416,0.0006129456,0.00065722695,0.0009902013,0.0013765523,0.0010772742,0.00037090547],"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.00009803978,0.00026162737,0.0011638239,0.0001670328,0.00012803015,0.00015929705,0.00039045687,0.763042,0.021268131,0.07010585,0.000872362,0.14234337],"study_design_scores_gemma":[0.00004545407,0.00014727315,0.00026262042,0.000016634107,0.00004781054,0.00008039698,0.00014020187,0.9836272,0.005009558,0.007188752,0.0034178318,0.000016143807],"about_ca_topic_score_codex":0.0007482497,"about_ca_topic_score_gemma":0.0015512931,"teacher_disagreement_score":0.0027836096,"about_ca_system_score_codex":0.00049651467,"about_ca_system_score_gemma":0.00056592585,"threshold_uncertainty_score":0.009312034},"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":"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.0056490907,0.0002204459,0.9900513,0.00019347157,0.000057195593,0.000067424764,0.00012281803,0.0013827641,0.002255441],"genre_scores_gemma":[0.045799576,0.00013815219,0.95025545,0.00012853925,0.000028385171,0.00016909206,0.00041876617,0.00027558557,0.002786391],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999587,0.000045023724,0.000019895666,0.000078852725,0.00022085034,0.000048430345],"domain_scores_gemma":[0.9996105,0.000111244044,0.00004045953,0.0000709919,0.00012425198,0.000042497413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004103618,0.0008922678,0.0009974726,0.0016388164,0.00076824427,0.0011028306,0.001914809,0.0011617763,0.005492136],"category_scores_gemma":[0.0016087872,0.0005833591,0.0009067294,0.0013633702,0.0006112532,0.0014970496,0.002057438,0.0015248938,0.0013007852],"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.00036800595,0.00012976621,0.0010042136,0.00043184138,0.00017993194,0.0001565775,0.00026109308,0.2944503,0.05389294,0.05365765,0.021712651,0.573755],"study_design_scores_gemma":[0.000059013633,0.000052673495,0.00017773324,0.000016517597,0.000016582262,0.000058875627,0.000020365354,0.98194826,0.0036188816,0.007143358,0.0068725734,0.00001520003],"about_ca_topic_score_codex":0.0090842815,"about_ca_topic_score_gemma":0.019140022,"teacher_disagreement_score":0.0090842815,"about_ca_system_score_codex":0.0015111509,"about_ca_system_score_gemma":0.0014166186,"threshold_uncertainty_score":0.018372953},"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":"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.0013916944,0.00020228681,0.99531907,0.00035268982,0.00009059621,0.00034497547,0.00006535271,0.00067545753,0.0015577553],"genre_scores_gemma":[0.09247061,0.0009989195,0.9002945,0.0003792633,0.00013986517,0.002066677,0.00034383946,0.00035947503,0.0029469673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996236,0.0011945878,0.00033567884,0.0003981084,0.0016259677,0.00020958701],"domain_scores_gemma":[0.9962237,0.0018017081,0.000298166,0.00064843125,0.0009301464,0.00009782544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00559646,0.00066598976,0.00085768814,0.0010780016,0.0011226834,0.0027593789,0.0022276752,0.0018507934,0.0041469564],"category_scores_gemma":[0.011393714,0.0008827132,0.0010239922,0.0010007289,0.0023645633,0.0037861587,0.0035522543,0.0025120967,0.0017869354],"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.0003252919,0.00020162635,0.0010647089,0.0009919655,0.00012032485,0.0011084988,0.00074630615,0.06313033,0.029564776,0.6839396,0.015732625,0.20307395],"study_design_scores_gemma":[0.00033219944,0.0005560461,0.00043645973,0.00034551017,0.00014417795,0.0014808931,0.00017621942,0.62197804,0.04616322,0.19902018,0.12916891,0.00019809256],"about_ca_topic_score_codex":0.0013501215,"about_ca_topic_score_gemma":0.000667491,"teacher_disagreement_score":0.00559646,"about_ca_system_score_codex":0.0011495567,"about_ca_system_score_gemma":0.0031146398,"threshold_uncertainty_score":0.029597282},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81202155,0.00070216146,0.1535659,0.00028366628,0.0000660701,0.00014423234,0.00044021342,0.0011266638,0.03164949],"genre_scores_gemma":[0.9930668,0.000102094775,0.0043366286,0.000028800836,0.000015619442,0.000054584685,0.0001450412,0.00003636783,0.0022141675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99956626,0.000044241242,0.000020998812,0.00006410982,0.00018769804,0.00011675918],"domain_scores_gemma":[0.99848217,0.0006202377,0.0002447239,0.00023332148,0.0003377241,0.00008187989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034639574,0.00031729788,0.0003962162,0.0008526305,0.00068034616,0.0010863194,0.00075591763,0.00047404427,0.0031339582],"category_scores_gemma":[0.002865853,0.00016726075,0.00017847081,0.0007684606,0.0006477081,0.000839896,0.0005298844,0.00062980637,0.0004924501],"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.0017954943,0.00032969142,0.013783092,0.00027230495,0.00005723225,0.0010166673,0.0008651432,0.42083514,0.3720374,0.14616689,0.0033060245,0.03953491],"study_design_scores_gemma":[0.000025337498,0.00018545205,0.003913531,0.000011662037,0.00001926434,0.00018015182,0.00013768056,0.89927566,0.08295492,0.007881822,0.0053865965,0.000027988846],"about_ca_topic_score_codex":0.0019593132,"about_ca_topic_score_gemma":0.0011749045,"teacher_disagreement_score":0.0031339582,"about_ca_system_score_codex":0.0007987067,"about_ca_system_score_gemma":0.00075518363,"threshold_uncertainty_score":0.010484099},"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":"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.1347528,0.001258435,0.73426455,0.0016176681,0.0007672693,0.001096324,0.009020941,0.050699145,0.06652291],"genre_scores_gemma":[0.28492033,0.0005508926,0.6858361,0.00042336216,0.00009359428,0.0012938473,0.014484683,0.00388883,0.008508324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966858,0.0011893499,0.00024688538,0.00032373125,0.0012142799,0.00033995535],"domain_scores_gemma":[0.99451774,0.0024889987,0.00029851563,0.00082289526,0.0016063087,0.00026553264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031469977,0.0016277318,0.00073874736,0.0014467314,0.00082700956,0.0015317147,0.002484618,0.0016121238,0.009514645],"category_scores_gemma":[0.0117292525,0.0005510941,0.00082327,0.0034384648,0.00074667693,0.0017274003,0.0014453207,0.0020172526,0.002134163],"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.00092635315,0.0011750249,0.004545284,0.0013166479,0.00020188723,0.00031467603,0.00044839896,0.58683836,0.018405402,0.069995746,0.10142449,0.2144078],"study_design_scores_gemma":[0.0003363715,0.00028919737,0.0006841056,0.00005364168,0.000026580754,0.00008333754,0.00014435474,0.94727695,0.014967427,0.011633472,0.024473434,0.000031151598],"about_ca_topic_score_codex":0.0064651524,"about_ca_topic_score_gemma":0.0063305385,"teacher_disagreement_score":0.009514645,"about_ca_system_score_codex":0.0012679066,"about_ca_system_score_gemma":0.0029709337,"threshold_uncertainty_score":0.031829715},"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":"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.0022270062,0.0002160074,0.9835675,0.0002304849,0.00007473272,0.00010214692,0.000019191264,0.007124133,0.006438822],"genre_scores_gemma":[0.06258683,0.0005032153,0.924478,0.00046879958,0.00013082338,0.00048994547,0.0001698226,0.0036281408,0.007544411],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99641657,0.0010334402,0.00029383216,0.0004122747,0.0015065605,0.00033734317],"domain_scores_gemma":[0.99753594,0.00090275327,0.00032312298,0.00089740724,0.00020653736,0.0001341796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041526137,0.0009383266,0.0010569713,0.0007474095,0.000758631,0.0036619422,0.0030776074,0.001843154,0.0032198294],"category_scores_gemma":[0.006214757,0.0015834,0.0013255632,0.00081372826,0.002265517,0.0062019476,0.0038564221,0.0044335276,0.0026297208],"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.00042673986,0.00044126637,0.001621777,0.000456095,0.0001052838,0.0010785544,0.0018001837,0.039422143,0.019568248,0.68516415,0.015468081,0.23444742],"study_design_scores_gemma":[0.00036913785,0.00017331819,0.00049238827,0.00029031935,0.00016970004,0.0011476146,0.00018789887,0.35170704,0.0370912,0.28504944,0.32312217,0.00019985407],"about_ca_topic_score_codex":0.0011522367,"about_ca_topic_score_gemma":0.0013915773,"teacher_disagreement_score":0.0041526137,"about_ca_system_score_codex":0.0007589792,"about_ca_system_score_gemma":0.0013515616,"threshold_uncertainty_score":0.021961391},"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":"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.034906287,0.000113847535,0.94270676,0.00016350982,0.0001238635,0.000120210265,0.00023436602,0.0036303042,0.018000929],"genre_scores_gemma":[0.1576229,0.00010701789,0.82855546,0.00013079359,0.000021515913,0.00030757653,0.00050659856,0.00028277846,0.01246527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998348,0.000032817075,0.000009087494,0.000021697015,0.00007733694,0.000024292736],"domain_scores_gemma":[0.9996449,0.00011161354,0.000013945194,0.000056808094,0.00015186824,0.00002090866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027274428,0.00029732366,0.0004565437,0.0001554548,0.00035699448,0.00039536762,0.00092843757,0.0003950263,0.010221035],"category_scores_gemma":[0.00081075344,0.00016722328,0.00028239004,0.0003211569,0.00023453575,0.00033811285,0.00039715515,0.0007553869,0.0024812485],"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.0009026222,0.00020964371,0.0023191362,0.00036582464,0.000068574824,0.00054237037,0.0003835038,0.39790395,0.13445137,0.065552495,0.03142452,0.365876],"study_design_scores_gemma":[0.00007957485,0.00005938588,0.00027165678,0.0000096791155,0.0000086069285,0.00005107898,0.000017547534,0.95813763,0.019287832,0.0015503941,0.020514783,0.000011813778],"about_ca_topic_score_codex":0.0029656559,"about_ca_topic_score_gemma":0.003430675,"teacher_disagreement_score":0.010221035,"about_ca_system_score_codex":0.0004417464,"about_ca_system_score_gemma":0.0008042871,"threshold_uncertainty_score":0.03419274},"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":"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.46680203,0.00040386518,0.52258193,0.00018539825,0.00004479502,0.00008348787,0.000031997562,0.0013459638,0.008520442],"genre_scores_gemma":[0.9680511,0.000052891246,0.03095935,0.000030497233,0.000020021127,0.000026785478,0.000025133922,0.00006011435,0.00077406707],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993057,0.00018722795,0.000030947387,0.0001281264,0.0002050041,0.00014288818],"domain_scores_gemma":[0.9977629,0.000955256,0.0004751782,0.00035926513,0.00027921077,0.00016816617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007530026,0.00031623515,0.00043848614,0.00072796614,0.0005733154,0.00062735035,0.000769216,0.00026367515,0.0012426516],"category_scores_gemma":[0.0035742174,0.00026718053,0.00022632063,0.00082755147,0.0005220215,0.00090515584,0.0005475304,0.00036457286,0.00019256909],"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.0010427294,0.00048763052,0.007689784,0.00008458904,0.000070366674,0.00016913541,0.00017949406,0.5806163,0.03448779,0.017793931,0.0015313722,0.3558469],"study_design_scores_gemma":[0.0000367944,0.00026768332,0.0018231956,0.0000057137586,0.000019859486,0.00015036981,0.00003308095,0.97886264,0.013981898,0.0037015977,0.0010969752,0.00002021712],"about_ca_topic_score_codex":0.0025970049,"about_ca_topic_score_gemma":0.0028096389,"teacher_disagreement_score":0.0025970049,"about_ca_system_score_codex":0.0009229542,"about_ca_system_score_gemma":0.0015028163,"threshold_uncertainty_score":0.0066964626},"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":"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.2868662,0.0008153258,0.7009907,0.0002982045,0.00007118768,0.000103652055,0.0001290431,0.0023964914,0.008329273],"genre_scores_gemma":[0.89471453,0.00016147243,0.104158744,0.000036157828,0.000014867233,0.0000751747,0.000067433735,0.00010023804,0.0006713898],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875975,0.00066008593,0.000055023083,0.000086712025,0.00037228758,0.00006613036],"domain_scores_gemma":[0.9903094,0.0076288534,0.00042329115,0.00092888303,0.0006456611,0.00006383724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00216854,0.00049324846,0.00038751843,0.0005797783,0.00022911819,0.000665265,0.00065596384,0.0004894357,0.001442072],"category_scores_gemma":[0.014399535,0.00023424746,0.00018699479,0.00045346678,0.00042493077,0.0009177055,0.0002911221,0.00041370658,0.0003947195],"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.0004262903,0.00006200568,0.0043763164,0.000100598125,0.000048265392,0.000082143866,0.000058856363,0.9015307,0.00904628,0.012942451,0.0004584309,0.07086762],"study_design_scores_gemma":[0.000014753231,0.0000471038,0.0003774814,0.000007862412,0.0000057810366,0.000026019638,0.0000050964704,0.9936278,0.0046730996,0.0009219816,0.00028725254,0.0000057706584],"about_ca_topic_score_codex":0.0015500564,"about_ca_topic_score_gemma":0.0015319883,"teacher_disagreement_score":0.00216854,"about_ca_system_score_codex":0.00056644954,"about_ca_system_score_gemma":0.00041424623,"threshold_uncertainty_score":0.01146847},"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":"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.055365667,0.00009993715,0.9300895,0.00024330059,0.00003083433,0.00014330415,0.000056853703,0.0039384193,0.0100322515],"genre_scores_gemma":[0.6978656,0.00019234075,0.29651225,0.000096195465,0.000017603237,0.00026327826,0.00019987003,0.0002980174,0.004554766],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993419,0.00032800698,0.000033151173,0.00006547233,0.00018170688,0.000049783084],"domain_scores_gemma":[0.9988381,0.0005568425,0.000055730285,0.00031272726,0.00013475603,0.000101818085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001173507,0.0003644497,0.00046814504,0.00022191837,0.0003833877,0.0012992771,0.0013050347,0.0006798529,0.0047055823],"category_scores_gemma":[0.0023441983,0.00028666953,0.00036970855,0.00027821472,0.0005636162,0.0013147484,0.001483697,0.0007866342,0.000999834],"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.00040491796,0.00046727533,0.0026793592,0.00011207391,0.00006554518,0.00026378006,0.00044710867,0.85086715,0.016628046,0.023315685,0.0019378973,0.1028112],"study_design_scores_gemma":[0.0000580506,0.000087604814,0.00034225496,0.0000113941405,0.000009848354,0.000043679374,0.000053840617,0.98189986,0.006248451,0.006117456,0.005113595,0.000013942511],"about_ca_topic_score_codex":0.002576282,"about_ca_topic_score_gemma":0.0015958583,"teacher_disagreement_score":0.0047055823,"about_ca_system_score_codex":0.0004327445,"about_ca_system_score_gemma":0.0006417533,"threshold_uncertainty_score":0.015741706},"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":"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.0056440267,0.00009029163,0.99183476,0.00015959344,0.000025621082,0.000072922834,0.00005115147,0.0005372182,0.0015843426],"genre_scores_gemma":[0.2335472,0.00048001742,0.7609959,0.00017380883,0.000062758234,0.0006636131,0.00020817934,0.0005090622,0.003359399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996861,0.0011176877,0.0002765872,0.00035392784,0.0010533076,0.0003375171],"domain_scores_gemma":[0.99518955,0.0023490076,0.00046119234,0.0013984852,0.00049481244,0.00010703554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051898975,0.0008880418,0.00080765714,0.0008693269,0.0008919979,0.0027125708,0.004524248,0.0012747991,0.0020629654],"category_scores_gemma":[0.00883636,0.0013094455,0.0024367883,0.00071055995,0.0031882022,0.004310908,0.0021021282,0.0045636347,0.0005208935],"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.000039302762,0.000038041195,0.00038298537,0.0001174051,0.000042486936,0.00016037063,0.000641481,0.11758929,0.0057165255,0.867981,0.000500665,0.0067904326],"study_design_scores_gemma":[0.00008299936,0.00008954186,0.00022976885,0.000099535326,0.0001122841,0.00021042972,0.00017865941,0.6446914,0.018066216,0.29607204,0.040097643,0.00006943823],"about_ca_topic_score_codex":0.003613827,"about_ca_topic_score_gemma":0.0037146588,"teacher_disagreement_score":0.0051898975,"about_ca_system_score_codex":0.0017144238,"about_ca_system_score_gemma":0.0021469134,"threshold_uncertainty_score":0.027447104},"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":"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.009211254,0.000065106586,0.9890225,0.000042934364,0.000029812685,0.000030246494,0.0000146937755,0.00028221225,0.0013011764],"genre_scores_gemma":[0.087820284,0.00014255961,0.9083714,0.000043742235,0.000018704191,0.00012900785,0.00007552901,0.000116632495,0.0032821686],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999861,0.000026455498,0.000006545136,0.000018825638,0.000071389666,0.00001573574],"domain_scores_gemma":[0.9998074,0.00006418073,0.000016906393,0.000035950623,0.00006078937,0.000014760974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029161962,0.00051950314,0.00045325267,0.00037732735,0.0005375023,0.00036828863,0.0006714311,0.0004700224,0.0028037215],"category_scores_gemma":[0.00065794296,0.00025746628,0.00041693944,0.0005571725,0.00045012805,0.00062903424,0.0005501607,0.0007502292,0.00064128987],"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.00025442833,0.00015599758,0.00091481494,0.00024667708,0.00009721841,0.0003010582,0.0003125531,0.36567694,0.102827445,0.06309075,0.005874007,0.46024805],"study_design_scores_gemma":[0.000032409596,0.000060656133,0.00011796496,0.0000070759875,0.00000783271,0.00007366222,0.000019309422,0.98093915,0.007953142,0.007239937,0.0035364358,0.000012440758],"about_ca_topic_score_codex":0.0020687191,"about_ca_topic_score_gemma":0.00322848,"teacher_disagreement_score":0.0028037215,"about_ca_system_score_codex":0.00017828864,"about_ca_system_score_gemma":0.00089775666,"threshold_uncertainty_score":0.009379327},"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":"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.026731761,0.00017891137,0.9444725,0.00044184685,0.00030643132,0.0002368026,0.00018508807,0.011615552,0.01583109],"genre_scores_gemma":[0.30163082,0.0003478434,0.6689737,0.0007402748,0.00026563188,0.0009835634,0.0008160724,0.0027094423,0.02353273],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989673,0.000115802,0.00009187912,0.00018362851,0.00049145473,0.0001498392],"domain_scores_gemma":[0.99889094,0.00014154703,0.000054277265,0.00033215925,0.00045659358,0.00012450047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007209923,0.00056098367,0.0005404271,0.0007517883,0.0012022359,0.0018679197,0.0034126786,0.0009715308,0.0037571962],"category_scores_gemma":[0.0015736903,0.0007107286,0.00062200427,0.000966455,0.0008034552,0.0020110798,0.0017427142,0.0016212959,0.0021684596],"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.0021987068,0.00051743066,0.008016034,0.00093057076,0.0005056893,0.0016099367,0.0016429554,0.06128462,0.32298923,0.21043487,0.06968521,0.3201847],"study_design_scores_gemma":[0.0005108455,0.0009163206,0.0027096968,0.00009008167,0.0002656051,0.0009769194,0.00028624263,0.4674437,0.18874751,0.028904734,0.30887133,0.0002771739],"about_ca_topic_score_codex":0.0014995764,"about_ca_topic_score_gemma":0.0019033562,"teacher_disagreement_score":0.0037571962,"about_ca_system_score_codex":0.00094594073,"about_ca_system_score_gemma":0.0011395437,"threshold_uncertainty_score":0.0125691295},"labels":[],"label_agreement":null}]}