{"meta":{"query_hash":"620e6307a0e7","filters":{"venue":"International Workshop on Quality of Service"},"cohort_total":9,"direct_labels_cover":0,"predictions_cover":9,"exported":9,"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/620e6307a0e7","api":"https://metacan.xera.ac/api/v1/cohort?venue=International+Workshop+on+Quality+of+Service"},"results":[{"id":"W1990395834","doi":"10.1109/iwqos.2007.376551","title":"On the Stability Region of Linear-Memory Scheduling for Time Varying Channels","year":2007,"lang":"en","type":"article","venue":"International Workshop on Quality of Service","topic":"Advanced Wireless Network Optimization","field":"Engineering","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":"University of Toronto","funders":"","keywords":"Computer science; Scheduling (production processes); Fair-share scheduling; Dynamic priority scheduling; Mathematical optimization; Processor scheduling; Two-level scheduling; Distributed computing; Rate-monotonic scheduling; Round-robin scheduling; Time complexity; Parallel computing; Algorithm; Resource (disambiguation); Computer network; Mathematics; Quality of service","score_opus":0.05453556149124307,"score_gpt":0.3143575415357443,"score_spread":0.25982198004450124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990395834","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48372787,0.000033778964,0.5121498,0.0014585153,0.0004842134,0.0003300006,0.000018198287,0.00008794867,0.0017096861],"genre_scores_gemma":[0.9916992,0.000013660943,0.007420037,0.0004975319,0.00021987864,0.000015353535,0.000048947622,0.000030171363,0.000055179404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869555,0.00004167987,0.0005661405,0.00018305166,0.00034366478,0.00016991432],"domain_scores_gemma":[0.99664026,0.0024302343,0.00021954697,0.0002825829,0.00039228273,0.00003510469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010525176,0.00013971727,0.00020467448,0.00008591708,0.000054892036,0.000009167708,0.00031340282,0.00009804025,0.00005704858],"category_scores_gemma":[0.00035744844,0.00012664498,0.00008552968,0.00025387696,0.000033940745,0.00012213652,0.000034263252,0.00017772632,0.000008789817],"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.00033403133,0.000068749505,0.000027615255,0.000112251735,0.00005446677,3.2156234e-7,0.00047153342,0.98803836,0.0028420417,0.0054560406,0.00004346785,0.0025511119],"study_design_scores_gemma":[0.0005457013,0.00003276845,0.00028387317,0.00045973537,0.0000084982175,8.2756287e-7,0.00031699662,0.96500856,0.029364925,0.0036991788,0.00009266819,0.000186294],"about_ca_topic_score_codex":0.0000129765895,"about_ca_topic_score_gemma":0.000014807596,"teacher_disagreement_score":0.5079714,"about_ca_system_score_codex":0.000100675476,"about_ca_system_score_gemma":0.000010620628,"threshold_uncertainty_score":0.51644325},"labels":[],"label_agreement":null},{"id":"W2016312880","doi":"10.1109/iwqos.2006.250480","title":"How Practical is Network Coding?","year":2006,"lang":"en","type":"article","venue":"International Workshop on Quality of Service","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1402,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Toronto","funders":"","keywords":"Computer science","score_opus":0.10484732654309496,"score_gpt":0.3769582704969661,"score_spread":0.27211094395387114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016312880","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011782162,0.00023470337,0.4887358,0.46326777,0.0009919226,0.00018594584,0.000008444619,0.00017266413,0.0346206],"genre_scores_gemma":[0.95719814,0.00012070118,0.02478593,0.015186342,0.0004271472,0.00001176286,0.000021031528,0.0000097101965,0.0022392047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983546,0.00020617446,0.00038247646,0.00030487933,0.00056120334,0.00019064402],"domain_scores_gemma":[0.9975913,0.00085376884,0.00028662512,0.0006404011,0.00057601125,0.00005184901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006868031,0.00013466897,0.0001856507,0.000068471294,0.00012699261,0.00026604248,0.0012253844,0.00007195487,0.00010198474],"category_scores_gemma":[0.00014253343,0.00013352935,0.00008253825,0.0005142141,0.000038026406,0.00049257034,0.0004115693,0.00023834419,0.000049682898],"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.00003153094,0.00017731829,0.0007027345,0.000009797281,0.000037518043,0.0000018919388,0.0002377434,0.00071616686,0.00042751382,0.9654897,0.02403728,0.0081307925],"study_design_scores_gemma":[0.002517456,0.00011841132,0.07173222,0.00079524686,0.000022676173,0.00002766426,0.0003873508,0.28267974,0.004052586,0.086199574,0.5501182,0.0013488831],"about_ca_topic_score_codex":0.000043064327,"about_ca_topic_score_gemma":0.00021821434,"teacher_disagreement_score":0.94541603,"about_ca_system_score_codex":0.000058968413,"about_ca_system_score_gemma":0.000046152716,"threshold_uncertainty_score":0.5445169},"labels":[],"label_agreement":null},{"id":"W2023693619","doi":"10.1109/iwqos.2007.376565","title":"Structuring Multi-Layer Scalable Streams to Maximize Cient-Perceived Quality","year":2007,"lang":"en","type":"article","venue":"International Workshop on Quality of Service","topic":"Video Coding and Compression Technologies","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Scalability; Granularity; Encoding (memory); Structuring; ENCODE; Coding (social sciences); Heuristic; Scalable Video Coding; Bandwidth (computing); Distributed computing; Algorithm; Computer network; Artificial intelligence","score_opus":0.12157126555876703,"score_gpt":0.38606988110158,"score_spread":0.264498615542813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023693619","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7179808,0.000021843243,0.27149618,0.0075213406,0.0007582199,0.00014288946,0.000013440156,0.0003475865,0.0017176952],"genre_scores_gemma":[0.9319855,0.0000059187355,0.06449588,0.0028818615,0.000055546036,0.000008865397,0.0000058938053,0.000010387956,0.0005501781],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99717116,0.00010703942,0.000791059,0.0006113496,0.0009582582,0.00036114285],"domain_scores_gemma":[0.99747205,0.00062151277,0.00032341853,0.000913141,0.000525582,0.00014430867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014125918,0.00021641844,0.00030635702,0.00029690596,0.00013018577,0.00014039422,0.0026008757,0.00014562745,0.00007759967],"category_scores_gemma":[0.00049130776,0.00020151306,0.000114158625,0.00062641373,0.000043347052,0.00033750673,0.0008449415,0.00028408854,0.00009340585],"study_design_candidate":"observational","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.00084245135,0.001526582,0.011098718,0.0002089953,0.0003174226,0.000030566436,0.0076888725,0.015321311,0.15151526,0.20569481,0.0013001348,0.6044549],"study_design_scores_gemma":[0.003524976,0.0001483656,0.7861558,0.0011058531,0.000012953499,0.00001465294,0.005872653,0.033317797,0.14730369,0.016726097,0.004353402,0.0014637456],"about_ca_topic_score_codex":0.00059739506,"about_ca_topic_score_gemma":0.000351523,"teacher_disagreement_score":0.7750571,"about_ca_system_score_codex":0.0001264525,"about_ca_system_score_gemma":0.000033489327,"threshold_uncertainty_score":0.8217464},"labels":[],"label_agreement":null},{"id":"W2096199330","doi":"10.1109/iwqos.2007.376546","title":"On the Resilience-Complexity Tradeoff of Network Coding in Dynamic P2P Networks","year":2007,"lang":"en","type":"article","venue":"International Workshop on Quality of Service","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":19,"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":"Linear network coding; Computer science; Coding (social sciences); Resilience (materials science); Theoretical computer science; Computational complexity theory; Distributed computing; Computer network; Algorithm; Mathematics","score_opus":0.10365162549871887,"score_gpt":0.370040041402382,"score_spread":0.26638841590366313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096199330","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34592688,0.00030989715,0.59594375,0.03897059,0.000996911,0.00042608657,0.0000059180584,0.00007871554,0.017341284],"genre_scores_gemma":[0.99308753,0.00015326106,0.0025283538,0.0040646833,0.000063760446,0.0000065085364,0.000008175885,0.000007490879,0.00008022861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976003,0.00039178366,0.0008260747,0.00031599673,0.0005880022,0.00027783716],"domain_scores_gemma":[0.9946564,0.003772742,0.00042698297,0.0008004118,0.00029039037,0.00005311339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003632999,0.00015929011,0.00026164934,0.00014394056,0.00013207356,0.000049608214,0.0024080034,0.000083494444,0.000076958575],"category_scores_gemma":[0.00028328164,0.00013248403,0.00009109212,0.0011679602,0.00012010364,0.00018387866,0.00037332077,0.00045250118,0.000008609903],"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.00015049227,0.0001915705,0.0010056945,0.000010636121,0.000028400853,0.0000014386602,0.0009538455,0.06356886,0.00025154056,0.91696596,0.00028824862,0.01658329],"study_design_scores_gemma":[0.00072449225,0.00007038198,0.21532416,0.0009515884,0.0000035482415,0.000002368406,0.00041060167,0.74885136,0.00033095002,0.032362316,0.000653159,0.00031505644],"about_ca_topic_score_codex":0.000068120244,"about_ca_topic_score_gemma":0.0025790255,"teacher_disagreement_score":0.8846037,"about_ca_system_score_codex":0.00012065581,"about_ca_system_score_gemma":0.00003626461,"threshold_uncertainty_score":0.54025424},"labels":[],"label_agreement":null},{"id":"W2099597159","doi":"10.1109/iwqos.2007.376547","title":"Parallelized Progressive Network Coding With Hardware Acceleration","year":2007,"lang":"en","type":"article","venue":"International Workshop on Quality of Service","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":106,"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; PowerPC; Linear network coding; SIMD; x86; Speedup; Parallel computing; Computer architecture; Computer network; Operating system; Network packet","score_opus":0.09776376773168913,"score_gpt":0.3754989711180038,"score_spread":0.27773520338631463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099597159","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059132226,0.0003348869,0.89912134,0.022975655,0.00059949164,0.00042267208,0.0000037652558,0.00021680411,0.017193146],"genre_scores_gemma":[0.9614253,0.00009102698,0.033231556,0.0047111767,0.00021631783,0.000018785397,0.000035432808,0.000010576089,0.00025982273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99821603,0.00015273942,0.00050784636,0.0003137677,0.00058066205,0.00022896912],"domain_scores_gemma":[0.99746525,0.00065620197,0.0003886924,0.000543041,0.0008702022,0.00007662038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001234577,0.00015404173,0.00020634505,0.00009608998,0.00018118277,0.00014816642,0.0012934284,0.000065657056,0.00010362744],"category_scores_gemma":[0.0000943854,0.00013511466,0.000053846772,0.00063216826,0.000038335314,0.00045386812,0.00027574846,0.00022513088,0.000024223413],"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.0007937002,0.00038016183,0.0041916715,0.00004466613,0.00023501976,0.000015455786,0.0031000192,0.013986756,0.0013053368,0.8544308,0.0016717684,0.11984465],"study_design_scores_gemma":[0.014929775,0.0008607413,0.48291746,0.0065327827,0.00007103164,0.000089030684,0.0027399533,0.34497127,0.01497644,0.019807884,0.10819446,0.0039091674],"about_ca_topic_score_codex":0.000013545907,"about_ca_topic_score_gemma":0.0003689022,"teacher_disagreement_score":0.9022931,"about_ca_system_score_codex":0.00007765938,"about_ca_system_score_gemma":0.000049401435,"threshold_uncertainty_score":0.5509816},"labels":[],"label_agreement":null},{"id":"W2102325130","doi":"10.1109/iwqos.2008.22","title":"Dynamic Control of Tunable Sub-Optimal Algorithms for Scheduling of Time-Varying Wireless Networks","year":2008,"lang":"en","type":"article","venue":"International Workshop on Quality of Service","topic":"Advanced Wireless Network Optimization","field":"Engineering","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 Toronto","funders":"","keywords":"Computer science; Scheduling (production processes); Queue; Schedule; Algorithm; Dynamic priority scheduling; Asymptotically optimal algorithm; Mathematical optimization; Distributed computing; Computer network; Mathematics","score_opus":0.02259317062480769,"score_gpt":0.2842929873294574,"score_spread":0.2616998167046497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102325130","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3054946,0.00020684101,0.69335926,0.00013054033,0.0002702676,0.00024118774,0.00006659954,0.00006816536,0.00016254114],"genre_scores_gemma":[0.96177846,0.000229084,0.037513927,0.00010148404,0.00009270332,0.000030041489,0.00015777725,0.000052162886,0.000044372122],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819344,0.000043854314,0.0008951222,0.00022971885,0.00039734453,0.00024050161],"domain_scores_gemma":[0.99782896,0.0008128386,0.0004184565,0.0002444153,0.000641981,0.00005333458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035308834,0.00020696301,0.0005015866,0.00014650673,0.000051261988,0.0000070232877,0.00036573142,0.00015934018,0.00003247253],"category_scores_gemma":[0.000068574605,0.00024241405,0.0001402694,0.00032998074,0.00006701237,0.00022529226,0.000038326314,0.0001840037,0.0000030993933],"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.00031198055,0.00009263555,0.000205094,0.00017594491,0.00019128465,7.5498775e-7,0.00017571075,0.98500484,0.010586988,0.00041666807,0.00001849159,0.0028195954],"study_design_scores_gemma":[0.0013210647,0.000030273699,0.00046770196,0.00036153002,0.00001869222,0.0000024717197,0.00006174636,0.9922102,0.005201043,0.00011009787,0.000019457244,0.0001957265],"about_ca_topic_score_codex":0.000028384164,"about_ca_topic_score_gemma":0.000014066404,"teacher_disagreement_score":0.65628386,"about_ca_system_score_codex":0.00009736474,"about_ca_system_score_gemma":0.000026995533,"threshold_uncertainty_score":0.9885358},"labels":[],"label_agreement":null},{"id":"W2108773413","doi":"10.1109/iwqos.2007.376548","title":"Probabilistic Field Coverage using a Hybrid Network of Static and Mobile Sensors","year":2007,"lang":"en","type":"article","venue":"International Workshop on Quality of Service","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Scheduling (production processes); Probabilistic logic; Wireless sensor network; Distributed computing; Overhead (engineering); Real-time computing; Exploit; Computer network; Engineering","score_opus":0.033831808693742735,"score_gpt":0.32327052765787434,"score_spread":0.2894387189641316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108773413","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7459149,0.000055024477,0.25212526,0.00062842394,0.00040791807,0.00014244963,0.0000073585907,0.00003368271,0.0006850208],"genre_scores_gemma":[0.98284566,0.00001699966,0.015650967,0.0013073299,0.000100898105,0.0000031063378,0.0000073912724,0.0000106158095,0.000057030054],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979842,0.000117564065,0.0006902995,0.00035020817,0.0006009915,0.00025677698],"domain_scores_gemma":[0.9962527,0.0024071704,0.00044610165,0.00040772985,0.0004068963,0.00007940219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010936528,0.00015545059,0.00028884498,0.00009028752,0.000053149754,0.00004178929,0.00062210136,0.0000703444,0.000023258475],"category_scores_gemma":[0.00019510902,0.00015929557,0.00006370906,0.00039914527,0.000056029312,0.00016791157,0.00023067938,0.00017658164,0.0000024819874],"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.00013227409,0.00017902131,0.0007363404,0.00009849103,0.00005576188,0.000010357705,0.00062806165,0.95749587,0.00056194,0.033224754,0.0000780762,0.006799075],"study_design_scores_gemma":[0.0007975937,0.00015394214,0.0049965465,0.00071266067,0.000015932907,0.000022587037,0.00018807198,0.981913,0.0038308324,0.006392753,0.00059731555,0.0003787859],"about_ca_topic_score_codex":0.00026118383,"about_ca_topic_score_gemma":0.00010031146,"teacher_disagreement_score":0.2369308,"about_ca_system_score_codex":0.000064761065,"about_ca_system_score_gemma":0.000035939593,"threshold_uncertainty_score":0.64958847},"labels":[],"label_agreement":null},{"id":"W2116690616","doi":"10.1109/iwqos.2006.250477","title":"An End-to-End Probabilistic Network Calculus with Moment Generating Functions","year":2006,"lang":"en","type":"article","venue":"International Workshop on Quality of Service","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":234,"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":"Network calculus; Computer science; Server; Probabilistic logic; Statistical time division multiplexing; Multiplexing; Queueing theory; Theoretical computer science; Moment (physics); Scalability; Algorithm; Calculus (dental); Computer network; Quality of service; Artificial intelligence; Telecommunications","score_opus":0.026752530590354807,"score_gpt":0.2914396552845807,"score_spread":0.2646871246942259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116690616","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84645206,0.000021291233,0.1302745,0.009417747,0.00048944645,0.00034185895,0.000022046064,0.0001904409,0.012790578],"genre_scores_gemma":[0.98751056,4.0585667e-7,0.003394407,0.005936532,0.002014917,0.00004699451,0.00027374373,0.000028657185,0.00079379167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981905,0.000048521324,0.0005173208,0.00040514654,0.00059684855,0.0002416611],"domain_scores_gemma":[0.99841344,0.00019956577,0.0003932921,0.0003689335,0.0006015808,0.000023206167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007670798,0.00019765274,0.00024193402,0.00018806447,0.0002038853,0.00016442337,0.00039725954,0.000051116953,0.00055982557],"category_scores_gemma":[0.00008765861,0.00018038548,0.00007061031,0.00081793655,0.00004197869,0.000586354,0.00009899907,0.00014320899,0.00012083114],"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.00021628563,0.00022881017,0.0016030543,0.00003893627,0.00007401377,0.0000023849536,0.00003738633,0.8266921,0.00059027976,0.16787376,0.00035201656,0.0022909844],"study_design_scores_gemma":[0.002749817,0.000138085,0.047280423,0.0011215582,0.00046810115,0.0000060960697,0.0024437318,0.7851605,0.00024353137,0.08353631,0.07481186,0.0020399822],"about_ca_topic_score_codex":0.0019994667,"about_ca_topic_score_gemma":0.006400371,"teacher_disagreement_score":0.14105847,"about_ca_system_score_codex":0.000102241225,"about_ca_system_score_gemma":0.000017661534,"threshold_uncertainty_score":0.73559064},"labels":[],"label_agreement":null},{"id":"W2122471890","doi":"10.1109/iwqos.2006.250447","title":"Echelon: Peer-to-Peer Network Diagnosis with Network Coding","year":2006,"lang":"en","type":"article","venue":"International Workshop on Quality of Service","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":20,"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; Peer-to-peer; Linear network coding; Troubleshooting; Network topology; Server; Computer network; Distributed computing; Leverage (statistics); Dissemination; Telecommunications; Artificial intelligence; Network packet","score_opus":0.0679937543639916,"score_gpt":0.3419990575953241,"score_spread":0.27400530323133254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122471890","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05946077,0.00046367873,0.56462497,0.3226354,0.0018360143,0.0006585662,0.000019753721,0.00042973406,0.049871128],"genre_scores_gemma":[0.94179124,0.00008610106,0.040687006,0.013893141,0.0009020909,0.00008391186,0.00006168965,0.000023165223,0.002471665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99703985,0.00026428682,0.00062311295,0.0004837248,0.001220785,0.000368207],"domain_scores_gemma":[0.995799,0.0012096935,0.00031716522,0.00086733507,0.0016950313,0.00011175817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017023218,0.00023620931,0.00031200156,0.0001056006,0.00025283502,0.00023839722,0.0021029415,0.00008886393,0.00014446602],"category_scores_gemma":[0.00016608684,0.00022114579,0.00008631094,0.0013284797,0.000039660594,0.00034653654,0.00060282706,0.00031003056,0.00009562447],"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.00016605393,0.00030959712,0.017310685,0.000022615533,0.00012680814,0.0000062670397,0.00078031176,0.2744618,0.000084389234,0.60631126,0.07534991,0.02507033],"study_design_scores_gemma":[0.0029312307,0.00030706546,0.27489054,0.0027774856,0.00004139495,0.000018837945,0.00031890612,0.1266451,0.0011525764,0.023469763,0.5653926,0.0020544776],"about_ca_topic_score_codex":0.00016263752,"about_ca_topic_score_gemma":0.0019048282,"teacher_disagreement_score":0.8823305,"about_ca_system_score_codex":0.000119494034,"about_ca_system_score_gemma":0.000056030276,"threshold_uncertainty_score":0.90180635},"labels":[],"label_agreement":null}]}