{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":14,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":14,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"63636435038e","filters":{"venue":"Proceedings - IEEE International Parallel and Distributed Processing Symposium"}},"results":[{"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02703650070891606,"gpt":0.2740699131351771,"spread":0.2470334124262611,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001452919,0.0002374516,0.0003050777,0.0001524917,0.0002141822,0.00007674744,0.0002150225,0.0001321202,0.000007391267],"category_scores_gemma":[0.0000388481,0.0002388847,0.0001021068,0.0001774243,0.00009598116,0.0002914869,0.0000255654,0.0001425535,9.36034e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005796499,"about_ca_system_score_gemma":0.00006718477,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006034729,"about_ca_topic_score_gemma":9.163984e-7,"domain_scores_codex":[0.9986545,0.000005116042,0.0005091742,0.0002854197,0.0002795751,0.0002661731],"domain_scores_gemma":[0.9991144,0.0000903145,0.0001796057,0.00006087376,0.0004247132,0.0001301124],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009410967,0.002195121,0.04701219,0.005640419,0.001185558,0.00003052794,0.005506186,0.075074,0.5504491,0.008731439,0.07882733,0.224407],"study_design_scores_gemma":[0.002790892,0.0001461899,0.009007657,0.0004930208,0.00007344143,0.00004331696,0.0001085746,0.9282164,0.0504272,0.006894164,0.001058241,0.0007409182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09121837,0.0001385956,0.9069359,0.0002037004,0.0002161991,0.0002541497,0.0003665287,0.0004250623,0.0002414391],"genre_scores_gemma":[0.9150246,0.00006788603,0.08428211,0.0000476638,0.0001960752,0.00006239552,0.0002437281,0.00002866419,0.00004684735],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8531424,"threshold_uncertainty_score":0.9741434,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05939915003485275,"gpt":0.369184578592599,"spread":0.3097854285577462,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006981396,0.0003339009,0.0004017603,0.0005705497,0.0007872545,0.0005927638,0.0006114134,0.0001954841,0.0001356939],"category_scores_gemma":[0.0007394551,0.0003089854,0.0001141488,0.001446199,0.000196416,0.001309645,0.0001459527,0.0004728111,0.00002027775],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002507083,"about_ca_system_score_gemma":0.0002226307,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004070007,"about_ca_topic_score_gemma":0.00001458461,"domain_scores_codex":[0.9964826,0.00004223553,0.00107144,0.0008601226,0.001077538,0.0004661228],"domain_scores_gemma":[0.9970873,0.0003954277,0.0006615163,0.0001606386,0.001502338,0.0001927713],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004254944,0.0009020971,0.6610866,0.00004601265,0.00004651514,0.00001620043,0.001715668,0.3107643,0.02019798,0.0007269123,0.002351256,0.001720984],"study_design_scores_gemma":[0.001595087,0.00004282537,0.02534339,0.0001224003,0.00002061277,0.0000422633,0.0004623745,0.9569138,0.00101449,0.002170344,0.01188468,0.0003876892],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7263514,0.00005220896,0.2691691,0.001927581,0.0001507934,0.0003785017,0.0005200651,0.0002766319,0.001173799],"genre_scores_gemma":[0.9919447,0.00001873549,0.006907245,0.0002123093,0.0001490852,0.00007781199,0.0004174281,0.00002930994,0.000243428],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6461495,"threshold_uncertainty_score":0.9999362,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02418856650064131,"gpt":0.2470297293626435,"spread":0.2228411628620022,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002426952,0.0002486699,0.0002231834,0.000155455,0.0003892613,0.0002254797,0.0008861097,0.0001055358,0.000005558261],"category_scores_gemma":[0.00004238875,0.0001908944,0.00007012406,0.0004354778,0.0001645191,0.0007144441,0.0000771241,0.0002018906,0.000002497603],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004063599,"about_ca_system_score_gemma":0.00009673116,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004587245,"about_ca_topic_score_gemma":1.055967e-7,"domain_scores_codex":[0.998275,0.00001788004,0.0004464304,0.0004760494,0.0005251363,0.0002595078],"domain_scores_gemma":[0.9987465,0.00005342549,0.0003443572,0.0001313758,0.000635975,0.00008837911],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001275218,0.003776852,0.009977525,0.001577861,0.0003683422,0.00004755377,0.02244436,0.009218554,0.8051849,0.1195585,0.01536876,0.01120152],"study_design_scores_gemma":[0.002084284,0.0007257356,0.008513846,0.0004900974,0.00004808478,0.0002196753,0.0001900659,0.5995966,0.3786141,0.003952732,0.004429037,0.001135666],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3002575,0.000044268,0.6845066,0.009608288,0.0002013538,0.0003478962,0.00005431626,0.0004085784,0.004571218],"genre_scores_gemma":[0.9933596,0.0002275055,0.005303892,0.0005681792,0.00008383604,0.00006722761,0.00006472762,0.0000159871,0.0003090618],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6931021,"threshold_uncertainty_score":0.7784446,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03488705910142149,"gpt":0.251743064700783,"spread":0.2168560055993615,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003703498,0.0004280294,0.0005092939,0.000373199,0.0008632179,0.0003574679,0.0004017939,0.0002105317,0.00001182008],"category_scores_gemma":[0.0001384617,0.0004257258,0.00006998043,0.001035901,0.0001987703,0.0008881754,0.00007141607,0.000397351,0.00005136859],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001476589,"about_ca_system_score_gemma":0.0001238473,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005702157,"about_ca_topic_score_gemma":0.000001735829,"domain_scores_codex":[0.9975827,0.00000417403,0.0007258056,0.0009225926,0.0002515438,0.0005132371],"domain_scores_gemma":[0.9980873,0.00005928522,0.0008279395,0.0001362501,0.0006928141,0.0001964519],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001126685,0.0007556283,0.01269054,0.0007537219,0.0002849402,0.00003152113,0.003963545,0.009894272,0.001624075,0.9632251,0.001517674,0.004132289],"study_design_scores_gemma":[0.006304231,0.000929947,0.01416801,0.001652422,0.0001697587,0.00100809,0.0007438038,0.7663347,0.0008462308,0.1709758,0.03357141,0.003295535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02143126,0.0006216729,0.9660102,0.003232989,0.0001333319,0.0004241228,0.0001668295,0.0002176036,0.007762012],"genre_scores_gemma":[0.9507406,0.0002271181,0.04698554,0.0004695662,0.0004169769,0.0002659523,0.0001795415,0.00007246357,0.0006422825],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9293093,"threshold_uncertainty_score":0.9998195,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02885853838355579,"gpt":0.2853864491754042,"spread":0.2565279107918484,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008599116,0.0003702151,0.0007107619,0.0008022138,0.0002886243,0.0005157315,0.0009467325,0.0001883064,0.000006815529],"category_scores_gemma":[0.00007719293,0.0003639894,0.0001265103,0.001289133,0.000128917,0.002512399,0.0004205694,0.0002377428,0.000004822808],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001529614,"about_ca_system_score_gemma":0.0001111466,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002718884,"about_ca_topic_score_gemma":0.000003246314,"domain_scores_codex":[0.9966499,0.00002331236,0.001094947,0.0009370195,0.0007306626,0.0005641525],"domain_scores_gemma":[0.9983509,0.00006770725,0.0006135711,0.0002179337,0.0005456357,0.0002043117],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001358551,0.001040741,0.2478733,0.00200101,0.001830257,0.0001476927,0.01912478,0.318688,0.3941683,0.01001743,0.0005405709,0.003209352],"study_design_scores_gemma":[0.0008896166,0.0000797043,0.00452734,0.0004313739,0.00007435978,0.0001120918,0.00009759425,0.9919959,0.0008565914,0.0005196567,0.00003273538,0.0003830058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9104619,0.00005633828,0.0804017,0.0004151527,0.00004530296,0.001846357,0.00004601055,0.0002803582,0.0064469],"genre_scores_gemma":[0.9824955,0.00009610804,0.01626834,0.0000217998,0.00008991529,0.0006647172,0.00009345126,0.00002762124,0.0002425513],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6733079,"threshold_uncertainty_score":0.9998812,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.02947974303796063,"gpt":0.2432613863862253,"spread":0.2137816433482647,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002614931,0.0003936282,0.0003421095,0.0001431948,0.00036911,0.0003228088,0.0002665606,0.0001476078,0.00001243234],"category_scores_gemma":[0.00004588932,0.0004087193,0.00005973333,0.0002005861,0.0002419544,0.0009297813,0.00008946755,0.0003391017,0.000004898089],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000174512,"about_ca_system_score_gemma":0.00005960571,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002197687,"about_ca_topic_score_gemma":0.000001102479,"domain_scores_codex":[0.9981052,0.000011812,0.000460562,0.0005247472,0.0004105783,0.0004871384],"domain_scores_gemma":[0.9991641,0.00005139601,0.0001381711,0.00008553905,0.0003469754,0.000213789],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.003817848,0.002082787,0.163416,0.007507124,0.002256824,0.0006417773,0.01597665,0.4993081,0.23714,0.00403676,0.04890202,0.01491417],"study_design_scores_gemma":[0.001697641,0.00007731419,0.002094428,0.0002819705,0.00009793208,0.001207553,0.000105407,0.9828485,0.005783693,0.002721774,0.00225999,0.0008238618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8130751,0.002049439,0.1815431,0.0002903527,0.0007413289,0.0003992748,0.0001028092,0.000565401,0.001233212],"genre_scores_gemma":[0.9938853,0.0005428166,0.004794592,0.00008475409,0.0004540927,0.00005258819,0.00005919134,0.00005412029,0.00007249218],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4835403,"threshold_uncertainty_score":0.9998364,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02057417183602137,"gpt":0.2705028757412961,"spread":0.2499287039052747,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002665829,0.0003334635,0.0003186713,0.000265224,0.0002357752,0.0002620871,0.0006501512,0.000108578,0.000001274801],"category_scores_gemma":[0.0002032805,0.0002911618,0.00004026723,0.0006973931,0.0002091305,0.001579169,0.0001699013,0.0003333375,0.000003421743],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001766674,"about_ca_system_score_gemma":0.0001083383,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001483474,"about_ca_topic_score_gemma":0.000004119117,"domain_scores_codex":[0.9978982,0.0000143946,0.0003995173,0.0007123424,0.0004849864,0.0004905186],"domain_scores_gemma":[0.9990057,0.00009614453,0.0002255478,0.0001276105,0.0004260298,0.0001189626],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002801221,0.003468946,0.531396,0.003138203,0.0009081158,0.001646246,0.04262797,0.1940684,0.05096995,0.06009143,0.002017948,0.1068656],"study_design_scores_gemma":[0.01297754,0.002058992,0.1457311,0.003427602,0.0001016481,0.007063407,0.002631146,0.7545739,0.01418982,0.02888969,0.0218767,0.006478502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09626579,0.0003133534,0.9007416,0.001143517,0.0002511399,0.0002817298,0.000008694102,0.0006549416,0.0003392143],"genre_scores_gemma":[0.7169154,0.0001038477,0.2825563,0.00004327904,0.00004616148,0.0001376565,0.00002568203,0.00002118574,0.0001504918],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6206496,"threshold_uncertainty_score":0.999954,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02343086121392259,"gpt":0.2735070975637733,"spread":0.2500762363498507,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002615438,0.0002272402,0.0002069195,0.0001110744,0.0004952406,0.000278859,0.0004824002,0.00004952059,0.000008128251],"category_scores_gemma":[0.0003819307,0.0001750414,0.00007352271,0.000281218,0.0002078166,0.0006975282,0.00006441816,0.0001409821,0.00000262836],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005592379,"about_ca_system_score_gemma":0.0001402624,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000985708,"about_ca_topic_score_gemma":3.880752e-7,"domain_scores_codex":[0.9984383,0.00001449032,0.0004012096,0.0004628435,0.0004373784,0.0002457648],"domain_scores_gemma":[0.998194,0.0005405411,0.0003496199,0.0001110064,0.0007098122,0.00009495315],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.004665875,0.004108122,0.02964845,0.002008823,0.0005925482,0.00005455751,0.006361175,0.3486642,0.3767466,0.1833688,0.03394902,0.009831904],"study_design_scores_gemma":[0.002109678,0.0001189435,0.0003462279,0.0001258159,0.00002404041,0.00007604344,0.00002131237,0.9429379,0.04640663,0.007235925,0.0003235589,0.0002740048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4497209,0.00003960266,0.5466912,0.002771378,0.0001330367,0.0002973595,0.00009662754,0.00007234638,0.0001775308],"genre_scores_gemma":[0.9920167,0.00002114929,0.007273754,0.0004054606,0.0001044001,0.00007994127,0.00005666822,0.00001425471,0.00002761106],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5942736,"threshold_uncertainty_score":0.713798,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01950249187029085,"gpt":0.2453672408919554,"spread":0.2258647490216645,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001651945,0.0002781613,0.000208276,0.00008889147,0.0003122228,0.0001592395,0.0003357684,0.0001087828,0.00007216191],"category_scores_gemma":[0.00009878856,0.0002080093,0.00005407138,0.0003070739,0.0001402469,0.0001777087,0.00002942919,0.0003066009,0.00004663157],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005867772,"about_ca_system_score_gemma":0.00003182337,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001916972,"about_ca_topic_score_gemma":9.792434e-8,"domain_scores_codex":[0.9986275,0.00001401109,0.000320524,0.0003205736,0.0003882588,0.0003291285],"domain_scores_gemma":[0.999265,0.0002135196,0.0001006335,0.0000750898,0.0002198584,0.0001259673],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001534251,0.001603989,0.01746871,0.001605992,0.0004895524,0.00007555835,0.008994866,0.1180676,0.7584451,0.00863169,0.0666379,0.01644486],"study_design_scores_gemma":[0.001824576,0.0004114858,0.005313306,0.0002598082,0.00004924184,0.0001391185,0.0002013242,0.9332012,0.0356377,0.007861568,0.0140012,0.001099475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8912182,0.0004930628,0.06270611,0.005361637,0.0003940925,0.0004665564,0.00006883245,0.000795305,0.03849623],"genre_scores_gemma":[0.995584,0.000142421,0.002296272,0.0003719042,0.000189396,0.00009614243,0.00003501725,0.0000344396,0.001250474],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8151336,"threshold_uncertainty_score":0.8482373,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02904790899865553,"gpt":0.2762538524380148,"spread":0.2472059434393592,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003960386,0.0004363041,0.0004426142,0.0001561313,0.0003332967,0.0004940728,0.0009518052,0.0001331336,0.000005058593],"category_scores_gemma":[0.00005194534,0.0003861621,0.00006326118,0.000539545,0.0002652551,0.002788391,0.0003564024,0.000314727,0.000001695831],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009295317,"about_ca_system_score_gemma":0.0003396033,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002627295,"about_ca_topic_score_gemma":0.000001246405,"domain_scores_codex":[0.9971464,0.0000362076,0.0007090284,0.0009057086,0.0007437329,0.0004588822],"domain_scores_gemma":[0.9976481,0.0001003563,0.0007134691,0.0001770481,0.001155702,0.0002052983],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0590379,0.0240807,0.09002663,0.0379012,0.003865229,0.001572602,0.04551684,0.1699519,0.121459,0.1193042,0.1577778,0.169506],"study_design_scores_gemma":[0.004584374,0.0007419486,0.0007415584,0.0009407199,0.00003517601,0.0009904744,0.00009498038,0.9504763,0.03328365,0.003863682,0.003375213,0.0008718567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"protocol","genre_scores_codex":[0.00293342,0.0000191879,0.8408467,0.0007120307,0.0001329681,0.1545057,0.00004230137,0.0001883554,0.0006193471],"genre_scores_gemma":[0.4625027,0.000004597438,0.02011358,0.0002069069,0.0001927275,0.5167609,0.00002191574,0.00003298313,0.0001636936],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8207331,"threshold_uncertainty_score":0.999859,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0254816714249268,"gpt":0.2831043667954523,"spread":0.2576226953705255,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009682049,0.0004769367,0.0005323511,0.0002567069,0.0009052266,0.0009998934,0.001225912,0.0001963418,0.00000466242],"category_scores_gemma":[0.0001850949,0.0004344193,0.0001931326,0.0004498829,0.0001243462,0.001828554,0.000245066,0.0003069132,0.000007253362],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001471034,"about_ca_system_score_gemma":0.0002521168,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000305534,"about_ca_topic_score_gemma":4.256294e-7,"domain_scores_codex":[0.9967131,0.00002854957,0.0008075428,0.001028639,0.000707267,0.0007148815],"domain_scores_gemma":[0.9977469,0.0003442659,0.0005402282,0.0001718141,0.0008991712,0.0002976349],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.003615372,0.002795206,0.009610637,0.004418592,0.001698993,0.000401363,0.01891927,0.0512247,0.09848585,0.7417979,0.03229126,0.0347409],"study_design_scores_gemma":[0.003173393,0.0002274167,0.000517613,0.0003398152,0.00006834114,0.001106139,0.0003438246,0.9671594,0.002370068,0.0132737,0.01043496,0.0009853377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007498054,0.0008688263,0.986679,0.001826362,0.0009754806,0.0005974092,0.0001516081,0.0002870658,0.001116253],"genre_scores_gemma":[0.8151703,0.0002524419,0.1817452,0.0003402504,0.0009671072,0.0005162653,0.0001202212,0.00004452492,0.0008436624],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9159347,"threshold_uncertainty_score":0.9998108,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03285077255578916,"gpt":0.2692368145060563,"spread":0.2363860419502671,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002464094,0.0002124084,0.0002104968,0.0001185895,0.0005537026,0.0003647823,0.000456829,0.0001111313,0.000006901702],"category_scores_gemma":[0.00003513037,0.0001970611,0.00009657541,0.0002224749,0.00008634397,0.001127474,0.00008029259,0.0001387729,0.00000674295],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007328265,"about_ca_system_score_gemma":0.00006740392,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001251646,"about_ca_topic_score_gemma":0.000001307333,"domain_scores_codex":[0.9983958,0.000006925727,0.0004085742,0.0005233464,0.0003233168,0.0003420427],"domain_scores_gemma":[0.9988326,0.0000471596,0.0002398928,0.00008102159,0.0006692804,0.0001300893],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001703003,0.002063002,0.07244319,0.002203446,0.001342602,0.0001414237,0.02367007,0.05113991,0.04336031,0.3822592,0.397567,0.02210685],"study_design_scores_gemma":[0.001147928,0.0001474884,0.0006451869,0.0001867174,0.00001703868,0.00039575,0.0001095052,0.9552539,0.0007808993,0.003033116,0.03782574,0.0004567063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02724083,0.00012051,0.96503,0.003125797,0.001294803,0.0002752677,0.00003282223,0.0002523226,0.002627613],"genre_scores_gemma":[0.9822032,0.00007308672,0.01563142,0.0003814049,0.0009416853,0.0001735152,0.0000655792,0.00001508491,0.0005150642],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9549623,"threshold_uncertainty_score":0.8035917,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03813043387957132,"gpt":0.2836121908308533,"spread":0.2454817569512819,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003792458,0.0002551721,0.0002441128,0.0001578646,0.0004544782,0.000551327,0.0003779382,0.0001698613,0.000001927453],"category_scores_gemma":[0.00006868,0.0002527237,0.00004066927,0.0002726542,0.0001705194,0.002161245,0.000113801,0.0002223832,0.000003053472],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001273272,"about_ca_system_score_gemma":0.0001140741,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007706331,"about_ca_topic_score_gemma":9.699845e-7,"domain_scores_codex":[0.9981415,0.00002124766,0.0005123354,0.000595723,0.000461827,0.0002673541],"domain_scores_gemma":[0.9986724,0.00003794429,0.0004097767,0.00009952504,0.0006402236,0.0001401774],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006145646,0.0008792397,0.4783357,0.001723642,0.0003964463,0.0001524771,0.01450061,0.01714604,0.3218076,0.1509753,0.003419722,0.01004861],"study_design_scores_gemma":[0.0005799769,0.00006022142,0.002840573,0.0002268662,0.00001638859,0.0006436489,0.0001180749,0.9860744,0.004395782,0.004340701,0.0003153235,0.000388064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1913105,0.0002083521,0.8062868,0.0006776287,0.0002148348,0.0002160977,0.00001058055,0.000338149,0.0007370517],"genre_scores_gemma":[0.951621,0.00006078292,0.04788305,0.0001101243,0.0001596379,0.00003013864,0.00004060876,0.00001496088,0.00007967521],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9689283,"threshold_uncertainty_score":0.9999925,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04134679589058809,"gpt":0.2245701807719665,"spread":0.1832233848813784,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002031341,0.0003364233,0.0002424598,0.0001509607,0.0005072477,0.0002088587,0.0003653162,0.00008673911,0.000004108905],"category_scores_gemma":[0.00006826389,0.0002666462,0.00005639885,0.0003593404,0.0001014231,0.0007377419,0.00007037856,0.0003117971,0.00001389539],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003797657,"about_ca_system_score_gemma":0.0001042653,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001781925,"about_ca_topic_score_gemma":0.000002418397,"domain_scores_codex":[0.9983827,0.00001150415,0.0004120669,0.0004175927,0.000400943,0.0003751999],"domain_scores_gemma":[0.9992496,0.00004488128,0.0001251051,0.00008131651,0.0003582498,0.0001407808],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000102042,0.00006137828,0.006244518,0.000250982,0.0001666031,0.00001614978,0.006850132,0.9475144,0.019965,0.001075576,0.01703007,0.0007232179],"study_design_scores_gemma":[0.000528672,0.00007007829,0.001099195,0.0003586606,0.00005100621,0.0005611788,0.001391423,0.981753,0.009673801,0.0007349476,0.003134208,0.0006438077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1404302,0.0006108956,0.8461066,0.003367964,0.0004660731,0.0007442608,0.0001163588,0.0008431289,0.007314484],"genre_scores_gemma":[0.966914,0.00009901672,0.03186383,0.0001074699,0.0003864142,0.0002204443,0.0001677708,0.000048899,0.0001921561],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8264838,"threshold_uncertainty_score":0.9999786,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}