{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":5,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":5,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"51d8379599cd","filters":{"venue":"網際網路技術學刊"}},"results":[{"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Xiaowei Xu","is_ca":false},{"name":"Tao Jiang","is_ca":false},{"name":"Lu Pu","is_ca":false},{"name":"Tony Z. Qiu","is_ca":false},{"name":"Yu Hen Hu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2864281139805361,"gpt":0.3495136429202709,"spread":0.06308552893973474,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009995279,0.0004140899,0.0003508165,0.001016028,0.0004601651,0.0006470679,0.0006625977,0.0004015044,0.001060867],"category_scores_gemma":[0.002961212,0.0001184653,0.0003609145,0.0008451713,0.0004012995,0.00116867,0.000368038,0.0003543553,0.0001030886],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001152009,"about_ca_system_score_gemma":0.0004883229,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004330059,"about_ca_topic_score_gemma":0.002597211,"domain_scores_codex":[0.9993268,0.0002355309,0.00002551343,0.00009326374,0.0002075487,0.0001113956],"domain_scores_gemma":[0.9983758,0.0008857319,0.0001322501,0.0001211646,0.0003986341,0.00008652754],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005096432,0.0002730711,0.0146451,0.0002356071,0.000132366,0.0002856904,0.0001923503,0.9111183,0.00988315,0.02182995,0.001400747,0.03949407],"study_design_scores_gemma":[0.00001514117,0.0005123021,0.003157641,0.0000109202,0.00003058452,0.000070799,0.0001420896,0.9884461,0.003903112,0.002091682,0.001604746,0.00001494119],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9468917,0.0006625468,0.03756554,0.0001855871,0.0001024105,0.0001140184,0.0002261253,0.0002316677,0.01402045],"genre_scores_gemma":[0.9957228,0.0001626957,0.003409779,0.00001188389,0.000005522791,0.00002442936,0.000117046,0.00001367392,0.0005320722],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004330059,"threshold_uncertainty_score":0.008609712,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"George Karakostas","is_ca":true},{"name":"Anastasios Viglas","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01023242073718173,"gpt":0.2233301645475133,"spread":0.2130977438103316,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00294866,0.0009969533,0.0008897807,0.0009421397,0.0008714155,0.001686886,0.001036608,0.00142141,0.003644153],"category_scores_gemma":[0.01647523,0.0005020368,0.0005421596,0.000584607,0.00253909,0.003268798,0.001181861,0.001176317,0.0002154123],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003316318,"about_ca_system_score_gemma":0.001359886,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001721827,"about_ca_topic_score_gemma":0.0008199188,"domain_scores_codex":[0.9981342,0.0009466027,0.00007285004,0.0002596489,0.0003015567,0.0002852376],"domain_scores_gemma":[0.9853861,0.0114554,0.001677209,0.0005720852,0.0004347567,0.0004744517],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004579155,0.0003728348,0.001673055,0.0001064218,0.00004885358,0.0002021727,0.0004139909,0.6080044,0.01396499,0.3623016,0.001080389,0.01137335],"study_design_scores_gemma":[0.00007311426,0.0001537129,0.0005220519,0.00001029766,0.00001564942,0.00008289317,0.00008960163,0.8710368,0.002048263,0.1254021,0.0005463598,0.0000190667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6465158,0.0001445442,0.3384311,0.0006469366,0.00003814817,0.0002804353,0.0002241358,0.0002201192,0.01349871],"genre_scores_gemma":[0.954964,0.0001468387,0.04244648,0.00007891027,0.00001887829,0.0002432611,0.00009397908,0.00004922338,0.00195853],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003644153,"threshold_uncertainty_score":0.02406162,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"János Tapolcai","is_ca":false},{"name":"Shin Jer Yang","is_ca":false},{"name":"Pin‐Han Ho","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01990323301859699,"gpt":0.2090814597324019,"spread":0.189178226713805,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002954505,0.0003511821,0.0002197387,0.0003140102,0.000354827,0.0005977995,0.0009637869,0.0004095068,0.0009930454],"category_scores_gemma":[0.0002890407,0.0001491414,0.0003558589,0.0003279802,0.0004120216,0.0008546233,0.0005945184,0.0004402685,0.000271157],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004383879,"about_ca_system_score_gemma":0.0006167064,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001440946,"about_ca_topic_score_gemma":0.001785883,"domain_scores_codex":[0.9998111,0.00003182786,0.000009871018,0.00004734542,0.00007279629,0.00002703827],"domain_scores_gemma":[0.999907,0.00001098548,0.00001424065,0.00003080116,0.00003077368,0.000006289777],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001601425,0.00009104341,0.0005543561,0.0002548579,0.00006574869,0.0004460372,0.0001870955,0.4833196,0.126018,0.1706769,0.004148724,0.2140775],"study_design_scores_gemma":[0.00002277283,0.0001412695,0.0003906189,0.00002001433,0.00003994768,0.0003463482,0.00004225734,0.9401616,0.01516244,0.02766233,0.01597392,0.0000365229],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02585189,0.0003766695,0.964839,0.0002253107,0.00006127849,0.00007877999,0.00005309476,0.001092174,0.007421798],"genre_scores_gemma":[0.6133852,0.000793175,0.3785291,0.0001376541,0.00007246844,0.0001036588,0.0001931176,0.00007810943,0.006707475],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001440946,"threshold_uncertainty_score":0.003322065,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Mohamad Khattar Awad","is_ca":false},{"name":"Phone Lin","is_ca":false},{"name":"Gi Ren Liu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008672242384144878,"gpt":0.2083704173093762,"spread":0.1996981749252313,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003734366,0.0003938047,0.000393554,0.0004309218,0.0003832564,0.0005372823,0.0008051149,0.0003986428,0.001140863],"category_scores_gemma":[0.0008702402,0.0001433909,0.0001971854,0.0002942106,0.0002492254,0.0006268916,0.0004948227,0.000308192,0.0001363416],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007031698,"about_ca_system_score_gemma":0.0007534152,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001821849,"about_ca_topic_score_gemma":0.002832609,"domain_scores_codex":[0.9998658,0.00002233254,0.000008244943,0.00003842258,0.00003854392,0.00002677646],"domain_scores_gemma":[0.9998196,0.00007114754,0.00002875728,0.00001652877,0.00005136352,0.00001262289],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001721756,0.0001253463,0.001494082,0.0000386923,0.00002591499,0.00004882143,0.00008909738,0.8256414,0.007954705,0.009849798,0.00138325,0.1531767],"study_design_scores_gemma":[0.000008915371,0.00001387485,0.00008802085,0.000001164028,0.000002224619,0.000006366305,0.000006448724,0.9982939,0.0006885271,0.0006926876,0.0001960095,0.000001752643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07829674,0.0001769186,0.917625,0.0001787692,0.00004492673,0.0000674362,0.00002711244,0.0005110024,0.00307215],"genre_scores_gemma":[0.8409895,0.00008948853,0.1563614,0.00006706602,0.00001755746,0.0001121761,0.0000585792,0.00002869356,0.002275591],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001821849,"threshold_uncertainty_score":0.00510186,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Juan J. López-Jiménez Juan J. López-Jiménez","is_ca":false},{"name":"Juan José López Jiménez","is_ca":false},{"name":"Sofia Ouhbi José A. García-Berná","is_ca":false},{"name":"Begoña Moros Valle Sofia Ouhbi","is_ca":false},{"name":"José L. Fernández-Alemán Begoña Moros Valle","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2847468089555571,"gpt":0.5650671552836478,"spread":0.2803203463280907,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.06415255,0.0007605774,0.0009233917,0.03789495,0.001630911,0.008231958,0.00150409,0.001332337,0.01002805],"category_scores_gemma":[0.2633271,0.0003643552,0.001254586,0.04285099,0.002627641,0.006663317,0.003590282,0.0009654629,0.002540424],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003440704,"about_ca_system_score_gemma":0.002929746,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00114278,"about_ca_topic_score_gemma":0.0008298493,"domain_scores_codex":[0.9135712,0.03932175,0.01147051,0.006327974,0.02774596,0.001562672],"domain_scores_gemma":[0.5276155,0.353787,0.03917463,0.02235965,0.05498133,0.002082004],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.0008183742,0.0006029222,0.3997434,0.01333328,0.001507837,0.0004229654,0.04937704,0.004966449,0.01303744,0.07280035,0.01593536,0.4274546],"study_design_scores_gemma":[0.0001386323,0.002171036,0.691436,0.003170664,0.0009413178,0.001219854,0.04513492,0.01820154,0.01498382,0.0469978,0.1753066,0.0002977857],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.615464,0.009220609,0.1245233,0.003403668,0.0005827473,0.006362226,0.01784743,0.001372125,0.2212238],"genre_scores_gemma":[0.9462443,0.00161665,0.03413779,0.0003127134,0.0003032376,0.004771042,0.004999117,0.0002195962,0.007395614],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.962105,"threshold_uncertainty_score":0.3392751,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}