{"meta":{"query_hash":"69ae6be6d940","filters":{"venue":"Parallel and Distributed Computing and Networks"},"cohort_total":17,"direct_labels_cover":0,"predictions_cover":17,"exported":17,"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/69ae6be6d940","api":"https://metacan.xera.ac/api/v1/cohort?venue=Parallel+and+Distributed+Computing+and+Networks"},"results":[{"id":"W126718644","doi":"10.2316/p.2010.676-050","title":"An Experimental Model of Relay Deployment Planning Tool for a Wireless Sensor Network System to Monitor Civil Engineering Structures","year":2010,"lang":"en","type":"article","venue":"Parallel and Distributed Computing and Networks","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Software deployment; Default gateway; Wireless sensor network; Computer science; Relay; Reliability (semiconductor); Wireless; Key distribution in wireless sensor networks; Wireless network; Computer network; Distributed computing; Real-time computing; Telecommunications","score_opus":0.009502822532146127,"score_gpt":0.23839230228129166,"score_spread":0.22888947974914553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W126718644","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.13485368,0.0001518776,0.83526284,0.0010339023,0.00012588478,0.00065566925,0.001044794,0.0032622565,0.02360912],"genre_scores_gemma":[0.83121437,0.00020120574,0.15715942,0.00009412308,0.000027483144,0.0009963647,0.000485503,0.00013224433,0.009689358],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941325,0.00015075481,0.000038041035,0.00015797523,0.00016967545,0.00007037055],"domain_scores_gemma":[0.9988613,0.00059830246,0.00009390083,0.00020077007,0.00017642796,0.00006917761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007394549,0.00076468533,0.00042153551,0.00041366613,0.0006373479,0.0011934851,0.0023089359,0.0011410867,0.01016317],"category_scores_gemma":[0.001823138,0.00039225767,0.00047024086,0.00039224868,0.0013059207,0.0017491041,0.00085993,0.0009917119,0.0006808479],"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.00023342254,0.00018014736,0.0006437233,0.00011861757,0.000018658715,0.00026188022,0.0001359703,0.9297226,0.009856126,0.04836704,0.00097346486,0.009488225],"study_design_scores_gemma":[0.000054380693,0.00010492265,0.00011251309,0.000007046696,0.000009505498,0.000021039534,0.000019117839,0.9911924,0.002637881,0.0041633584,0.00166907,0.000008824404],"about_ca_topic_score_codex":0.0067132236,"about_ca_topic_score_gemma":0.0051773074,"teacher_disagreement_score":0.01016317,"about_ca_system_score_codex":0.0014986707,"about_ca_system_score_gemma":0.0014943399,"threshold_uncertainty_score":0.033999145},"labels":[],"label_agreement":null},{"id":"W1455550877","doi":"10.2316/p.2010.676-052","title":"A Wait-Free Dynamic Storage Allocator by Adopting the Helping Queue Pattern","year":2010,"lang":"en","type":"article","venue":"Parallel and Distributed Computing and Networks","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Allocator; Queue; Operating system; Computer network","score_opus":0.004837392620360122,"score_gpt":0.21460570756073702,"score_spread":0.2097683149403769,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1455550877","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.021735199,0.00028076395,0.9661651,0.00028800048,0.00020943611,0.00023484201,0.00015293853,0.0068223528,0.004111336],"genre_scores_gemma":[0.21185209,0.00019243338,0.7747242,0.0003621864,0.00008903457,0.00041883785,0.0002960026,0.00078587193,0.011279335],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99929833,0.00009390232,0.00009424441,0.00016719651,0.00022265025,0.00012364068],"domain_scores_gemma":[0.998613,0.00018747505,0.0001116621,0.00053851446,0.00041051343,0.00013887657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011411443,0.00048750523,0.0005161114,0.0008357135,0.00094104337,0.0015130962,0.0034837157,0.00075743656,0.0046484005],"category_scores_gemma":[0.0023093687,0.00045698823,0.00049701467,0.0008983322,0.0009501259,0.0019147942,0.0018698259,0.0010064968,0.001969281],"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.0015179488,0.00045511135,0.0049693296,0.000708071,0.00015917465,0.00042908438,0.0011736989,0.041970428,0.18275239,0.21335448,0.026981723,0.52552855],"study_design_scores_gemma":[0.00070566894,0.0008605622,0.0014294895,0.00011570179,0.000262998,0.0009818879,0.00023596387,0.6176804,0.14708363,0.06675783,0.16366208,0.00022391068],"about_ca_topic_score_codex":0.0029204683,"about_ca_topic_score_gemma":0.004119199,"teacher_disagreement_score":0.0046484005,"about_ca_system_score_codex":0.0008189237,"about_ca_system_score_gemma":0.002430528,"threshold_uncertainty_score":0.015550435},"labels":[],"label_agreement":null},{"id":"W2111977021","doi":"10.2316/p.2010.676-039","title":"Task Execution Availability Prediction in the Enterprise Desktop Grid","year":2010,"lang":"en","type":"article","venue":"Parallel and Distributed Computing and Networks","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Distributed computing; Grid; Grid computing; Bayesian network; Task (project management); Artificial intelligence","score_opus":0.007695744150670312,"score_gpt":0.22246649868464108,"score_spread":0.21477075453397076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111977021","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.92455536,0.00012948726,0.071903735,0.00013527044,0.000022126564,0.000024604666,0.00024148556,0.0010152969,0.0019726297],"genre_scores_gemma":[0.9919985,0.00003535433,0.007441251,0.0000066867383,0.0000025840716,0.000008159531,0.00013457175,0.000013551632,0.0003593794],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995585,0.0001003303,0.000027226566,0.000118711694,0.0001271987,0.000068157904],"domain_scores_gemma":[0.99843293,0.00075601455,0.00016469884,0.0001853508,0.00033780956,0.0001232171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070550543,0.00033504717,0.00044462382,0.0005449301,0.0003349121,0.0004965104,0.00049213634,0.00038102502,0.00057703536],"category_scores_gemma":[0.0032821856,0.00019674425,0.00023661472,0.0007789521,0.000264473,0.0006401745,0.0004073047,0.00037524002,0.00017186873],"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.0006485139,0.00012249028,0.05378362,0.000046204717,0.000044942863,0.00029128575,0.00015099603,0.87525356,0.006144801,0.001360204,0.0012582967,0.060895093],"study_design_scores_gemma":[0.0000042210104,0.000018363002,0.0044290163,0.0000012329365,0.000004169213,0.000015048015,0.000020911273,0.9935737,0.0013639844,0.00044169457,0.00012291058,0.0000046309724],"about_ca_topic_score_codex":0.032717645,"about_ca_topic_score_gemma":0.01505359,"teacher_disagreement_score":0.032717645,"about_ca_system_score_codex":0.00077260373,"about_ca_system_score_gemma":0.0007486009,"threshold_uncertainty_score":0.06505442},"labels":[],"label_agreement":null},{"id":"W2316020023","doi":"10.2316/journal.211.2012.1.211-1047","title":"MARKET-BASED DISTRIBUTED OPTIMIZATION APPROACHES FOR THREE CLASSES OF RESOURCE ALLOCATION PROBLEMS","year":2012,"lang":"en","type":"article","venue":"Parallel and Distributed Computing and Networks","topic":"Advanced Research in Systems and Signal Processing","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Resource allocation; Resource (disambiguation); Distributed computing; Operations research; Computer network","score_opus":0.032512434201298956,"score_gpt":0.24403398256872483,"score_spread":0.21152154836742587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2316020023","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.0069881226,0.00069563364,0.98115003,0.0006847645,0.00010701595,0.000099078396,0.0000579575,0.00008069003,0.010136653],"genre_scores_gemma":[0.5928339,0.002255067,0.37242293,0.0005946872,0.0007670493,0.0010413864,0.00027582282,0.00030805022,0.029501084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862826,0.00056247425,0.00006170008,0.00019457415,0.00037062826,0.00018248626],"domain_scores_gemma":[0.99735177,0.0019207248,0.00016016224,0.00015323711,0.00028519894,0.00012892774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003658861,0.0014860174,0.0022485543,0.0011345602,0.00095709285,0.002725786,0.004470918,0.0030591164,0.0077436385],"category_scores_gemma":[0.0062493975,0.00081785995,0.0017894522,0.0019667167,0.0016013347,0.0033980894,0.002829898,0.0023812288,0.0005612634],"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.0001000799,0.00016793924,0.00023941672,0.00022766646,0.00011971269,0.00010450542,0.000109404464,0.6224495,0.0006336357,0.34263006,0.004063766,0.029154206],"study_design_scores_gemma":[0.000039553866,0.000023546476,0.0000667822,0.00001061818,0.000018015495,0.000022353925,0.000017677692,0.9384092,0.000100188976,0.060283806,0.0009996846,0.000008514958],"about_ca_topic_score_codex":0.0024888641,"about_ca_topic_score_gemma":0.0030758276,"teacher_disagreement_score":0.0077436385,"about_ca_system_score_codex":0.0016922704,"about_ca_system_score_gemma":0.0016218086,"threshold_uncertainty_score":0.025905013},"labels":[],"label_agreement":null},{"id":"W2316535507","doi":"10.2316/p.2010.676-055","title":"Is Iterative Deepening Search a Complete and Optimal Algorithm for Java PathFinder?","year":2010,"lang":"en","type":"article","venue":"Parallel and Distributed Computing and Networks","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Pathfinder; Computer science; Java; Algorithm; Iterative method; Parallel computing; Operating system; World Wide Web","score_opus":0.024177024768679133,"score_gpt":0.2810436833405228,"score_spread":0.2568666585718437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2316535507","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.01669259,0.00023320406,0.97705245,0.00046042446,0.000050785966,0.000047898695,0.00010824414,0.0030273644,0.0023270699],"genre_scores_gemma":[0.1471528,0.00013724061,0.848783,0.0002252415,0.00003872718,0.00010967466,0.00032826563,0.00081896636,0.0024061338],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980755,0.0005417669,0.00013016809,0.00050641893,0.00044798126,0.00029822555],"domain_scores_gemma":[0.9963547,0.001730038,0.00020456543,0.0011277945,0.0004768047,0.0001061728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019641276,0.0008246023,0.0014911316,0.0011277082,0.00086541596,0.0015759374,0.0028219393,0.0017780311,0.007878045],"category_scores_gemma":[0.011653731,0.00070574216,0.0010525009,0.0012613528,0.0014049086,0.004860973,0.0020233218,0.001719572,0.001683978],"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.0007326109,0.00021875027,0.0021176422,0.00031257886,0.00013643765,0.00007634694,0.00022568126,0.10022771,0.008054541,0.06434811,0.011173689,0.8123759],"study_design_scores_gemma":[0.00016756867,0.00013131232,0.00066094485,0.000058332822,0.00008478436,0.00016008157,0.00015252412,0.7948532,0.00939113,0.18645531,0.0078287795,0.000056059565],"about_ca_topic_score_codex":0.0039648833,"about_ca_topic_score_gemma":0.0059929146,"teacher_disagreement_score":0.007878045,"about_ca_system_score_codex":0.00080691674,"about_ca_system_score_gemma":0.002503057,"threshold_uncertainty_score":0.02635467},"labels":[],"label_agreement":null},{"id":"W2318920610","doi":"10.2316/p.2010.676-028","title":"Development of a Network on Chip for Parallel Processing Systems","year":2010,"lang":"en","type":"article","venue":"Parallel and Distributed Computing and Networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; System on a chip; Computer architecture; Parallel computing; Parallel processing; Chip; Embedded system; Telecommunications","score_opus":0.01733670780103963,"score_gpt":0.2481187648224218,"score_spread":0.23078205702138216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2318920610","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.044894613,0.004388325,0.89074016,0.002154296,0.0014402464,0.00075529644,0.00023813717,0.0027251327,0.052663714],"genre_scores_gemma":[0.13676527,0.004084809,0.83535796,0.0005660257,0.0002041947,0.00055473216,0.0006165011,0.00032105175,0.021529434],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992611,0.00012234761,0.00003681938,0.00009418671,0.00039413566,0.00009141208],"domain_scores_gemma":[0.9987974,0.000105138264,0.000034270455,0.00013405147,0.0007918928,0.00013716094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010220527,0.0005128024,0.00037164325,0.0006938213,0.0005642333,0.0009639574,0.0014503443,0.0008229234,0.003578826],"category_scores_gemma":[0.0017261617,0.00033818136,0.0004020291,0.00051129516,0.0004401015,0.0015229586,0.0011195175,0.0011326375,0.0016721579],"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.00026432224,0.00041237343,0.0027969293,0.0010280171,0.00012746913,0.0003811651,0.00039259865,0.0696338,0.108544,0.2078111,0.032802474,0.5758057],"study_design_scores_gemma":[0.00010462339,0.0012884684,0.0020572355,0.0003433221,0.00015800491,0.0006135515,0.00017074992,0.22476745,0.11056758,0.025352692,0.63447505,0.000101280275],"about_ca_topic_score_codex":0.0024945128,"about_ca_topic_score_gemma":0.003299156,"teacher_disagreement_score":0.003578826,"about_ca_system_score_codex":0.0010541982,"about_ca_system_score_gemma":0.003128765,"threshold_uncertainty_score":0.011972308},"labels":[],"label_agreement":null},{"id":"W2319792364","doi":"10.2316/p.2010.676-054","title":"Constructing Non-Dominated <em>m</em>-Group Coteries for Group Mutual Exclusion","year":2010,"lang":"en","type":"article","venue":"Parallel and Distributed Computing and Networks","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Group (periodic table); Mutual exclusion; Computer science; Physics; Mathematics; Theoretical computer science","score_opus":0.008023754977007557,"score_gpt":0.22823139202830117,"score_spread":0.22020763705129362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2319792364","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.06838174,0.00008057036,0.92010045,0.00016535544,0.000076339544,0.00015108903,0.000067342684,0.0005020663,0.010475102],"genre_scores_gemma":[0.4756781,0.00012634957,0.5033303,0.00029080999,0.00006640184,0.00036636426,0.00034663372,0.00039395076,0.019401154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987902,0.0004024389,0.00006589151,0.00021371033,0.00031065207,0.0002172162],"domain_scores_gemma":[0.99634725,0.0013959908,0.00031151244,0.00071562745,0.000566834,0.00066281646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019834398,0.00081323524,0.0009349403,0.0011736315,0.0017642446,0.0013567196,0.0019850442,0.000981349,0.0059810476],"category_scores_gemma":[0.006294899,0.0006152499,0.0011098244,0.0009099693,0.001581799,0.0015676133,0.0051664882,0.0016994001,0.0011094719],"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.00066435203,0.00037747723,0.0033507212,0.00021279861,0.00007945079,0.00033523925,0.0008351728,0.09188961,0.019434167,0.7631584,0.007816652,0.111846],"study_design_scores_gemma":[0.000096166805,0.00023469787,0.0005713276,0.000044923312,0.00004522115,0.0001348078,0.00021313423,0.6210365,0.009924985,0.3545657,0.013090003,0.000042534608],"about_ca_topic_score_codex":0.0021078135,"about_ca_topic_score_gemma":0.004064851,"teacher_disagreement_score":0.0059810476,"about_ca_system_score_codex":0.0012040822,"about_ca_system_score_gemma":0.0012814349,"threshold_uncertainty_score":0.020008624},"labels":[],"label_agreement":null},{"id":"W2320450249","doi":"10.2316/p.2010.676-037","title":"Low-Complex Task Scheduling Algorithms for Hierarchical Embedded Many-Core Architectures and Dynamic Applications","year":2010,"lang":"en","type":"article","venue":"Parallel and Distributed Computing and Networks","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Parallel computing; Processor scheduling; Dynamic priority scheduling; Many core; Scheduling (production processes); Distributed computing; Multi-core processor; Fair-share scheduling; Task (project management); Algorithm; Computer network; Mathematical optimization; Resource (disambiguation)","score_opus":0.014159194591029291,"score_gpt":0.28127375390317066,"score_spread":0.2671145593121414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2320450249","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.049890444,0.00045640147,0.9448183,0.00027372662,0.00010211741,0.00007291546,0.00005395541,0.00042416036,0.0039079995],"genre_scores_gemma":[0.4977235,0.00030774015,0.4957212,0.00014357507,0.00008821698,0.00018557876,0.00015791315,0.00023925095,0.0054330453],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999772,0.00006777942,0.000014643098,0.000035110355,0.000072800874,0.000037641305],"domain_scores_gemma":[0.99901617,0.00058623054,0.00008747659,0.000091357084,0.00015643037,0.00006216367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076109334,0.0005932378,0.0006601372,0.00042815192,0.00062958756,0.0007681037,0.0011195734,0.00056029006,0.003528468],"category_scores_gemma":[0.0034334688,0.0003274216,0.00030662434,0.0006475763,0.00043976956,0.00095033104,0.00079178344,0.00090493506,0.0004896592],"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.00016921916,0.000079071186,0.00039807658,0.00009090776,0.000020658825,0.00002874251,0.000077150056,0.90072936,0.0033238141,0.014046741,0.002342555,0.07869364],"study_design_scores_gemma":[0.000016585367,0.000013587605,0.00004894588,0.0000016474585,0.0000027090339,0.0000036262843,0.000008051257,0.9951498,0.00027785663,0.0041988343,0.00027641832,0.0000020732036],"about_ca_topic_score_codex":0.004525926,"about_ca_topic_score_gemma":0.010810181,"teacher_disagreement_score":0.004525926,"about_ca_system_score_codex":0.0007231671,"about_ca_system_score_gemma":0.0015597823,"threshold_uncertainty_score":0.011803925},"labels":[],"label_agreement":null},{"id":"W2323848889","doi":"10.2316/p.2010.676-079","title":"Agglomeration of Dependent Tasks for Efficient Scheduling in Grid Environment","year":2010,"lang":"en","type":"article","venue":"Parallel and Distributed Computing and Networks","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Grid; Scheduling (production processes); Economies of agglomeration; Distributed computing; Grid computing; Parallel computing; Mathematical optimization; Chemical engineering; Geology","score_opus":0.00901608136508937,"score_gpt":0.22867053079723326,"score_spread":0.2196544494321439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2323848889","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.1670531,0.00021624452,0.8262071,0.00024133897,0.00009815577,0.00016288052,0.0001280433,0.0013375792,0.004555624],"genre_scores_gemma":[0.5672496,0.00014375019,0.42495826,0.00007488828,0.000046705856,0.000229884,0.0005388826,0.000422103,0.006335879],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999516,0.00012860417,0.000032105203,0.00008868996,0.000121233,0.00011342092],"domain_scores_gemma":[0.99902153,0.00025884484,0.00007972826,0.00032284096,0.0001919474,0.00012514304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006171968,0.00055447384,0.0009810855,0.0006099644,0.0022564952,0.00066229777,0.0017120668,0.00049065554,0.0031325938],"category_scores_gemma":[0.0015713434,0.0005340119,0.0007650684,0.0011945894,0.0005307412,0.00080795726,0.0015565663,0.00088248105,0.0009461418],"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.0014109118,0.0004850222,0.0037263473,0.00029786894,0.00019551888,0.0005096838,0.00094032707,0.73686343,0.054057017,0.03315803,0.01179019,0.15656565],"study_design_scores_gemma":[0.00008176173,0.00012830374,0.001224273,0.0000072803487,0.000044867153,0.00008916323,0.00017218899,0.9663776,0.010241497,0.016158646,0.0054522515,0.000022169585],"about_ca_topic_score_codex":0.0068751285,"about_ca_topic_score_gemma":0.014401233,"teacher_disagreement_score":0.0068751285,"about_ca_system_score_codex":0.00062638515,"about_ca_system_score_gemma":0.0013176874,"threshold_uncertainty_score":0.013670206},"labels":[],"label_agreement":null},{"id":"W2326709443","doi":"10.2316/journal.211.2014.4.211-1012","title":"FAST PARALLEL ALGORITHM FOR DISCRETE FOURIER TRANSFORM IN MULTI-MESH NETWORK","year":2014,"lang":"en","type":"article","venue":"Parallel and Distributed Computing and Networks","topic":"Advanced Algorithms and Applications","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"University of Kalyani; Department of Science and Technology, Ministry of Science and Technology, India","keywords":"Computer science; Discrete Fourier transform (general); Algorithm; Fourier transform; Parallel computing; Fast Fourier transform; Computational science; Fourier analysis; Short-time Fourier transform; Mathematics","score_opus":0.008951030432034537,"score_gpt":0.23761053121289902,"score_spread":0.22865950078086447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2326709443","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.0041701407,0.00011390591,0.99429387,0.00008400618,0.000044031978,0.000024016425,0.000021896709,0.000402388,0.0008457353],"genre_scores_gemma":[0.10674817,0.00026190662,0.88907313,0.000052960324,0.00006970831,0.00016749447,0.0001935513,0.0001261311,0.003306925],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995515,0.00008051452,0.000026020203,0.00007930119,0.00020406893,0.000058540376],"domain_scores_gemma":[0.9995896,0.00016984464,0.000030365427,0.00006837598,0.00012429121,0.000017454551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053372694,0.00056169473,0.00063341844,0.00091711385,0.0006367426,0.00079003087,0.0012036625,0.00081418664,0.0044310465],"category_scores_gemma":[0.0014827147,0.00026593855,0.00058617844,0.0009516576,0.00050831394,0.0018696452,0.0010125779,0.0007915704,0.0014889437],"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.00040720764,0.00009554771,0.0011183713,0.0002627363,0.000084625,0.00035294818,0.00025045453,0.3364222,0.019751744,0.05531137,0.0067087812,0.579234],"study_design_scores_gemma":[0.00003307101,0.000034565797,0.00009895284,0.00000806317,0.00000685694,0.00010140055,0.000033552,0.98322046,0.00402984,0.009382599,0.0030429927,0.000007616189],"about_ca_topic_score_codex":0.0030946983,"about_ca_topic_score_gemma":0.003096195,"teacher_disagreement_score":0.0044310465,"about_ca_system_score_codex":0.0006879518,"about_ca_system_score_gemma":0.0008530514,"threshold_uncertainty_score":0.0148233175},"labels":[],"label_agreement":null},{"id":"W2326867708","doi":"10.2316/journal.211.2011.1.211-1009","title":"HIGH THROUGHPUT – SYSTEM-ORIENTED SCHEDULER FOR AVOIDING HASTE PROBLEM IN COMPUTATIONAL GRIDS","year":2011,"lang":"en","type":"article","venue":"Parallel and Distributed Computing and Networks","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Throughput; Distributed computing; Parallel computing; Operating system; Wireless","score_opus":0.013190586720886195,"score_gpt":0.20810309092967647,"score_spread":0.19491250420879028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2326867708","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.09485946,0.00061240385,0.893991,0.0005457247,0.0005270842,0.00016533516,0.00012985934,0.003273919,0.005895154],"genre_scores_gemma":[0.8239583,0.00020679268,0.17102008,0.00017857358,0.00015963556,0.00012347108,0.0002601741,0.00027056303,0.003822507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999458,0.00017281076,0.000028140475,0.00006195544,0.00016126409,0.00011782771],"domain_scores_gemma":[0.9990196,0.00023647545,0.000053412394,0.0002507624,0.000303371,0.00013644769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092042505,0.00043622067,0.00070352777,0.000413977,0.001193895,0.0010267782,0.0017424197,0.00053847476,0.003013919],"category_scores_gemma":[0.0024447446,0.00029370812,0.0003885516,0.00059688237,0.00048115366,0.000989149,0.0011369664,0.0010219811,0.0005958558],"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.0016875415,0.00043605664,0.0036878858,0.00034741373,0.0002456035,0.00042702715,0.00032398215,0.6978232,0.044691302,0.07371126,0.023941804,0.15267688],"study_design_scores_gemma":[0.000057784306,0.0000649386,0.00023912199,0.000003062059,0.000017517386,0.000034197667,0.000020546333,0.9839442,0.004586322,0.009046494,0.0019762637,0.000009593245],"about_ca_topic_score_codex":0.0033447281,"about_ca_topic_score_gemma":0.004354978,"teacher_disagreement_score":0.0033447281,"about_ca_system_score_codex":0.0007259996,"about_ca_system_score_gemma":0.0022771074,"threshold_uncertainty_score":0.010082543},"labels":[],"label_agreement":null},{"id":"W2327189209","doi":"10.2316/p.2010.676-066","title":"Stream Experiments: Toward Latency Hiding in GPGPU","year":2010,"lang":"en","type":"article","venue":"Parallel and Distributed Computing and Networks","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; General-purpose computing on graphics processing units; Latency (audio); Parallel computing; Computer graphics (images); Graphics; Telecommunications","score_opus":0.013934640081271593,"score_gpt":0.25797018275291095,"score_spread":0.24403554267163935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2327189209","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.49800357,0.0013476853,0.46431854,0.0025548907,0.001009144,0.000253495,0.0009629723,0.012268876,0.019280871],"genre_scores_gemma":[0.8535646,0.00045204358,0.13863198,0.00053954596,0.00014778937,0.00019165424,0.00054924184,0.00090616907,0.005017002],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99883074,0.00040027744,0.00003475411,0.00012797331,0.0004551119,0.00015117877],"domain_scores_gemma":[0.9968027,0.0012855507,0.00013581889,0.0011513374,0.0004689867,0.00015558115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014805059,0.0006996061,0.00065431616,0.00044855606,0.00067590084,0.0011461294,0.0018007845,0.0008492963,0.004482891],"category_scores_gemma":[0.008186021,0.00033412152,0.00029360733,0.0009821067,0.0013769862,0.0030212468,0.0015358273,0.001845258,0.00066792243],"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.008557761,0.001994775,0.008777489,0.0007312971,0.00034646638,0.00038716712,0.0009796051,0.25087032,0.11634016,0.17314923,0.04461449,0.39325124],"study_design_scores_gemma":[0.0003728116,0.0007018129,0.0007896382,0.000033939705,0.00006241972,0.000073505005,0.00015848549,0.78906846,0.12728152,0.07356885,0.0078437915,0.000044833618],"about_ca_topic_score_codex":0.001778969,"about_ca_topic_score_gemma":0.001448165,"teacher_disagreement_score":0.004482891,"about_ca_system_score_codex":0.00055164564,"about_ca_system_score_gemma":0.0010998364,"threshold_uncertainty_score":0.014996767},"labels":[],"label_agreement":null},{"id":"W2328826103","doi":"10.2316/journal.211.2012.1.211-1056","title":"APPROXIMATION ALGORITHMS FOR SP-MULTICAST TREES IN 2D GRIDS1","year":2012,"lang":"en","type":"article","venue":"Parallel and Distributed Computing and Networks","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Multicast; Computer science; Protocol Independent Multicast; Algorithm; Computer network","score_opus":0.019647432898477316,"score_gpt":0.25912727150880427,"score_spread":0.23947983861032696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2328826103","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.06927115,0.0012145557,0.9159271,0.0015438634,0.00020933728,0.00019213973,0.0007123345,0.001626425,0.009303055],"genre_scores_gemma":[0.36803263,0.0007836243,0.6218795,0.00032844723,0.00023663089,0.00031869917,0.0018352452,0.00041638836,0.0061687636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987056,0.00039222054,0.0000676702,0.00023008099,0.00034679522,0.00025765144],"domain_scores_gemma":[0.99614954,0.0021895817,0.00022724779,0.00084193586,0.00036088514,0.00023079803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016304634,0.0011658724,0.0018789566,0.0014801528,0.0015067784,0.0022628468,0.003672706,0.002462802,0.006967018],"category_scores_gemma":[0.008753208,0.00084756094,0.00129085,0.003528634,0.000913408,0.004774257,0.0032396596,0.0026008661,0.0014586083],"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.0010111289,0.00037204343,0.0022069633,0.0005593703,0.00013827422,0.00013836735,0.0004104583,0.68635184,0.0038211318,0.097288765,0.024856644,0.1828449],"study_design_scores_gemma":[0.00004687402,0.000036494876,0.00013260994,0.000012493535,0.000012852856,0.000043528442,0.000050937586,0.9457624,0.00054948893,0.05198561,0.0013610127,0.0000058027467],"about_ca_topic_score_codex":0.004789002,"about_ca_topic_score_gemma":0.007471689,"teacher_disagreement_score":0.006967018,"about_ca_system_score_codex":0.0023154214,"about_ca_system_score_gemma":0.0016482224,"threshold_uncertainty_score":0.023306966},"labels":[],"label_agreement":null},{"id":"W2331476467","doi":"10.2316/journal.211.2013.3.211-1053","title":"A GPGPU PROGRAMMING FRAMEWORK BASED ON A SHARED-MEMORY MODEL","year":2013,"lang":"en","type":"article","venue":"Parallel and Distributed Computing and Networks","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Japan Society for the Promotion of Science","keywords":"Computer science; General-purpose computing on graphics processing units; Parallel computing; Programming paradigm; Shared memory; CUDA; Computer architecture; Programming language; Computer graphics (images); Graphics","score_opus":0.01196231576734502,"score_gpt":0.2428184954972875,"score_spread":0.2308561797299425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2331476467","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.006721701,0.00042986136,0.97759527,0.00028152415,0.00016978216,0.00012233767,0.00022434468,0.004366338,0.01008889],"genre_scores_gemma":[0.10903946,0.0008158508,0.8740029,0.00025408322,0.000120644465,0.0007518931,0.00090561603,0.0018528709,0.012256743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996612,0.000084461186,0.000017807522,0.00005357744,0.00013431668,0.00004871364],"domain_scores_gemma":[0.99975806,0.000045747114,0.000013612541,0.00006331086,0.000082688384,0.00003660596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033600137,0.0005549314,0.0009668146,0.00043835284,0.0008941832,0.001330932,0.002518368,0.00091888587,0.005043126],"category_scores_gemma":[0.0010319469,0.00044157187,0.0008867465,0.0012061921,0.00054130197,0.0012847999,0.0015736223,0.0019992325,0.002474442],"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.0002930408,0.00026637505,0.0013908442,0.00046150878,0.00024958793,0.0005171508,0.00047700724,0.38558212,0.01508229,0.3186444,0.053014923,0.22402081],"study_design_scores_gemma":[0.00006540673,0.000063490756,0.0001740225,0.000031655818,0.00003139836,0.0001320407,0.000029010058,0.915156,0.0030093496,0.03813047,0.043141723,0.00003538754],"about_ca_topic_score_codex":0.006157376,"about_ca_topic_score_gemma":0.0054672495,"teacher_disagreement_score":0.006157376,"about_ca_system_score_codex":0.00050477503,"about_ca_system_score_gemma":0.001476272,"threshold_uncertainty_score":0.016870916},"labels":[],"label_agreement":null},{"id":"W2332854854","doi":"10.2316/p.2010.676-024","title":"A Proactive Fault Tolerance Framework for High-Performance Computing","year":2010,"lang":"en","type":"article","venue":"Parallel and Distributed Computing and Networks","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Oak Ridge National Laboratory; UT-Battelle; Battelle; Advanced Scientific Computing Research; U.S. Department of Energy","keywords":"Computer science; Fault tolerance; Distributed computing; Software fault tolerance","score_opus":0.010664129001635528,"score_gpt":0.24455976510648292,"score_spread":0.2338956361048474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2332854854","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.0026278405,0.00059723074,0.9902733,0.00043023954,0.000121798934,0.00009938029,0.00005486349,0.0034868484,0.0023084122],"genre_scores_gemma":[0.16039924,0.0008377753,0.8303807,0.00037725817,0.00021218527,0.00036939813,0.00028306726,0.00040861557,0.0067317043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874216,0.00022278007,0.000065359694,0.00016190817,0.0006770066,0.00013086814],"domain_scores_gemma":[0.9990386,0.0002200054,0.00008960157,0.00023608828,0.00027508938,0.00014063247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019480509,0.00097019825,0.0007253689,0.00072067213,0.0013718342,0.0024175926,0.0036058708,0.0015013539,0.0019377051],"category_scores_gemma":[0.0019763985,0.00044439983,0.0012176846,0.0005805289,0.0014478583,0.0021080722,0.00195812,0.0021844723,0.00070576597],"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.00020385742,0.00027150428,0.0011595861,0.00046825025,0.00016897263,0.000479595,0.0006325392,0.31323904,0.017630607,0.43662113,0.02105022,0.20807478],"study_design_scores_gemma":[0.000054613865,0.00015409905,0.00039902076,0.00006533289,0.00010506027,0.00029486496,0.00008290258,0.833335,0.009277878,0.09583966,0.060304064,0.000087511326],"about_ca_topic_score_codex":0.006682661,"about_ca_topic_score_gemma":0.008445419,"teacher_disagreement_score":0.006682661,"about_ca_system_score_codex":0.0012797426,"about_ca_system_score_gemma":0.002952912,"threshold_uncertainty_score":0.013287544},"labels":[],"label_agreement":null},{"id":"W2334476329","doi":"10.2316/p.2010.676-062","title":"Effect of Atmospheric Turbulent Channel on Bit-Error-Rate of Optical Wireless Link","year":2010,"lang":"en","type":"article","venue":"Parallel and Distributed Computing and Networks","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Bit error rate; Channel (broadcasting); Bit (key); Link (geometry); Wireless; Optical wireless; Optical link; Computer network; Telecommunications; Optical fiber","score_opus":0.00624956024363951,"score_gpt":0.2249653852044506,"score_spread":0.2187158249608111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2334476329","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.9923379,0.0004893638,0.004688786,0.00016253018,0.00010468608,0.000009054766,0.0002167843,0.00018187247,0.0018089935],"genre_scores_gemma":[0.99937326,0.000115416224,0.00019066723,0.000021685715,0.000010546724,0.0000018197358,0.00005792627,0.00001547513,0.00021312537],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992292,0.00013951585,0.000024228733,0.000087009634,0.00015795983,0.0003621441],"domain_scores_gemma":[0.9913645,0.006771858,0.0003772825,0.0002199165,0.0010116245,0.0002548715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066260615,0.00043216758,0.00042417113,0.0004589654,0.0008047819,0.0006023604,0.00032505786,0.00069008034,0.0023335367],"category_scores_gemma":[0.00434872,0.00027264105,0.00029614396,0.0005472591,0.0007187202,0.00089181605,0.00038976804,0.00063618994,0.00024904677],"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.013547079,0.00088503363,0.08202545,0.00078929856,0.0003754757,0.0030356012,0.0006639788,0.5295885,0.32674822,0.0044925534,0.0037641234,0.03408462],"study_design_scores_gemma":[0.0001766748,0.0010932172,0.10284455,0.00008120668,0.00037257734,0.00063348864,0.0005445726,0.6903369,0.20177466,0.0009866231,0.00093464484,0.00022088207],"about_ca_topic_score_codex":0.005005746,"about_ca_topic_score_gemma":0.003513408,"teacher_disagreement_score":0.005005746,"about_ca_system_score_codex":0.0005149642,"about_ca_system_score_gemma":0.00051351404,"threshold_uncertainty_score":0.009953201},"labels":[],"label_agreement":null},{"id":"W2334768140","doi":"10.2316/p.2010.676-042","title":"On the Parallelization of Meshless Methods for the Solution of the Diffusion Equation","year":2010,"lang":"en","type":"article","venue":"Parallel and Distributed Computing and Networks","topic":"Numerical methods in engineering","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Diffusion; Computational science; Diffusion equation; Parallel computing; Mathematical optimization; Mathematics; Thermodynamics; Physics","score_opus":0.01859003992244724,"score_gpt":0.28478120479035607,"score_spread":0.26619116486790884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2334768140","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.015302545,0.0011984422,0.97492677,0.0008237876,0.0004656276,0.000055324424,0.000030341369,0.00032166488,0.006875531],"genre_scores_gemma":[0.3504086,0.0029507235,0.6249209,0.00071536336,0.00064121577,0.00030649957,0.0002477753,0.0008798343,0.018929161],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990312,0.00039566966,0.00004931931,0.00007091727,0.00038797458,0.000064886415],"domain_scores_gemma":[0.99769115,0.001423273,0.00010563021,0.00029819115,0.0003958076,0.00008603456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017810914,0.0007566481,0.0008726843,0.00064588,0.0008095603,0.0009208872,0.0014508981,0.00091566925,0.0023486186],"category_scores_gemma":[0.008741317,0.00033895957,0.00073652324,0.00077605364,0.0018734498,0.001923842,0.0016788219,0.0022209107,0.0005327965],"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.0006812654,0.00018965575,0.00080510194,0.00041202313,0.00010913009,0.00018561483,0.0003594869,0.3971595,0.01664994,0.35820782,0.014160478,0.21108007],"study_design_scores_gemma":[0.00004989725,0.000038168844,0.00010888744,0.000013015484,0.000013048194,0.0000225641,0.000014869436,0.92493325,0.0022596982,0.06707085,0.005466166,0.000009576088],"about_ca_topic_score_codex":0.0027999883,"about_ca_topic_score_gemma":0.0021659557,"teacher_disagreement_score":0.0027999883,"about_ca_system_score_codex":0.0005949547,"about_ca_system_score_gemma":0.000789539,"threshold_uncertainty_score":0.009419441},"labels":[],"label_agreement":null}]}