{"meta":{"query_hash":"cc7a4a629a76","filters":{"venue":"Proceedings of the International Conference on Parallel Processing"},"cohort_total":16,"direct_labels_cover":0,"predictions_cover":16,"exported":16,"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/cc7a4a629a76","api":"https://metacan.xera.ac/api/v1/cohort?venue=Proceedings+of+the+International+Conference+on+Parallel+Processing"},"results":[{"id":"W1487427737","doi":"10.1109/icppw.2004.82","title":"Trellis driver: distributing a java workflow across a network of workstations","year":2004,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Parallel Processing","topic":"Distributed and Parallel Computing Systems","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 Alberta","funders":"","keywords":"Computer science; Java; Workflow; Operating system; Server; Trellis (graph); Workload; Executable; Scripting language; Throughput; Real time Java; Distributed computing; Programming language; Database","score_opus":0.031838616023335146,"score_gpt":0.2860854374893343,"score_spread":0.25424682146599914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1487427737","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.37844017,0.00022734773,0.58687454,0.0074099647,0.001139307,0.0005438712,0.000057946792,0.000255855,0.025051013],"genre_scores_gemma":[0.9773843,0.000013741865,0.0221567,0.00010071325,0.00012666454,0.000016972297,0.000007281363,0.000011456373,0.00018212998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777365,0.000011197874,0.0006445562,0.00042419045,0.0007427928,0.00040362336],"domain_scores_gemma":[0.9976007,0.000061184364,0.00093590684,0.00019256363,0.0011366153,0.0000730432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050596957,0.00022648882,0.0003017896,0.00005091704,0.0003095289,0.00043231482,0.0025408887,0.000092376475,0.000006383218],"category_scores_gemma":[0.00018278453,0.00017920147,0.00016026145,0.00072102796,0.00015527288,0.00056443474,0.00048139642,0.0002801411,0.0000059991994],"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.000119855955,0.0003699482,0.012290211,0.00022766567,0.00015054355,0.000002703387,0.005795979,0.13472798,0.0030268591,0.81655747,0.0009739304,0.025756868],"study_design_scores_gemma":[0.00449781,0.00044229295,0.02528784,0.012914819,0.00007377971,0.000120248864,0.002235807,0.4906118,0.009565913,0.4498975,0.0027952492,0.0015569415],"about_ca_topic_score_codex":0.000037488968,"about_ca_topic_score_gemma":0.0000059130766,"teacher_disagreement_score":0.5989442,"about_ca_system_score_codex":0.00012148237,"about_ca_system_score_gemma":0.00022709598,"threshold_uncertainty_score":0.73076236},"labels":[],"label_agreement":null},{"id":"W1490328206","doi":"10.1109/icppw.2004.81","title":"Traffic classification and fairness in wavelength routed optical networks","year":2004,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Parallel Processing","topic":"Advanced Optical Network Technologies","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 Ottawa","funders":"","keywords":"Reservation; Routing and wavelength assignment; Computer science; Computer network; Hop (telecommunications); Blocking (statistics); Wavelength; Routing (electronic design automation); Distributed computing; Constraint (computer-aided design); Wavelength-division multiplexing; Mathematics; Physics; Optics","score_opus":0.027613353979330887,"score_gpt":0.25242027677974593,"score_spread":0.22480692280041503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1490328206","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.97631305,0.00010939264,0.011636686,0.0019987912,0.00013030507,0.00020453263,0.0000011411405,0.00025976537,0.0093463445],"genre_scores_gemma":[0.9881121,0.00017048989,0.011586204,0.000031090065,0.00003382976,0.000030065281,0.0000014030346,0.000017840077,0.000016975056],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907255,0.0000013686594,0.00028186885,0.0002117678,0.00023334175,0.00019908052],"domain_scores_gemma":[0.9996471,0.000022490703,0.000083254075,0.000059030255,0.00015605772,0.000032103653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000104657,0.00015213678,0.00015817684,0.00009839333,0.00004442808,0.00008475057,0.0004430692,0.00011991713,0.0000031343272],"category_scores_gemma":[0.000100691206,0.00012143809,0.000026784282,0.0002286361,0.00016358696,0.000304278,0.00007979613,0.00035884566,0.000001201019],"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.00008637986,0.000088498105,0.001169644,0.000111987116,0.000024731047,0.0000011383005,0.00027077753,0.53578794,0.005523373,0.36544847,0.000020612562,0.09146645],"study_design_scores_gemma":[0.0005090546,0.000028167167,0.0070942277,0.0004716627,0.0000063242023,0.000008312604,0.0004610512,0.9660092,0.000807303,0.024410974,0.000019973866,0.00017372766],"about_ca_topic_score_codex":0.0000010293254,"about_ca_topic_score_gemma":0.0000045495603,"teacher_disagreement_score":0.4302213,"about_ca_system_score_codex":0.00012435371,"about_ca_system_score_gemma":0.00002117859,"threshold_uncertainty_score":0.49521017},"labels":[],"label_agreement":null},{"id":"W1516596781","doi":"10.1109/icppw.2004.46","title":"High-throughput interference-aware MAC protocols for heterogeneous ad hoc networks and multihop wireless LANs","year":2004,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Parallel Processing","topic":"Wireless Networks and Protocols","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":"Queen's University","funders":"","keywords":"Computer network; Computer science; Multiple Access with Collision Avoidance for Wireless; Wireless ad hoc network; Throughput; Interference (communication); Power control; Wireless; Access control; Collision problem; Collision; Hidden node problem; Wireless network; Vehicular ad hoc network; Wi-Fi array; Power (physics); Telecommunications; Computer security","score_opus":0.04607121612235224,"score_gpt":0.30540851933557306,"score_spread":0.2593373032132208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1516596781","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.08029732,0.00023688868,0.8706204,0.0109814145,0.0006610288,0.035284225,0.0000378108,0.00036195212,0.0015189496],"genre_scores_gemma":[0.9676181,0.00005895888,0.018343588,0.0004062489,0.00015419607,0.01325185,0.0000038687263,0.000027221786,0.00013594063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791723,0.000010309577,0.00052341085,0.0006652597,0.00047985942,0.00040392362],"domain_scores_gemma":[0.99821335,0.00005302601,0.00059304084,0.00020454249,0.00083375926,0.00010230994],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030244337,0.0003311227,0.00036237502,0.00009617349,0.00027773998,0.0007569363,0.0021579652,0.00015309245,0.000007997984],"category_scores_gemma":[0.000045078064,0.0002476127,0.0001158465,0.0002129241,0.00016876802,0.000728578,0.0005486824,0.00031702622,0.0000019419986],"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.0019488063,0.00088483497,0.0021112578,0.0014358282,0.00029877824,0.000008593564,0.0033165258,0.046917405,0.008627143,0.55476576,0.00081954204,0.37886554],"study_design_scores_gemma":[0.0048916433,0.0010985493,0.0005943347,0.0057257703,0.000029098872,0.00008767446,0.0002291897,0.86065483,0.018842338,0.10501347,0.001841823,0.0009912569],"about_ca_topic_score_codex":0.000013878689,"about_ca_topic_score_gemma":0.000015767271,"teacher_disagreement_score":0.8873208,"about_ca_system_score_codex":0.00010250949,"about_ca_system_score_gemma":0.00016809508,"threshold_uncertainty_score":0.9999976},"labels":[],"label_agreement":null},{"id":"W1533415957","doi":"10.1109/icppw.2004.83","title":"Trellis-SDP: A simple data-parallel programming interface","year":2004,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Parallel Processing","topic":"Distributed and Parallel Computing Systems","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 Alberta","funders":"","keywords":"Trellis (graph); Computer science; Simple (philosophy); Parallel computing; Interface (matter); Distributed computing; Theoretical computer science; Computer engineering; Algorithm","score_opus":0.06920772850758442,"score_gpt":0.31560833009298594,"score_spread":0.24640060158540153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1533415957","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.075641945,0.00038786893,0.855669,0.0159954,0.0013861335,0.001062008,0.000057818976,0.0007093689,0.049090423],"genre_scores_gemma":[0.95871925,0.000014629771,0.040426426,0.00022433158,0.00014725474,0.000027260263,0.000019026536,0.000020612064,0.0004012053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970059,0.000013733094,0.0006715989,0.0008493448,0.001004595,0.00045485783],"domain_scores_gemma":[0.99778235,0.000037329213,0.0007549098,0.00053234625,0.00077928836,0.00011377629],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0006181274,0.00033619648,0.00034051895,0.00014851885,0.00027738512,0.0010597326,0.007583485,0.00010954326,0.000013100372],"category_scores_gemma":[0.00019279149,0.0002545518,0.00011760658,0.00049813703,0.00014624129,0.0013921832,0.0015922409,0.0003992121,0.000034260134],"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.00029761784,0.001148915,0.0026535208,0.00058727874,0.0003189118,0.000010612233,0.005347964,0.039136115,0.010842517,0.8620535,0.0054892255,0.0721138],"study_design_scores_gemma":[0.004446948,0.00054646074,0.0013601071,0.003795693,0.000074009506,0.00026824142,0.001524515,0.7842931,0.007717051,0.15046167,0.043754175,0.0017579864],"about_ca_topic_score_codex":0.000076311524,"about_ca_topic_score_gemma":0.000008755272,"teacher_disagreement_score":0.8830773,"about_ca_system_score_codex":0.00013617892,"about_ca_system_score_gemma":0.00031129378,"threshold_uncertainty_score":0.99999064},"labels":[],"label_agreement":null},{"id":"W1551153256","doi":"10.1109/icppw.2004.26","title":"All-optical network demonstrator program centered around a testbed for verifying and validating next generation optical networks","year":2004,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Parallel Processing","topic":"Optical Network Technologies","field":"Engineering","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":"Communications Research Centre Canada","funders":"","keywords":"Testbed; Computer science; Scalability; Network management; Network architecture; Network monitoring; Computer network; Network management station; Optical Transport Network; Key (lock); Distributed computing; Passive optical network; Embedded system; Computer architecture; Wavelength-division multiplexing; Operating system","score_opus":0.08766292975426034,"score_gpt":0.2962825547145076,"score_spread":0.20861962496024727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1551153256","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.9433993,0.00026477873,0.04652157,0.0024729015,0.00049490476,0.0010671447,0.0000041279527,0.00070100935,0.005074255],"genre_scores_gemma":[0.85235906,0.0000583503,0.14694294,0.00009428083,0.00034408964,0.00015337665,0.0000071331992,0.00003406636,0.000006706804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984528,0.0000027823821,0.00045825113,0.000339315,0.00032768148,0.00041917877],"domain_scores_gemma":[0.9992876,0.00006254663,0.00015553682,0.00008539175,0.00032815844,0.00008076372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002396183,0.00026344112,0.0002566578,0.00006018136,0.00016680759,0.0005795222,0.0005181108,0.00019380433,0.0000026383168],"category_scores_gemma":[0.00025047793,0.00021800649,0.00007657365,0.00018038222,0.00021020969,0.0004774415,0.00014846308,0.00038287806,9.56973e-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.0002802118,0.0003117822,0.0030815143,0.00052645965,0.00031010286,0.00000240526,0.00021747408,0.2858316,0.08889512,0.5038593,0.00046098558,0.116223074],"study_design_scores_gemma":[0.00068087544,0.00013966936,0.0002543036,0.00058925146,0.00004263148,0.000017966271,0.00021621474,0.9804695,0.0049995426,0.012243326,0.00008241058,0.00026430158],"about_ca_topic_score_codex":0.0000014050147,"about_ca_topic_score_gemma":0.0000028836587,"teacher_disagreement_score":0.6946379,"about_ca_system_score_codex":0.00012319128,"about_ca_system_score_gemma":0.000043891952,"threshold_uncertainty_score":0.8890047},"labels":[],"label_agreement":null},{"id":"W1572240008","doi":"10.1109/icppw.2004.35","title":"Constrained cost minimization for multipoint communication groups","year":2004,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Parallel Processing","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Minification; Span (engineering); Routing (electronic design automation); Distributed computing; Range (aeronautics); Path (computing); Quality of service; Mathematical optimization; Core (optical fiber); Computer network; Mathematics; Telecommunications; Engineering","score_opus":0.03771328992926238,"score_gpt":0.2766058736599391,"score_spread":0.23889258373067673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1572240008","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.022669334,0.000091709175,0.919745,0.0386262,0.00043674698,0.0012664964,0.000009993729,0.0002101977,0.016944265],"genre_scores_gemma":[0.9464017,0.000022579903,0.052692756,0.0005116895,0.00005550987,0.00015062226,0.0000052637893,0.000008640421,0.0001512357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988486,0.0000062788513,0.00034142332,0.00027798858,0.00035761655,0.0001680588],"domain_scores_gemma":[0.9982855,0.000056100173,0.00043725307,0.0001414058,0.0010342008,0.000045540677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026331784,0.00014176432,0.00014861544,0.000077107565,0.00021379483,0.0002931978,0.00161796,0.00006252699,0.000007174282],"category_scores_gemma":[0.0001629111,0.00011208687,0.00008166401,0.00016946973,0.00012317902,0.0005961273,0.00014951422,0.00013826003,0.0000032934581],"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.00008626055,0.00010545914,0.000110712,0.000030238849,0.000023607006,8.814315e-8,0.0005534829,0.0054819128,0.00189562,0.9220199,0.00018804558,0.069504656],"study_design_scores_gemma":[0.002763325,0.00009867981,0.0003767417,0.00063299545,0.000018102715,0.000014061605,0.0003531119,0.87822986,0.0035660542,0.11294571,0.0007449607,0.00025639927],"about_ca_topic_score_codex":0.0000047358008,"about_ca_topic_score_gemma":0.000004265957,"teacher_disagreement_score":0.92373234,"about_ca_system_score_codex":0.00008744013,"about_ca_system_score_gemma":0.00016926203,"threshold_uncertainty_score":0.45707697},"labels":[],"label_agreement":null},{"id":"W1574747178","doi":"10.1109/icppw.2004.72","title":"PIES: Protocol independent energy saving algorithm","year":2004,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Parallel Processing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Computer network; Routing protocol; Distributed computing; Protocol (science); Node (physics); Energy (signal processing); Energy conservation; Set (abstract data type); Routing (electronic design automation); Engineering; Mathematics","score_opus":0.02704097689361715,"score_gpt":0.28060571066534173,"score_spread":0.25356473377172456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574747178","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.0034683417,0.000036079186,0.8567079,0.008949354,0.0008070961,0.012432115,0.0000046223595,0.00042234716,0.11717219],"genre_scores_gemma":[0.9290944,0.0000060566613,0.060965467,0.00064044545,0.00018457291,0.008502313,8.1768064e-7,0.000021569003,0.0005843631],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99759305,0.0000069700104,0.00047111107,0.0005316556,0.0010771746,0.00032007316],"domain_scores_gemma":[0.9982866,0.000020789488,0.0005929775,0.00020316424,0.0008140899,0.00008237955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030846198,0.00024564407,0.0002113271,0.00013261323,0.00019968748,0.00058675115,0.0033054256,0.00010126698,0.000028811248],"category_scores_gemma":[0.00006727187,0.00018496449,0.000104337785,0.00034312753,0.0001117959,0.0010956106,0.0007578997,0.00031258745,0.0000081796725],"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.000052873715,0.0002571178,0.00026679484,0.00007937535,0.000046466655,0.0000031590378,0.00076410273,0.0024289496,0.00572141,0.84859353,0.000306525,0.14147967],"study_design_scores_gemma":[0.0032756801,0.0003542216,0.0013292053,0.0026588615,0.000018373008,0.0001303889,0.00041857932,0.47910506,0.04051899,0.46536562,0.0058922283,0.00093280076],"about_ca_topic_score_codex":0.000044405326,"about_ca_topic_score_gemma":0.000007281776,"teacher_disagreement_score":0.92562604,"about_ca_system_score_codex":0.00020669581,"about_ca_system_score_gemma":0.0003079895,"threshold_uncertainty_score":0.7542633},"labels":[],"label_agreement":null},{"id":"W1575688676","doi":"10.1109/icppw.2004.8","title":"A data identi .cation scheme for automatic relative debugging","year":2004,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Parallel Processing","topic":"Parallel Computing and Optimization Techniques","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":"Queen's University","funders":"","keywords":"Debugging; Computer science; Scheme (mathematics); Code (set theory); Algorithmic program debugging; Programming language; Identification (biology); Parallel computing; Mathematics","score_opus":0.08693031224175103,"score_gpt":0.3385768329552807,"score_spread":0.25164652071352966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1575688676","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.0063547073,0.000049522063,0.9762646,0.0081277555,0.00017935177,0.00037034944,0.000008071167,0.00033394172,0.008311682],"genre_scores_gemma":[0.6115233,0.0000086200025,0.38805324,0.00018864879,0.00003507512,0.000031561263,0.00000706685,0.000008467307,0.0001440721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844867,0.0000058132205,0.00040011335,0.00046189083,0.0004947058,0.00018881907],"domain_scores_gemma":[0.99817055,0.000043553086,0.00060180016,0.00027452773,0.00086995563,0.00003962457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005101283,0.00015959378,0.00016351652,0.00014879892,0.00024154455,0.0004019504,0.003521841,0.00006219529,0.0000039594115],"category_scores_gemma":[0.00044437856,0.00012783681,0.000061400184,0.00028602287,0.00006855254,0.0018163573,0.00066438,0.00016056212,0.000003912657],"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.000030351877,0.00016148537,0.00034614655,0.00014853314,0.000073924224,2.6758806e-7,0.0010189159,0.0028915473,0.005764115,0.9747513,0.00090435176,0.013909082],"study_design_scores_gemma":[0.0004308451,0.00004317337,0.00026588616,0.00060366286,0.000010546697,0.000008058552,0.000053034295,0.82217914,0.0043440545,0.17174579,0.00016123813,0.0001545572],"about_ca_topic_score_codex":0.0000075886715,"about_ca_topic_score_gemma":0.0000015142709,"teacher_disagreement_score":0.8192876,"about_ca_system_score_codex":0.0001044443,"about_ca_system_score_gemma":0.0002493147,"threshold_uncertainty_score":0.65445155},"labels":[],"label_agreement":null},{"id":"W1597189333","doi":"10.1109/icppw.2004.7","title":"A cycle-based rerouting scheme for wavelength-routed WDM networks","year":2004,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Parallel Processing","topic":"Advanced Optical Network Technologies","field":"Engineering","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":"Nortel (Canada); University of Ottawa; Communications Research Centre Canada","funders":"","keywords":"Wavelength-division multiplexing; Computer science; Scalability; Computer network; Scheme (mathematics); Upper and lower bounds; Optical mesh network; Set (abstract data type); Distributed computing; Mesh networking; Wavelength; Telecommunications; Wireless mesh network; Mathematics; Optics; Physics","score_opus":0.02707819586340818,"score_gpt":0.261417903230544,"score_spread":0.2343397073671358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1597189333","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.3625395,0.00025471195,0.6038535,0.0077866022,0.00074857473,0.0011268553,0.000017254939,0.0017574603,0.0219155],"genre_scores_gemma":[0.8721164,0.0000231696,0.12744473,0.00015987795,0.00009548856,0.0000854505,0.000003619915,0.00003741241,0.00003387813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986948,0.0000012424994,0.00037485018,0.00027227265,0.00031856916,0.0003382775],"domain_scores_gemma":[0.99913806,0.00004940839,0.00019373982,0.00009984515,0.00047646463,0.000042493117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001531774,0.00023048323,0.00021838497,0.000093664814,0.00012954597,0.00012110983,0.00086050906,0.00014472233,0.000005593968],"category_scores_gemma":[0.00029327764,0.0001873052,0.000098931916,0.0002330724,0.00013567787,0.00028311677,0.0000992265,0.00035777962,0.000002071579],"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.00019123513,0.000081318845,0.00036921332,0.0002533576,0.000074518,5.791979e-7,0.00012645785,0.7550928,0.01382927,0.20425941,0.00015015255,0.025571689],"study_design_scores_gemma":[0.0007992615,0.000048684855,0.00012519554,0.00068510737,0.000012475149,0.0000029058453,0.00014539347,0.9339875,0.0070133875,0.05676615,0.00017848791,0.00023544452],"about_ca_topic_score_codex":0.0000017520384,"about_ca_topic_score_gemma":0.000001540596,"teacher_disagreement_score":0.50957686,"about_ca_system_score_codex":0.00017223692,"about_ca_system_score_gemma":0.000047176676,"threshold_uncertainty_score":0.7638084},"labels":[],"label_agreement":null},{"id":"W2097637319","doi":"10.1109/icpp.2007.83","title":"Two-Phase Computation and Data Scheduling Algorithms for Workflows in the Grid","year":2007,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Parallel Processing","topic":"Distributed and Parallel Computing Systems","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":"Queen's University","funders":"","keywords":"Computer science; Workflow; Grid; Distributed computing; Grid computing; Scheduling (production processes); Algorithm; Job shop scheduling; Workflow management system; Schedule; Database; Mathematical optimization; Mathematics; Operating system","score_opus":0.11565565128086662,"score_gpt":0.3874293614310843,"score_spread":0.2717737101502177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097637319","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.097759016,0.00013679996,0.8913465,0.004603787,0.0005586756,0.00052791776,0.000020992664,0.000056138033,0.0049901707],"genre_scores_gemma":[0.92418766,0.0000056020076,0.075295165,0.00025712006,0.00019148736,0.000013112368,0.000018383547,0.000006742429,0.000024727531],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834126,0.00001199581,0.0004476415,0.0004458887,0.0005111489,0.00024204477],"domain_scores_gemma":[0.9987627,0.00017857866,0.00040602012,0.00018210307,0.0004330936,0.000037483245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021575056,0.0001538517,0.0001672671,0.00011834409,0.00018893069,0.00059505337,0.0029432797,0.000047922007,7.748286e-7],"category_scores_gemma":[0.00019692436,0.00010242896,0.00003783095,0.00032023506,0.00007333527,0.00066414615,0.00042786344,0.00020847328,8.995872e-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.0005518443,0.00094673334,0.0058526266,0.0005318982,0.00011904155,0.0000072825133,0.008643639,0.015546728,0.0050873975,0.585291,0.001800323,0.37562144],"study_design_scores_gemma":[0.0011940718,0.00006404694,0.00067907677,0.00042324045,0.0000068643135,0.000027572161,0.00059013173,0.98178333,0.00016830499,0.0144977495,0.00042436572,0.00014122814],"about_ca_topic_score_codex":0.000019763114,"about_ca_topic_score_gemma":0.000007868605,"teacher_disagreement_score":0.9662366,"about_ca_system_score_codex":0.000033854212,"about_ca_system_score_gemma":0.00008313839,"threshold_uncertainty_score":0.57381135},"labels":[],"label_agreement":null},{"id":"W2098010876","doi":"10.1109/icpp.2007.21","title":"Automatic Trace-Based Parallelization of Java Programs","year":2007,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Parallel Processing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Automatic parallelization; Java; TRACE (psycholinguistics); Parallel computing; Suite; Benchmark (surveying); Parallelism (grammar); Programming language; Compiler","score_opus":0.041380483445933,"score_gpt":0.29546463940185963,"score_spread":0.25408415595592665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098010876","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.089561604,0.000061911895,0.8806256,0.0022102497,0.0002086041,0.00041468427,0.0000011421531,0.00037198703,0.026544202],"genre_scores_gemma":[0.8314986,0.000007054255,0.16817883,0.0001292591,0.000027382051,0.000013064743,0.0000018861471,0.000010483098,0.00013344108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997971,0.000010208955,0.0006439909,0.00033542723,0.00079911674,0.00024023524],"domain_scores_gemma":[0.9976166,0.00004614146,0.0008974285,0.00017427145,0.0012087933,0.00005677051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079429266,0.000189627,0.0002287947,0.0002408057,0.00012028501,0.00019484156,0.0020058306,0.00009252974,0.000013783215],"category_scores_gemma":[0.00015591236,0.00014652888,0.00011014617,0.0005298175,0.00012976713,0.00047420943,0.00018233963,0.00017296536,0.000002208926],"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.00019822361,0.0011255763,0.013074828,0.0006592541,0.00009390747,0.0000019563183,0.00211116,0.01047776,0.020081077,0.6093707,0.0007713171,0.34203422],"study_design_scores_gemma":[0.00046700813,0.00014337095,0.0020892827,0.0007917974,0.000010069543,0.0000069039284,0.00008942277,0.9432609,0.039013598,0.013741056,0.00017259666,0.00021397092],"about_ca_topic_score_codex":0.000009060111,"about_ca_topic_score_gemma":0.0000017176109,"teacher_disagreement_score":0.9327832,"about_ca_system_score_codex":0.000063136664,"about_ca_system_score_gemma":0.00016525209,"threshold_uncertainty_score":0.59752744},"labels":[],"label_agreement":null},{"id":"W2121207198","doi":"10.1109/icpp.2007.69","title":"RDMA-based and SMP-aware Multi-port All-Gather on Multi-rail QsNet^II SMP Clusters","year":2007,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Parallel Processing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Remote direct memory access; Computer science; Data striping; Boosting (machine learning); Port (circuit theory); Parallel computing; Operating system; Computer network; Artificial intelligence","score_opus":0.06271917173527262,"score_gpt":0.3180136848290217,"score_spread":0.25529451309374906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121207198","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.067096904,0.00007038655,0.91279924,0.005771354,0.0003663313,0.00049088325,0.0000049481196,0.0004887149,0.012911241],"genre_scores_gemma":[0.8649492,0.000014827291,0.13252768,0.0015372672,0.000044960987,0.000016638225,0.0000027327442,0.000020888268,0.00088576623],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977808,0.000011916168,0.00051734265,0.0006240718,0.0007081843,0.00035769894],"domain_scores_gemma":[0.99825263,0.000052193052,0.0006014246,0.0001982149,0.0007808451,0.00011466286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000739259,0.0003080185,0.00025495022,0.00027599215,0.00031504757,0.00034979393,0.0017844772,0.00013510359,0.000014349672],"category_scores_gemma":[0.0001485507,0.0002422152,0.000096589996,0.00026269534,0.00016256985,0.00046826783,0.0004553322,0.00034842436,0.0000042925262],"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.0033671197,0.009162043,0.06309866,0.0018951185,0.001039891,0.000073399926,0.028624348,0.09061722,0.06535273,0.32988745,0.01396143,0.3929206],"study_design_scores_gemma":[0.001173219,0.0001957619,0.0030898286,0.0006414742,0.000011777848,0.0000151212325,0.00014206258,0.9804213,0.012031988,0.001282999,0.00061436417,0.00038009384],"about_ca_topic_score_codex":0.000025191566,"about_ca_topic_score_gemma":0.0000075012304,"teacher_disagreement_score":0.88980407,"about_ca_system_score_codex":0.00010274118,"about_ca_system_score_gemma":0.00013180761,"threshold_uncertainty_score":0.9877249},"labels":[],"label_agreement":null},{"id":"W2147664610","doi":"10.1109/icppw.2004.65","title":"On the optimization of multiservice internet backbones","year":2004,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Parallel Processing","topic":"Advanced Optical Network Technologies","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":"University of Ottawa","funders":"","keywords":"Computer science; The Internet; Linear programming; Mathematical optimization; Artificial neural network; Network planning and design; Service (business); Optimization problem; Backbone network; Network service; Hopfield network; Computer network; Distributed computing; Artificial intelligence; Algorithm; Mathematics","score_opus":0.026759507958213323,"score_gpt":0.24743373725973153,"score_spread":0.2206742293015182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147664610","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.79391384,0.00017711769,0.10415686,0.010508526,0.0005517905,0.000682702,0.0000125435445,0.00056543667,0.089431204],"genre_scores_gemma":[0.97548723,0.000052141917,0.024214732,0.00011134926,0.000022908389,0.000023197246,0.0000011392573,0.000018475352,0.00006882133],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991023,0.0000017986105,0.000277095,0.00015108775,0.0003315779,0.00013615968],"domain_scores_gemma":[0.99931973,0.000048477064,0.00017539143,0.000088859546,0.00035005278,0.000017496493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009537655,0.0001467295,0.00013930112,0.00006788698,0.00004272609,0.000052336618,0.00089051283,0.000070059534,0.000036844307],"category_scores_gemma":[0.00019748427,0.00009155278,0.00004946545,0.00018908946,0.0001431788,0.00021130442,0.00011814522,0.00023594662,0.0000048974716],"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.00004531009,0.000037564616,0.000079360274,0.00007091466,0.000025137773,1.2035447e-7,0.0001755647,0.7305443,0.0041762055,0.26335624,0.00007891821,0.0014103473],"study_design_scores_gemma":[0.0004451286,0.000073875875,0.00022264522,0.001312972,0.000013307859,0.00000396782,0.0005079381,0.8632002,0.04198612,0.09199838,0.000047100373,0.00018839473],"about_ca_topic_score_codex":0.0000043874957,"about_ca_topic_score_gemma":0.0000019137144,"teacher_disagreement_score":0.18157342,"about_ca_system_score_codex":0.00006957349,"about_ca_system_score_gemma":0.000018045674,"threshold_uncertainty_score":0.3733414},"labels":[],"label_agreement":null},{"id":"W2148245055","doi":"10.1109/icppw.2004.11","title":"A hierarchical micro-mobility management model with QoS capability","year":2004,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Parallel Processing","topic":"IPv6, Mobility, Handover, Networks, Security","field":"Engineering","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":"Dalhousie University","funders":"","keywords":"Handover; Computer science; Quality of service; Computer network; Mobility management; Scalability; Mobile QoS; Robustness (evolution); Distributed computing; Wireless; Load balancing (electrical power); Wireless network; Mobility model; Service (business); Service provider; Telecommunications","score_opus":0.019940722698480174,"score_gpt":0.24256288306016355,"score_spread":0.22262216036168336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148245055","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.9426484,0.00006810446,0.010740536,0.0011856543,0.00026729374,0.0006561149,0.000016444781,0.00023011774,0.044187322],"genre_scores_gemma":[0.9875596,0.000027139797,0.011925094,0.000118492884,0.000086555294,0.00010158926,0.0000034268805,0.000032206273,0.00014586015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979972,0.000005808764,0.00044477513,0.00047901247,0.00072231586,0.00035084417],"domain_scores_gemma":[0.9990603,0.000017247874,0.00016319565,0.0002055213,0.0004660785,0.000087660344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003767753,0.00030513253,0.00027866854,0.000090156376,0.000126811,0.00016357655,0.0010200582,0.00010686139,0.000024796198],"category_scores_gemma":[0.000035532757,0.00022883253,0.000103618775,0.00021831795,0.00029392535,0.00040949433,0.0002091543,0.0005030795,0.000005049303],"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.0019594978,0.0018196212,0.009010123,0.0035428954,0.00052811723,0.0000064928145,0.0043905317,0.7263923,0.026367528,0.21556783,0.00046679538,0.009948221],"study_design_scores_gemma":[0.0032054149,0.00016455584,0.007286702,0.0015363831,0.00012572992,0.000035374298,0.0006068381,0.7678954,0.020667527,0.19743346,0.00017835615,0.0008642557],"about_ca_topic_score_codex":0.0000140227285,"about_ca_topic_score_gemma":0.000020010686,"teacher_disagreement_score":0.044911224,"about_ca_system_score_codex":0.0003808595,"about_ca_system_score_gemma":0.0000927728,"threshold_uncertainty_score":0.933152},"labels":[],"label_agreement":null},{"id":"W2149265311","doi":"10.1109/icpp.2007.33","title":"Design, Implementation, and Evaluation of Trellis-SDP for File-Level Data Parallelism","year":2007,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Parallel Processing","topic":"Distributed and Parallel Computing Systems","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 Alberta","funders":"","keywords":"Computer science; Trellis (graph); Parallel computing; Parallelism (grammar); Data parallelism; Simple (philosophy); Programming paradigm; Overlay; Software; Programming language; Theoretical computer science; Distributed computing; Algorithm","score_opus":0.2670058010561064,"score_gpt":0.39662028461739623,"score_spread":0.12961448356128985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149265311","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.028201526,0.00014471581,0.9638709,0.001829872,0.0003429237,0.00093645306,0.00022019664,0.00004967351,0.0044037513],"genre_scores_gemma":[0.93699235,0.000008959307,0.06264072,0.00007630439,0.00007213787,0.00003236138,0.00006778687,0.000008623595,0.000100787955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778366,0.000018814153,0.0005941658,0.0004477849,0.0009370236,0.0002185405],"domain_scores_gemma":[0.99671525,0.0001751064,0.0008097576,0.00023339991,0.002017191,0.00004928315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003056432,0.0001637917,0.0002034942,0.00012411745,0.00014222544,0.00022174563,0.0022589685,0.00006165337,0.00002950322],"category_scores_gemma":[0.00022432364,0.00012882546,0.00004457877,0.00021479194,0.00007548354,0.0006807251,0.00041387873,0.00009837947,9.889861e-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.00063569256,0.00054253585,0.0038383543,0.0008768063,0.0004206427,7.6545325e-7,0.0065806587,0.00634393,0.023937967,0.47435203,0.038898826,0.4435718],"study_design_scores_gemma":[0.001627939,0.0001378231,0.0051095104,0.0005200178,0.000053623447,0.000015725785,0.0009538297,0.9503126,0.006022311,0.03388919,0.0010858534,0.00027159078],"about_ca_topic_score_codex":0.000025259376,"about_ca_topic_score_gemma":0.000007048282,"teacher_disagreement_score":0.94396865,"about_ca_system_score_codex":0.00005024065,"about_ca_system_score_gemma":0.00025172942,"threshold_uncertainty_score":0.52533495},"labels":[],"label_agreement":null},{"id":"W2159462167","doi":"10.1109/icpp.2004.22","title":"Architecture and implementation of chip multiprocessors: custom logic components and software for rapid prototyping","year":2004,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Parallel Processing","topic":"Parallel Computing and Optimization Techniques","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":"Queen's University","funders":"","keywords":"Computer science; Embedded system; Computer architecture; Executable; Programmable Array Logic; Rapid prototyping; Software prototyping; Software; Simple programmable logic device; Logic synthesis; Computer hardware; Logic family; Operating system; Logic gate; Software development; Engineering","score_opus":0.04113826213252978,"score_gpt":0.3106224465497966,"score_spread":0.2694841844172668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159462167","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.20946993,0.00022407087,0.78401357,0.0043465067,0.00007741837,0.0011503927,0.000009810586,0.00015562076,0.0005526849],"genre_scores_gemma":[0.7384673,0.000043385175,0.26126197,0.00012967201,0.000016807335,0.00006168287,0.0000022145534,0.000006976195,0.0000099958415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998893,0.0000057045936,0.0003296377,0.00032386882,0.00029618703,0.0001515554],"domain_scores_gemma":[0.9985918,0.000033490796,0.00049880974,0.00007251494,0.0007650859,0.000038314396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024944564,0.00015347087,0.00018237534,0.00013937184,0.00016047225,0.00016484607,0.0007055011,0.000054100983,0.0000015887331],"category_scores_gemma":[0.0001285199,0.000117459655,0.000038526166,0.00016429431,0.000107595995,0.00037671524,0.00023795117,0.0001204565,1.1935288e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004653596,0.00038487717,0.009725885,0.0024042912,0.00015551943,5.6015625e-7,0.01080838,0.005531649,0.050571453,0.5645659,0.00008974761,0.3552964],"study_design_scores_gemma":[0.005741871,0.0008855831,0.01521234,0.0035374633,0.000050202507,0.00007254737,0.0010107394,0.21153209,0.16605978,0.59464514,0.0003485597,0.0009036834],"about_ca_topic_score_codex":0.000018784382,"about_ca_topic_score_gemma":0.0000016223196,"teacher_disagreement_score":0.52899736,"about_ca_system_score_codex":0.000029518953,"about_ca_system_score_gemma":0.00009043007,"threshold_uncertainty_score":0.47898656},"labels":[],"label_agreement":null}]}