{"meta":{"query_hash":"51d8379599cd","filters":{"venue":"網際網路技術學刊"},"cohort_total":5,"direct_labels_cover":0,"predictions_cover":5,"exported":5,"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/51d8379599cd","api":"https://metacan.xera.ac/api/v1/cohort?venue=%E7%B6%B2%E9%9A%9B%E7%B6%B2%E8%B7%AF%E6%8A%80%E8%A1%93%E5%AD%B8%E5%88%8A"},"results":[{"id":"W2128098252","doi":"10.6138/jit.2014.15.1.12","title":"Equilibrium Flows and Path Dilation for a Network Forwarding Game","year":2014,"lang":"en","type":"article","venue":"網際網路技術學刊","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Shortest path problem; Packet forwarding; Node (physics); Path (computing); Network packet; Routing (electronic design automation); Nash equilibrium; Relay; Computer network; Flow (mathematics); Flow network; Mathematical optimization; Graph; Mathematics; Theoretical computer science","score_opus":0.010232420737181731,"score_gpt":0.22333016454751328,"score_spread":0.21309774381033156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128098252","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.6465158,0.0001445442,0.33843115,0.00064693665,0.000038148173,0.00028043534,0.00022413582,0.0002201192,0.013498714],"genre_scores_gemma":[0.954964,0.00014683869,0.04244648,0.00007891027,0.00001887829,0.0002432611,0.000093979084,0.000049223378,0.00195853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981342,0.00094660267,0.00007285004,0.00025964892,0.00030155672,0.00028523765],"domain_scores_gemma":[0.98538613,0.011455395,0.0016772094,0.0005720852,0.0004347567,0.00047445172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00294866,0.0009969533,0.0008897807,0.0009421397,0.0008714155,0.0016868856,0.0010366075,0.0014214105,0.0036441528],"category_scores_gemma":[0.016475229,0.0005020368,0.0005421596,0.00058460695,0.0025390899,0.0032687976,0.001181861,0.0011763171,0.00021541229],"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.00045791548,0.00037283477,0.0016730551,0.00010642179,0.00004885358,0.00020217273,0.0004139909,0.6080044,0.013964994,0.36230162,0.0010803889,0.011373346],"study_design_scores_gemma":[0.000073114265,0.00015371287,0.0005220519,0.000010297658,0.000015649417,0.00008289317,0.00008960163,0.8710368,0.0020482633,0.12540214,0.0005463598,0.000019066701],"about_ca_topic_score_codex":0.0017218268,"about_ca_topic_score_gemma":0.0008199188,"teacher_disagreement_score":0.0036441528,"about_ca_system_score_codex":0.0033163182,"about_ca_system_score_gemma":0.0013598858,"threshold_uncertainty_score":0.02406162},"labels":[],"label_agreement":null},{"id":"W2494852310","doi":"10.6138/jit.2015.16.2.20140410c","title":"A Comparison Study of Connected Vehicle Systems between Named Data Networking and IP","year":2015,"lang":"en","type":"article","venue":"網際網路技術學刊","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Computer network; Cloud computing; Network packet; Protocol (science); Internet Protocol; The Internet; Packet loss; Dissemination; Vehicular ad hoc network; Wireless ad hoc network; Distributed computing; Wireless; Telecommunications; Operating system","score_opus":0.28642811398053614,"score_gpt":0.3495136429202709,"score_spread":0.06308552893973474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2494852310","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.94689167,0.0006625468,0.03756554,0.00018558711,0.00010241053,0.0001140184,0.00022612534,0.00023166774,0.014020446],"genre_scores_gemma":[0.9957228,0.00016269574,0.0034097792,0.000011883889,0.000005522791,0.000024429357,0.00011704596,0.000013673915,0.0005320722],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993268,0.00023553091,0.000025513431,0.00009326374,0.00020754867,0.00011139558],"domain_scores_gemma":[0.9983758,0.0008857319,0.00013225015,0.00012116458,0.0003986341,0.00008652754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009995279,0.00041408985,0.0003508165,0.0010160276,0.00046016506,0.0006470679,0.00066259765,0.0004015044,0.0010608668],"category_scores_gemma":[0.002961212,0.00011846525,0.00036091454,0.00084517134,0.00040129948,0.0011686705,0.00036803802,0.00035435526,0.00010308856],"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.00050964317,0.0002730711,0.014645103,0.00023560708,0.00013236604,0.00028569042,0.00019235027,0.9111183,0.00988315,0.021829946,0.0014007472,0.03949407],"study_design_scores_gemma":[0.000015141173,0.0005123021,0.003157641,0.000010920203,0.000030584524,0.000070799,0.00014208964,0.9884461,0.003903112,0.002091682,0.0016047457,0.000014941187],"about_ca_topic_score_codex":0.0043300586,"about_ca_topic_score_gemma":0.002597211,"teacher_disagreement_score":0.0043300586,"about_ca_system_score_codex":0.001152009,"about_ca_system_score_gemma":0.00048832287,"threshold_uncertainty_score":0.008609712},"labels":[],"label_agreement":null},{"id":"W25508443","doi":"10.6138/jit.2011.12.3.09","title":"A General Availability-Aware Survivable Routing Architecture on GMPLS-Based Recovery","year":2011,"lang":"en","type":"article","venue":"網際網路技術學刊","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Multiprotocol Label Switching; Backup; Label switching; Routing (electronic design automation); Distributed computing; Automatically switched optical network; Survivability; Routing control plane; Quality of service","score_opus":0.019903233018596988,"score_gpt":0.20908145973240194,"score_spread":0.18917822671380496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W25508443","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.025851892,0.00037666954,0.964839,0.00022531071,0.000061278486,0.00007877999,0.000053094762,0.001092174,0.0074217976],"genre_scores_gemma":[0.6133852,0.000793175,0.3785291,0.0001376541,0.000072468436,0.000103658844,0.00019311761,0.000078109435,0.006707475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998111,0.00003182786,0.000009871018,0.000047345424,0.00007279629,0.00002703827],"domain_scores_gemma":[0.999907,0.000010985478,0.000014240649,0.000030801162,0.00003077368,0.0000062897766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002954505,0.00035118207,0.00021973874,0.00031401016,0.000354827,0.00059779955,0.0009637869,0.00040950676,0.0009930454],"category_scores_gemma":[0.0002890407,0.00014914137,0.00035585888,0.00032798023,0.00041202165,0.0008546233,0.00059451844,0.0004402685,0.00027115695],"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.00016014253,0.00009104341,0.00055435614,0.0002548579,0.00006574869,0.00044603724,0.00018709555,0.4833196,0.12601799,0.17067686,0.0041487236,0.21407752],"study_design_scores_gemma":[0.000022772834,0.00014126947,0.0003906189,0.000020014328,0.00003994768,0.00034634816,0.000042257343,0.94016165,0.015162436,0.027662335,0.015973922,0.0000365229],"about_ca_topic_score_codex":0.0014409464,"about_ca_topic_score_gemma":0.0017858826,"teacher_disagreement_score":0.0014409464,"about_ca_system_score_codex":0.0004383879,"about_ca_system_score_gemma":0.00061670644,"threshold_uncertainty_score":0.0033220649},"labels":[],"label_agreement":null},{"id":"W2799830857","doi":"10.6138/jit.2018.19.6.20161017","title":"Distributed and Load Adaptive Energy Management Algorithm for Ethernet Green Routers","year":2018,"lang":"en","type":"article","venue":"網際網路技術學刊","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Energy consumption; Ethernet; Algorithm; Network packet; Redundancy (engineering); Instruction prefetch; Efficient energy use; Real-time computing; Computer network","score_opus":0.008672242384144878,"score_gpt":0.20837041730937617,"score_spread":0.1996981749252313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799830857","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.078296736,0.00017691863,0.91762495,0.00017876919,0.00004492673,0.0000674362,0.000027112445,0.0005110024,0.0030721503],"genre_scores_gemma":[0.84098953,0.00008948853,0.15636137,0.000067066016,0.00001755746,0.00011217613,0.000058579197,0.00002869356,0.0022755913],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998658,0.000022332539,0.000008244943,0.000038422582,0.000038543916,0.000026776463],"domain_scores_gemma":[0.9998196,0.00007114754,0.000028757282,0.000016528775,0.000051363517,0.000012622886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037343657,0.00039380472,0.00039355402,0.00043092176,0.00038325635,0.00053728226,0.00080511486,0.00039864285,0.0011408633],"category_scores_gemma":[0.0008702402,0.00014339093,0.00019718539,0.0002942106,0.0002492254,0.0006268916,0.00049482274,0.00030819201,0.00013634164],"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.00017217558,0.00012534631,0.0014940818,0.000038692302,0.000025914995,0.00004882143,0.00008909738,0.8256414,0.007954705,0.009849798,0.00138325,0.15317668],"study_design_scores_gemma":[0.000008915371,0.000013874846,0.000088020846,0.0000011640277,0.0000022246186,0.0000063663047,0.0000064487244,0.99829394,0.0006885271,0.0006926876,0.00019600953,0.0000017526432],"about_ca_topic_score_codex":0.0018218489,"about_ca_topic_score_gemma":0.0028326092,"teacher_disagreement_score":0.0018218489,"about_ca_system_score_codex":0.00070316985,"about_ca_system_score_gemma":0.0007534152,"threshold_uncertainty_score":0.0051018596},"labels":[],"label_agreement":null},{"id":"W4391227113","doi":"10.53106/160792642024012501011","title":"A Quantitative Characterization of Audience Response System Research","year":2024,"lang":"en","type":"article","venue":"網際網路技術學刊","topic":"Innovative Teaching Methods","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Agencia Estatal de Investigación; European Regional Development Fund","keywords":"Computer science; Characterization (materials science); Audience response; Human–computer interaction; Multimedia; Information retrieval; Telecommunications","score_opus":0.2847468089555571,"score_gpt":0.5650671552836478,"score_spread":0.2803203463280907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391227113","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.61546403,0.0092206085,0.12452332,0.0034036683,0.00058274734,0.006362226,0.01784743,0.0013721245,0.22122377],"genre_scores_gemma":[0.9462443,0.0016166505,0.034137793,0.00031271338,0.00030323764,0.0047710417,0.004999117,0.00021959623,0.0073956144],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9135712,0.03932175,0.011470507,0.006327974,0.027745964,0.0015626719],"domain_scores_gemma":[0.5276155,0.35378698,0.039174628,0.022359654,0.054981332,0.0020820035],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.064152546,0.00076057744,0.0009233917,0.037894946,0.0016309106,0.008231958,0.0015040904,0.0013323374,0.010028046],"category_scores_gemma":[0.2633271,0.0003643552,0.0012545856,0.042850994,0.0026276407,0.0066633173,0.0035902816,0.0009654629,0.0025404235],"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.0008183742,0.0006029222,0.39974344,0.013333277,0.0015078369,0.0004229654,0.049377035,0.004966449,0.013037436,0.07280035,0.015935358,0.42745462],"study_design_scores_gemma":[0.00013863227,0.0021710359,0.691436,0.0031706637,0.00094131776,0.001219854,0.045134917,0.018201536,0.01498382,0.046997797,0.17530663,0.0002977857],"about_ca_topic_score_codex":0.00114278,"about_ca_topic_score_gemma":0.0008298493,"teacher_disagreement_score":0.96210504,"about_ca_system_score_codex":0.0034407042,"about_ca_system_score_gemma":0.0029297462,"threshold_uncertainty_score":0.33927512},"labels":[],"label_agreement":null}]}