{"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":"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.28084138,0.003678509,0.68870705,0.0021153516,0.000072892086,0.00014145533,0.00020565011,0.00039217487,0.023845538],"genre_scores_gemma":[0.9790259,0.0014085835,0.016487299,0.00018505665,0.00009571285,0.00013692344,0.000102380895,0.00010965843,0.0024483826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991042,0.00038001413,0.000025396528,0.00012242913,0.00018926495,0.00017867214],"domain_scores_gemma":[0.9715641,0.02426428,0.0019805892,0.00046645853,0.0012825542,0.00044194373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034179045,0.0009742963,0.0010029194,0.0011048197,0.0007724013,0.0018473301,0.00095810095,0.0008342588,0.0030094206],"category_scores_gemma":[0.023645243,0.0004670083,0.00066657015,0.00067137444,0.00252794,0.0018926123,0.0012503875,0.0016798603,0.00035985617],"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.00055261,0.00011888782,0.0013310786,0.00020981654,0.00008735426,0.00021557673,0.0005062144,0.7831448,0.010233081,0.18982044,0.00182972,0.011950422],"study_design_scores_gemma":[0.00002365472,0.00005001762,0.00025903963,0.00002958256,0.000014447986,0.000024355635,0.000050388382,0.96621007,0.0012520158,0.03179576,0.00027589407,0.0000146630855],"about_ca_topic_score_codex":0.0039807325,"about_ca_topic_score_gemma":0.0012602191,"teacher_disagreement_score":0.0039807325,"about_ca_system_score_codex":0.0017099321,"about_ca_system_score_gemma":0.0013942403,"threshold_uncertainty_score":0.018075824},"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":"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.029073918,0.013666236,0.7027149,0.18082324,0.0030085263,0.00015100744,0.0003300908,0.0011326455,0.06909952],"genre_scores_gemma":[0.7498939,0.010249564,0.21666865,0.008390275,0.0024427117,0.00038743604,0.00033242314,0.0005782086,0.011056811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.988345,0.006585382,0.00031247656,0.0010704838,0.0028859605,0.00080065476],"domain_scores_gemma":[0.9472517,0.03605157,0.0020551556,0.0094044795,0.0041415975,0.0010955036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0111701125,0.00092912815,0.00083240104,0.0008919036,0.0015570096,0.004181968,0.002922284,0.0051908623,0.007954271],"category_scores_gemma":[0.0859345,0.0007162907,0.00049135264,0.0011311749,0.008015076,0.016676508,0.003006765,0.0042849598,0.0021799796],"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.00025817347,0.00009539601,0.002393011,0.00044912135,0.00010039312,0.00020174893,0.00054630154,0.03209536,0.001302661,0.79735184,0.027401363,0.1378045],"study_design_scores_gemma":[0.000050511728,0.0000605242,0.00028806625,0.00022289329,0.00001988533,0.00029298183,0.00047568732,0.0284889,0.0011515872,0.9406681,0.02824471,0.000036196492],"about_ca_topic_score_codex":0.0032944775,"about_ca_topic_score_gemma":0.002079946,"teacher_disagreement_score":0.0111701125,"about_ca_system_score_codex":0.0022228367,"about_ca_system_score_gemma":0.002724081,"threshold_uncertainty_score":0.059073925},"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":"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.05009107,0.00014764452,0.946767,0.00012452375,0.000018357236,0.00013822514,0.000042948977,0.00082706386,0.0018431933],"genre_scores_gemma":[0.3929816,0.00023022131,0.60457826,0.00007718239,0.00003363726,0.00011631309,0.00012372104,0.00016414715,0.0016948871],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996306,0.00006931981,0.000025259482,0.000063458865,0.00015934913,0.00005201453],"domain_scores_gemma":[0.9992648,0.0003045085,0.00011616007,0.00009437462,0.0001694462,0.00005081224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088048464,0.00083864166,0.00075399963,0.00052264036,0.00036800173,0.00081280177,0.00078333577,0.0006686657,0.0016691549],"category_scores_gemma":[0.002640918,0.0003461952,0.00030411244,0.0005613362,0.00037211727,0.0012975371,0.00078382704,0.0007729351,0.0003543198],"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.00033632963,0.00025824955,0.0018598036,0.00014400705,0.000040584593,0.0001588389,0.00024592303,0.5204461,0.0945744,0.014048781,0.0037835082,0.36410344],"study_design_scores_gemma":[0.00002642424,0.0000491968,0.00029554273,0.0000062981208,0.000008191409,0.000052168434,0.000050394552,0.97961754,0.015642615,0.0034314145,0.0008120411,0.000008209167],"about_ca_topic_score_codex":0.0018367114,"about_ca_topic_score_gemma":0.0030558086,"teacher_disagreement_score":0.0018367114,"about_ca_system_score_codex":0.00089739665,"about_ca_system_score_gemma":0.0011014038,"threshold_uncertainty_score":0.006511092},"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":"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.3411077,0.0018370535,0.63741565,0.0032208303,0.00008250256,0.000080211394,0.00014553496,0.00023672111,0.015873915],"genre_scores_gemma":[0.97827244,0.0006557642,0.020240022,0.00007329744,0.000041577045,0.00004510198,0.000022917468,0.00003178921,0.0006170424],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889106,0.0005031082,0.00003046195,0.000094808594,0.00031468342,0.00016580643],"domain_scores_gemma":[0.97229373,0.025114534,0.0010214627,0.00071074464,0.0006283124,0.0002311774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023116935,0.0005677787,0.0005022106,0.0009804645,0.000682168,0.0009498444,0.000641613,0.0010834113,0.0011740772],"category_scores_gemma":[0.022525856,0.00031864867,0.00035063524,0.0007702209,0.0023499841,0.002870989,0.0011828013,0.001063717,0.000111761205],"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.00011971521,0.00003527615,0.00089874514,0.00007484616,0.000019269437,0.0001246565,0.0001753829,0.85238993,0.0066038286,0.1292158,0.00041480066,0.00992775],"study_design_scores_gemma":[0.000010648418,0.000053166896,0.0004468172,0.000016502141,0.0000087034105,0.00008211672,0.00004487771,0.95014834,0.0016100374,0.04727729,0.00028412373,0.000017339065],"about_ca_topic_score_codex":0.002284924,"about_ca_topic_score_gemma":0.0012713125,"teacher_disagreement_score":0.0023116935,"about_ca_system_score_codex":0.002059355,"about_ca_system_score_gemma":0.00070295547,"threshold_uncertainty_score":0.014941752},"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":"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.056620784,0.00019810279,0.91831374,0.00018470547,0.000076937606,0.00011918136,0.00013808164,0.008064414,0.016284088],"genre_scores_gemma":[0.39675418,0.00015477264,0.592838,0.00008633755,0.000036297697,0.00022561442,0.00041106273,0.00034644472,0.00914725],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968004,0.000049190643,0.000015903175,0.000038739345,0.00015879812,0.000057359503],"domain_scores_gemma":[0.9993818,0.00016076703,0.00003742734,0.0001690757,0.00022424453,0.000026769421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036982913,0.00056288077,0.00027987294,0.0005034829,0.0002727895,0.00060663285,0.0010887639,0.00026273358,0.004749296],"category_scores_gemma":[0.0012164981,0.0001645111,0.0002976101,0.0006647336,0.00040682472,0.0007415267,0.0006729275,0.0006135684,0.0011491933],"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.0006342803,0.00021488358,0.0014757714,0.00025356782,0.000050585655,0.00033292198,0.00035436827,0.40190655,0.08083324,0.065155044,0.011707174,0.4370816],"study_design_scores_gemma":[0.000058015197,0.000075250646,0.00017669381,0.000011318399,0.00000980652,0.00007788178,0.000022197026,0.9582549,0.02632016,0.0075905607,0.0073914835,0.000011793508],"about_ca_topic_score_codex":0.005331166,"about_ca_topic_score_gemma":0.006210273,"teacher_disagreement_score":0.005331166,"about_ca_system_score_codex":0.0006774602,"about_ca_system_score_gemma":0.0013225166,"threshold_uncertainty_score":0.015887976},"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":"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.024817055,0.00016623775,0.9724726,0.00012693934,0.000033148168,0.000031008098,0.00001251836,0.00013767366,0.00220287],"genre_scores_gemma":[0.942394,0.00025860543,0.055585112,0.000059736532,0.000029244686,0.00010063044,0.000022662403,0.000049469323,0.00150058],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939525,0.00015892512,0.000029192039,0.00015483642,0.00017508093,0.000086705324],"domain_scores_gemma":[0.9979997,0.0011889195,0.00041876774,0.00011678951,0.00020378924,0.00007191818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012261168,0.0007252303,0.0005467461,0.00040141385,0.00038494234,0.0009937339,0.00085340213,0.00044753298,0.0009716543],"category_scores_gemma":[0.005605798,0.00026209085,0.00029146954,0.0003985038,0.001066423,0.0007305441,0.00092898705,0.0009798201,0.00014953381],"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.000060159957,0.000030121877,0.0002691943,0.00004163393,0.000016413944,0.000027210825,0.00006555061,0.93193233,0.0060465187,0.042341188,0.00033347018,0.018836163],"study_design_scores_gemma":[0.0000031250502,0.000011349283,0.000025489295,0.0000016403702,0.0000012054601,0.0000025928584,0.0000029718028,0.9969116,0.00037897282,0.0025156157,0.00014394539,0.0000015512476],"about_ca_topic_score_codex":0.0024537502,"about_ca_topic_score_gemma":0.0017867858,"teacher_disagreement_score":0.0024537502,"about_ca_system_score_codex":0.001324128,"about_ca_system_score_gemma":0.0011864665,"threshold_uncertainty_score":0.009607315},"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":"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.056358587,0.00031358132,0.9407073,0.00018153679,0.000027262802,0.000047660033,0.000034823996,0.00022959476,0.002099468],"genre_scores_gemma":[0.898309,0.00036782253,0.09836559,0.00008949466,0.00006184517,0.0001330121,0.000057296354,0.000031270072,0.0025845794],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906594,0.00027394184,0.00003021998,0.0002451656,0.00027979063,0.00010494792],"domain_scores_gemma":[0.9990589,0.00050870253,0.00013389961,0.000104021485,0.00012680117,0.00006763631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009585575,0.0006131104,0.0007445286,0.0007723972,0.00051013904,0.00082922215,0.0014220828,0.000918429,0.0008643047],"category_scores_gemma":[0.0022780318,0.0005834984,0.0005339811,0.0008513364,0.0007593535,0.0017760356,0.0013573653,0.0005025738,0.00020979147],"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.00027787307,0.00008533888,0.0018211122,0.00009042968,0.000060108025,0.00023640854,0.00013363556,0.9126811,0.01826722,0.018851394,0.0006055806,0.046889793],"study_design_scores_gemma":[0.000019696889,0.00010965433,0.0002685354,0.000004596029,0.000016527987,0.00008655134,0.000024901718,0.993317,0.001583166,0.0038410719,0.00071736035,0.000010865878],"about_ca_topic_score_codex":0.0015498807,"about_ca_topic_score_gemma":0.0014884787,"teacher_disagreement_score":0.0015498807,"about_ca_system_score_codex":0.0007255569,"about_ca_system_score_gemma":0.00045679288,"threshold_uncertainty_score":0.005264282},"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":"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.0014386203,0.00006265477,0.995375,0.00013849279,0.00004796272,0.000024020535,0.000046649966,0.00013444769,0.0027322304],"genre_scores_gemma":[0.30389902,0.0008116656,0.6809066,0.000473295,0.0005779597,0.0004295787,0.00023535448,0.000261992,0.012404523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99705434,0.0007832833,0.00017900497,0.00041114897,0.00130749,0.00026482233],"domain_scores_gemma":[0.9978241,0.0010903283,0.00019997275,0.00032903877,0.00041471727,0.00014197119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050286474,0.0010263876,0.0009802207,0.000930211,0.0013566472,0.003619874,0.0026017197,0.0015016977,0.0033017818],"category_scores_gemma":[0.0064038425,0.0006676233,0.0015099276,0.0012748119,0.0024700768,0.004963274,0.0027082954,0.0038481222,0.001017343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016622342,0.000020385241,0.00006766065,0.000018966897,0.000009331904,0.00007328472,0.00006542978,0.043523192,0.00078747224,0.94847083,0.00075503415,0.006191867],"study_design_scores_gemma":[0.00001255064,0.00003963,0.00006587363,0.00001558527,0.000023286699,0.00010111182,0.0000163465,0.4989048,0.001168439,0.49135387,0.008271929,0.00002656256],"about_ca_topic_score_codex":0.002056885,"about_ca_topic_score_gemma":0.0016802201,"teacher_disagreement_score":0.0050286474,"about_ca_system_score_codex":0.0021346454,"about_ca_system_score_gemma":0.0025635944,"threshold_uncertainty_score":0.02659434},"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":"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.012816066,0.00023095885,0.9828857,0.00024825404,0.00009196936,0.0001755287,0.000085142165,0.0019443056,0.0015220296],"genre_scores_gemma":[0.6703594,0.00024033942,0.32653153,0.00034447934,0.00006714725,0.00024514747,0.00022010774,0.00013416234,0.0018576421],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99759704,0.00069050526,0.000116324074,0.00049137656,0.0008983271,0.00020643245],"domain_scores_gemma":[0.99369884,0.0034426972,0.00062112685,0.0011219761,0.0008839753,0.0002314048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002850251,0.00064001925,0.0010547694,0.0010034493,0.0008506265,0.0012997233,0.0021465558,0.0012664365,0.001613788],"category_scores_gemma":[0.013242996,0.00040195513,0.0004636764,0.0007321192,0.0021805284,0.0025731751,0.0029507014,0.0015781786,0.0003737575],"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.000551129,0.0001260937,0.0020544135,0.00017943846,0.00006039947,0.00041818863,0.00032473984,0.74081093,0.01403303,0.06819841,0.0033968193,0.16984642],"study_design_scores_gemma":[0.000020838215,0.00003426355,0.00008023225,0.000010534925,0.0000053468093,0.000059393074,0.000019885558,0.9810838,0.0028778987,0.014862005,0.00093213737,0.000013686278],"about_ca_topic_score_codex":0.006377168,"about_ca_topic_score_gemma":0.0035406407,"teacher_disagreement_score":0.006377168,"about_ca_system_score_codex":0.0018417833,"about_ca_system_score_gemma":0.0023460512,"threshold_uncertainty_score":0.015073717},"labels":[],"label_agreement":null}]}