{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038314227,0.0001947976,0.565075,0.0002786318,0.00027594165,0.0013055867,0.0024477325,0.3748023,0.017305791],"genre_scores_gemma":[0.24595745,0.00068811775,0.6148055,0.000748957,0.00016800656,0.001544931,0.015623753,0.048146065,0.07231723],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990326,0.00007418226,0.00007328844,0.00029889436,0.00035996514,0.00016108788],"domain_scores_gemma":[0.998059,0.00036362128,0.0001485221,0.0005919393,0.00048627795,0.00035075325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018084913,0.0012110936,0.00061245885,0.000708911,0.0006128571,0.001458659,0.0035836042,0.0005606918,0.009758413],"category_scores_gemma":[0.0028101692,0.0010036898,0.0007893802,0.00047283212,0.0005104503,0.0017805183,0.0014230887,0.0014286926,0.006821515],"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.0026051656,0.0013600454,0.0074741817,0.00076501677,0.00031527676,0.0009906173,0.0011611665,0.019385692,0.2512665,0.0119953295,0.22366223,0.47901875],"study_design_scores_gemma":[0.0013811,0.0009229615,0.010249184,0.00010123214,0.00014536711,0.0011134751,0.00033919307,0.3132654,0.32355228,0.0063543417,0.34212792,0.00044750265],"about_ca_topic_score_codex":0.008988631,"about_ca_topic_score_gemma":0.008631043,"teacher_disagreement_score":0.009758413,"about_ca_system_score_codex":0.0011262465,"about_ca_system_score_gemma":0.002171181,"threshold_uncertainty_score":0.032645166},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6313796,0.0020260378,0.3549829,0.0020430172,0.00032162247,0.00012495545,0.00017970723,0.00036926847,0.008572814],"genre_scores_gemma":[0.98466694,0.0002140289,0.013369914,0.000084656735,0.00016584044,0.000037713624,0.000048938866,0.000032599943,0.0013793736],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946837,0.002511353,0.00024361929,0.00050969963,0.0012973706,0.0007542696],"domain_scores_gemma":[0.9585977,0.031489782,0.0037399181,0.0017103188,0.0034333135,0.0010288336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009454818,0.00045024755,0.00091069273,0.0017004627,0.0019269619,0.0031562978,0.0016173549,0.0014413876,0.0010231594],"category_scores_gemma":[0.039023813,0.0004669827,0.0003141659,0.0015005349,0.0023379659,0.0036580977,0.0011596024,0.00089410646,0.00023819898],"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.0020794393,0.0005091892,0.03875103,0.00011957459,0.00008003107,0.0003504594,0.00082674203,0.55235535,0.0068201507,0.28416267,0.002867365,0.111078024],"study_design_scores_gemma":[0.000022324062,0.000042962773,0.00235325,0.000010072161,0.000010577976,0.00006493263,0.00006747812,0.9030054,0.0011152589,0.09272044,0.0005647455,0.000022531276],"about_ca_topic_score_codex":0.00532809,"about_ca_topic_score_gemma":0.0032284956,"teacher_disagreement_score":0.009454818,"about_ca_system_score_codex":0.0039123385,"about_ca_system_score_gemma":0.0019694224,"threshold_uncertainty_score":0.050002456},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007379827,0.002420817,0.98568404,0.00023993876,0.00018164217,0.00012523064,0.000020066234,0.0011889788,0.0027593984],"genre_scores_gemma":[0.4181948,0.0031161348,0.571088,0.00039339243,0.0005366724,0.0006871609,0.00020026347,0.000207875,0.0055756266],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984308,0.0004573261,0.000105809275,0.0001626937,0.00071510446,0.00012830793],"domain_scores_gemma":[0.9972255,0.001087322,0.00029003216,0.0006240938,0.0006504412,0.00012261496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026782854,0.0009038372,0.0009546962,0.0010244484,0.0010923701,0.0018950766,0.002276555,0.00084789697,0.0012686031],"category_scores_gemma":[0.004652744,0.00053721364,0.000446386,0.000861297,0.0008197301,0.0030291798,0.0016175268,0.0018603464,0.0005262152],"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.0003271058,0.0003990747,0.0016190117,0.0009562241,0.00043088995,0.0009785111,0.0009474987,0.23088935,0.099336565,0.27335033,0.012784,0.3779813],"study_design_scores_gemma":[0.000060550687,0.00020397676,0.0004634189,0.000068318834,0.00016539411,0.00044543252,0.0001566032,0.8877776,0.02595982,0.055520505,0.029095804,0.00008255353],"about_ca_topic_score_codex":0.0005021653,"about_ca_topic_score_gemma":0.00076659076,"teacher_disagreement_score":0.0026782854,"about_ca_system_score_codex":0.0007561359,"about_ca_system_score_gemma":0.00068533263,"threshold_uncertainty_score":0.014164329},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024928658,0.000118937896,0.7694215,0.00019112992,0.000102890066,0.0004813598,0.001960702,0.21764833,0.0075821793],"genre_scores_gemma":[0.06943878,0.00036993806,0.8284396,0.0011939396,0.00018113668,0.0025416163,0.010750633,0.061782278,0.025302019],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976891,0.0004331418,0.00031452754,0.000476359,0.0007982847,0.0002885128],"domain_scores_gemma":[0.996005,0.0018150388,0.0002310786,0.0007230268,0.0008587224,0.00036716438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003396861,0.0021156298,0.0011723076,0.00091990555,0.00073872035,0.0027089317,0.0046855435,0.0018291518,0.041433856],"category_scores_gemma":[0.009239641,0.0014840942,0.001651728,0.0010620098,0.0013025891,0.0038340623,0.0031636218,0.0044015753,0.020924494],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.0044848877,0.00063111546,0.0036425178,0.0015098588,0.00037725666,0.0010652273,0.0012661119,0.025543049,0.044830173,0.06636346,0.4690053,0.38128093],"study_design_scores_gemma":[0.0016144605,0.0004843012,0.0016599684,0.00020569358,0.000105189836,0.0009978573,0.000101264806,0.44854218,0.11149687,0.054337457,0.38008168,0.0003730602],"about_ca_topic_score_codex":0.003227073,"about_ca_topic_score_gemma":0.0031232343,"teacher_disagreement_score":0.041433856,"about_ca_system_score_codex":0.0013761157,"about_ca_system_score_gemma":0.0020796778,"threshold_uncertainty_score":0.13861},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55189484,0.00036965075,0.36109808,0.0026496924,0.00083051407,0.0043547153,0.002373483,0.007699434,0.06872954],"genre_scores_gemma":[0.75817186,0.00031571934,0.18473308,0.00031161882,0.00013026828,0.0017727362,0.0024498473,0.00054636435,0.051568598],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988506,0.00026975753,0.000033719574,0.00015058921,0.0005597,0.00013554664],"domain_scores_gemma":[0.99712986,0.00037790203,0.000185,0.00063270534,0.0010996386,0.0005749764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035279517,0.00047059738,0.000445803,0.0003797741,0.0010925594,0.000869645,0.0011308651,0.00078573625,0.0064812894],"category_scores_gemma":[0.0016811219,0.00019635967,0.00025759323,0.00022440395,0.00096246693,0.0014491555,0.0012214018,0.0012939686,0.0011523855],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026437547,0.0032660558,0.006427677,0.00053926604,0.00010162209,0.0015380115,0.00075847923,0.041595574,0.6691065,0.084376685,0.046812307,0.14283417],"study_design_scores_gemma":[0.0009899713,0.013702617,0.0034140968,0.000061600964,0.000036897025,0.0007232901,0.00028734203,0.06983956,0.7696782,0.0054551135,0.1357411,0.00007024164],"about_ca_topic_score_codex":0.0006110333,"about_ca_topic_score_gemma":0.0010959791,"teacher_disagreement_score":0.0064812894,"about_ca_system_score_codex":0.0009901815,"about_ca_system_score_gemma":0.0017710085,"threshold_uncertainty_score":0.021682084},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027730703,0.0004586766,0.96783864,0.00036624464,0.00003061157,0.000052970743,0.00004940643,0.000071069444,0.0034017283],"genre_scores_gemma":[0.7361188,0.00071080873,0.25384292,0.00012334088,0.00007771418,0.00035170207,0.0001812131,0.00013944825,0.008454045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992269,0.00029263922,0.00002162107,0.000106001164,0.000265647,0.000087065295],"domain_scores_gemma":[0.9992342,0.00046186073,0.00008004682,0.000060669983,0.00010940518,0.0000538701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001033877,0.00095096603,0.00067276944,0.00069160777,0.0004504942,0.00076217187,0.0009627994,0.0010201479,0.0022887527],"category_scores_gemma":[0.0026516067,0.00032263112,0.00052455213,0.0010089898,0.00073494366,0.0017767443,0.0013542352,0.00080185203,0.0002531706],"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.00004357372,0.00003418999,0.00019669843,0.0000586518,0.000020800819,0.00003834221,0.00004607269,0.93374974,0.0010401064,0.039947394,0.0011837306,0.023640763],"study_design_scores_gemma":[0.000009038893,0.000033979723,0.00008509514,0.00000620614,0.000005543764,0.00001593055,0.000016949833,0.9731416,0.00043544517,0.025380908,0.00086489995,0.000004484333],"about_ca_topic_score_codex":0.002398266,"about_ca_topic_score_gemma":0.001684759,"teacher_disagreement_score":0.002398266,"about_ca_system_score_codex":0.0012260217,"about_ca_system_score_gemma":0.0008084363,"threshold_uncertainty_score":0.008895457},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012582993,0.00083518866,0.9407813,0.00085856154,0.0005087789,0.0003871793,0.0005722942,0.006360319,0.03711341],"genre_scores_gemma":[0.37495187,0.0009911719,0.56806463,0.0010661134,0.00020052242,0.00090662466,0.0030582773,0.0009092127,0.04985156],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995246,0.00008228672,0.000027970438,0.00008839357,0.00017674391,0.000100037316],"domain_scores_gemma":[0.9994981,0.00013517262,0.000035772668,0.00014163862,0.00014491551,0.000044469263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007217829,0.0007518923,0.0005405845,0.0009484744,0.0007485838,0.001415994,0.0022145482,0.00093282573,0.014062213],"category_scores_gemma":[0.002402526,0.0002873572,0.0005114653,0.0009552162,0.0005684502,0.001901205,0.0020092556,0.0013938693,0.0036926796],"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.0006148807,0.00019753183,0.0013177904,0.00031475586,0.00007036776,0.00020084773,0.00011258224,0.2256255,0.009443739,0.09566625,0.07492646,0.5915093],"study_design_scores_gemma":[0.00018785207,0.0002181763,0.00038657573,0.000057998943,0.000036592523,0.00040969628,0.00007450074,0.85330945,0.012215639,0.050969575,0.08209309,0.000040734212],"about_ca_topic_score_codex":0.0007555363,"about_ca_topic_score_gemma":0.0010870803,"teacher_disagreement_score":0.014062213,"about_ca_system_score_codex":0.000637105,"about_ca_system_score_gemma":0.0016736382,"threshold_uncertainty_score":0.047042847},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017299174,0.0000736628,0.987978,0.00016797095,0.00010140243,0.00012925513,0.0002516505,0.008450981,0.0011170986],"genre_scores_gemma":[0.043527007,0.000120463796,0.9478019,0.00030422528,0.00008194831,0.00038240146,0.0009837098,0.0024152952,0.0043830713],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9904703,0.0023930322,0.0015948405,0.0019616932,0.0028685743,0.000711542],"domain_scores_gemma":[0.9766183,0.0047731414,0.0013987215,0.011981248,0.0046408055,0.0005878232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009803663,0.0014679212,0.0016447032,0.0049137995,0.0022351514,0.0052766693,0.0049090195,0.0028425555,0.0140637],"category_scores_gemma":[0.025283147,0.0013091635,0.0013995884,0.0034730202,0.0027268531,0.010663079,0.0072773728,0.0045110644,0.007342687],"study_design_candidate":"not_applicable","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.001152774,0.0002673131,0.0025445006,0.0007192007,0.0000837965,0.0005241528,0.0018632022,0.008847944,0.05371142,0.30326763,0.03741012,0.58960795],"study_design_scores_gemma":[0.00027392016,0.0005034337,0.0010098426,0.00043373724,0.00019761967,0.0016640744,0.00060724735,0.16472563,0.24874887,0.24795708,0.33334112,0.0005374447],"about_ca_topic_score_codex":0.0016322993,"about_ca_topic_score_gemma":0.0013241015,"teacher_disagreement_score":0.0140637,"about_ca_system_score_codex":0.0018585746,"about_ca_system_score_gemma":0.0029980638,"threshold_uncertainty_score":0.0518474},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.088914126,0.0014366821,0.9038684,0.00028348065,0.00023388036,0.00019252991,0.00008414122,0.0011404034,0.0038463704],"genre_scores_gemma":[0.69537926,0.00077262503,0.29957664,0.00019795341,0.000082913844,0.00013233053,0.00016898462,0.00006448217,0.0036247643],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980503,0.000039119663,0.000013724032,0.000038014812,0.00007254221,0.00003161111],"domain_scores_gemma":[0.9997023,0.000052950978,0.000040682877,0.000092007234,0.000081505576,0.000030627354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027077124,0.00033781308,0.00031134192,0.0006364869,0.00050996983,0.00028621647,0.0010050097,0.00038965233,0.0011036394],"category_scores_gemma":[0.00049807417,0.0001490899,0.00026805952,0.00041443267,0.0003692577,0.0008098045,0.0005184238,0.00042576948,0.00020955596],"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.00044268032,0.00019737902,0.0009271379,0.0003545741,0.00008445503,0.00029352898,0.00023338116,0.13589005,0.17353997,0.080035746,0.0047774427,0.60322374],"study_design_scores_gemma":[0.00010219453,0.0008581941,0.00081880274,0.000050165065,0.00008969274,0.000785773,0.00006547377,0.8673139,0.06251306,0.02827815,0.039008845,0.00011577133],"about_ca_topic_score_codex":0.0009814089,"about_ca_topic_score_gemma":0.0013614097,"teacher_disagreement_score":0.0011036394,"about_ca_system_score_codex":0.00043450994,"about_ca_system_score_gemma":0.00047793673,"threshold_uncertainty_score":0.003692031},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019968553,0.00007330015,0.9967604,0.000104347666,0.000035725512,0.000075266245,0.000029900155,0.0003034066,0.0006207384],"genre_scores_gemma":[0.06621351,0.00017808711,0.9310393,0.000088273424,0.000037065267,0.0004101568,0.00020931286,0.0001226934,0.0017016416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985183,0.0005139661,0.00011318124,0.00023024809,0.00048208135,0.00014223917],"domain_scores_gemma":[0.998606,0.0007262397,0.00009138745,0.00024054114,0.00026613494,0.000069627815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021578788,0.0011333384,0.0010088898,0.000846331,0.0011466427,0.0013511851,0.0017926763,0.00093240454,0.003091868],"category_scores_gemma":[0.0031428253,0.00061286293,0.0011888512,0.0015224033,0.00095635175,0.0018881434,0.0017642775,0.0013521172,0.001058993],"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.0006075943,0.00027303165,0.0007908657,0.00044921864,0.000090391084,0.00020539423,0.00034451525,0.5150895,0.010270658,0.20244314,0.007610931,0.26182467],"study_design_scores_gemma":[0.00014468312,0.00005142454,0.00008364063,0.000010009924,0.00001141534,0.00004351983,0.000029132607,0.9424729,0.0025385248,0.0501205,0.004477183,0.000017190634],"about_ca_topic_score_codex":0.004412633,"about_ca_topic_score_gemma":0.0034912392,"teacher_disagreement_score":0.004412633,"about_ca_system_score_codex":0.0013711002,"about_ca_system_score_gemma":0.00288975,"threshold_uncertainty_score":0.011412084},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049610574,0.00006814481,0.9147135,0.0001225955,0.00003702581,0.00017863537,0.00014164465,0.033724003,0.0014038316],"genre_scores_gemma":[0.40591583,0.00010969113,0.5879166,0.00009728648,0.000032269345,0.00030528568,0.0009510496,0.0026519508,0.0020200808],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99809057,0.0004813012,0.0001407917,0.000377653,0.00075395696,0.00015574385],"domain_scores_gemma":[0.99452364,0.0018867223,0.00042889334,0.0016409317,0.001347693,0.00017204633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014368178,0.0012319924,0.00071559305,0.0010695144,0.0005727867,0.0010952976,0.0021120934,0.0005230697,0.002128895],"category_scores_gemma":[0.0077782543,0.00055006635,0.00053157855,0.00074051163,0.0007521255,0.0016966066,0.0011312546,0.0011819268,0.0007493283],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009965806,0.0007558304,0.0052489145,0.0003665439,0.000118124226,0.0002565506,0.0007024705,0.1225866,0.13299285,0.010257563,0.0077499654,0.71796805],"study_design_scores_gemma":[0.000092350616,0.00014091622,0.0007563912,0.000014782736,0.000021932641,0.000081530234,0.000067088215,0.87337154,0.112872474,0.008419332,0.0041264193,0.000035174766],"about_ca_topic_score_codex":0.004061048,"about_ca_topic_score_gemma":0.003980175,"teacher_disagreement_score":0.004061048,"about_ca_system_score_codex":0.0006797619,"about_ca_system_score_gemma":0.0018235295,"threshold_uncertainty_score":0.00807482},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49055144,0.00028447254,0.48190656,0.00030484208,0.0000796112,0.00016971717,0.0001978195,0.015568841,0.01093684],"genre_scores_gemma":[0.74609774,0.00009481285,0.24668913,0.00007736495,0.000016888383,0.00008856901,0.00037489051,0.0002643273,0.0062962673],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994443,0.00013736304,0.000026561445,0.00010124083,0.00020867285,0.00008185263],"domain_scores_gemma":[0.99911183,0.0002201292,0.00007318668,0.00027986622,0.000253962,0.00006110593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006505251,0.00052996876,0.00042796155,0.00045210682,0.0006821729,0.0007837823,0.0014419897,0.00047819765,0.0021561813],"category_scores_gemma":[0.0012323122,0.0003144011,0.0002676305,0.0005270555,0.00044465813,0.0011138348,0.0007556461,0.00050577853,0.00048438617],"study_design_candidate":"not_applicable","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.002973,0.0007406981,0.010967038,0.00049374264,0.0002094783,0.00039534402,0.0009974309,0.37194914,0.24876328,0.01403424,0.011224089,0.3372526],"study_design_scores_gemma":[0.00008890085,0.0002716638,0.0011409714,0.00000845999,0.000027302542,0.00006093586,0.00009554658,0.90681094,0.086689994,0.0010462556,0.0037320945,0.000026970769],"about_ca_topic_score_codex":0.004765447,"about_ca_topic_score_gemma":0.009700581,"teacher_disagreement_score":0.004765447,"about_ca_system_score_codex":0.0008054747,"about_ca_system_score_gemma":0.0009848131,"threshold_uncertainty_score":0.00947541},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014975076,0.00090231455,0.9757953,0.00032831187,0.00004207017,0.000048246384,0.000044553766,0.00007377907,0.007790338],"genre_scores_gemma":[0.576397,0.0034769932,0.4088364,0.00018941297,0.00013214028,0.00031139253,0.00014578455,0.0001572877,0.010353652],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996824,0.00013288196,0.00000765814,0.000045024797,0.00009973643,0.00003236082],"domain_scores_gemma":[0.99962854,0.00022857315,0.00004282464,0.000018685376,0.000058589798,0.000022721706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009878366,0.0009709533,0.0007392488,0.0007454246,0.00041394008,0.00084900414,0.00065673824,0.0009293367,0.003321187],"category_scores_gemma":[0.0016447072,0.00038494507,0.00046909478,0.000901272,0.00079934817,0.0012523631,0.0007977213,0.00073716545,0.0003534238],"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.0000148420795,0.000019301147,0.000090396476,0.00005395792,0.0000102281165,0.00002535008,0.000012018061,0.9494119,0.00087081094,0.035862785,0.00041967744,0.013208666],"study_design_scores_gemma":[0.0000057604207,0.00001592455,0.000034171495,0.000005974834,0.0000026776415,0.000008477888,0.0000054194347,0.98509556,0.00022416208,0.013821636,0.0007778942,0.00000241112],"about_ca_topic_score_codex":0.0018042052,"about_ca_topic_score_gemma":0.0018360007,"teacher_disagreement_score":0.003321187,"about_ca_system_score_codex":0.0011175057,"about_ca_system_score_gemma":0.0011120479,"threshold_uncertainty_score":0.011110544},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04285036,0.000903715,0.9328357,0.0013302066,0.00015313397,0.00012444919,0.00030065066,0.0005540903,0.020947617],"genre_scores_gemma":[0.8193081,0.0013158715,0.1587993,0.0002944656,0.00017274129,0.00043628903,0.00037459692,0.00007708402,0.019221468],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996582,0.00007963601,0.000021964977,0.000068532405,0.000110901165,0.000060729428],"domain_scores_gemma":[0.99963474,0.000098486234,0.00006261999,0.000058540285,0.000089398054,0.000056327826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046759652,0.0003535407,0.00029084855,0.00033817667,0.00046927072,0.0009784548,0.0012864065,0.00073357776,0.0023343184],"category_scores_gemma":[0.00075327855,0.00024067522,0.0004701015,0.0004778336,0.00055746146,0.0018182955,0.00070532423,0.00080925296,0.0007847194],"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.00007226742,0.00009964604,0.0010194863,0.00010192779,0.000035437475,0.00020979716,0.0002855761,0.52890444,0.008013958,0.42421928,0.00449349,0.032544713],"study_design_scores_gemma":[0.00001484098,0.00004075947,0.00017466424,0.000008142197,0.0000136053495,0.00005184677,0.000026731885,0.9623348,0.00041032952,0.031130183,0.0057805288,0.000013545252],"about_ca_topic_score_codex":0.004676413,"about_ca_topic_score_gemma":0.004185337,"teacher_disagreement_score":0.004676413,"about_ca_system_score_codex":0.0010758769,"about_ca_system_score_gemma":0.0010276013,"threshold_uncertainty_score":0.009298384},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079930186,0.0004027613,0.8293193,0.00058417843,0.00029196238,0.0018079375,0.00060590816,0.07192371,0.015134052],"genre_scores_gemma":[0.26988974,0.00029050338,0.7092908,0.00041011168,0.00007587367,0.0010948944,0.0018233499,0.006796397,0.010328393],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99648225,0.0005997327,0.00028428336,0.00044790385,0.0017418746,0.0004440471],"domain_scores_gemma":[0.9938898,0.0014171681,0.0003211321,0.0013651302,0.002399055,0.0006078205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034594021,0.00093313016,0.0006674821,0.0006910273,0.00074843585,0.00179161,0.0052233036,0.00096071756,0.005186553],"category_scores_gemma":[0.007906387,0.0008718872,0.00082969,0.0010462896,0.001292015,0.0025442578,0.0015504379,0.0025774608,0.0019697759],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004197148,0.0023350543,0.01240097,0.001862109,0.0004781279,0.00210669,0.0019629584,0.08222102,0.2026505,0.050114185,0.08096362,0.55870765],"study_design_scores_gemma":[0.0012079932,0.001576174,0.003265941,0.00010916124,0.0001534125,0.0006739766,0.00022951017,0.5967027,0.31079018,0.0075932215,0.077515386,0.00018223697],"about_ca_topic_score_codex":0.0047124834,"about_ca_topic_score_gemma":0.0033284682,"teacher_disagreement_score":0.0052233036,"about_ca_system_score_codex":0.0016026527,"about_ca_system_score_gemma":0.0031970476,"threshold_uncertainty_score":0.018295348},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009929917,0.00032729484,0.9764454,0.000094688876,0.00006596161,0.00021005503,0.00005054169,0.005655094,0.0072210594],"genre_scores_gemma":[0.122189164,0.0005811932,0.86973006,0.00011800394,0.00003212962,0.00039751144,0.00034077096,0.00095226406,0.0056589576],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990433,0.00018697327,0.00006884899,0.00008983361,0.0005319758,0.00007904981],"domain_scores_gemma":[0.9987413,0.00028103875,0.0000946652,0.00047078964,0.00035501228,0.000057143232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009675933,0.0006260575,0.00034214385,0.00062119507,0.00032955117,0.00120145,0.0018757364,0.0006115267,0.004071286],"category_scores_gemma":[0.0026050752,0.00054885657,0.00048323878,0.00045763518,0.0004932085,0.0012105809,0.0007048871,0.0011002875,0.0014317967],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027586415,0.00022963743,0.0015856881,0.00086751836,0.00011486379,0.0005837349,0.00062028493,0.081021704,0.22012496,0.11735777,0.013934566,0.5632835],"study_design_scores_gemma":[0.00021528822,0.0007351442,0.0021589764,0.00018582561,0.00014403669,0.0014430514,0.00010045881,0.43109098,0.2609394,0.029444389,0.27341163,0.0001309673],"about_ca_topic_score_codex":0.000761979,"about_ca_topic_score_gemma":0.0008029684,"teacher_disagreement_score":0.004071286,"about_ca_system_score_codex":0.00053677475,"about_ca_system_score_gemma":0.0008810288,"threshold_uncertainty_score":0.01361984},"labels":[],"label_agreement":null}]}