{"meta":{"query_hash":"c65327b5c9f6","filters":{"venue":"International Journal of Space-Based and Situated Computing"},"cohort_total":3,"direct_labels_cover":0,"predictions_cover":3,"exported":3,"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/c65327b5c9f6","api":"https://metacan.xera.ac/api/v1/cohort?venue=International+Journal+of+Space-Based+and+Situated+Computing"},"results":[{"id":"W2165591146","doi":"10.1504/ijssc.2013.051984","title":"Performance evaluation of mixed-bias scheduling schemes for wireless mesh networks","year":2013,"lang":"en","type":"article","venue":"International Journal of Space-Based and Situated Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":16,"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 Guelph","funders":"","keywords":"Computer science; Computer network; Wireless mesh network; Scheduling (production processes); Network packet; Queue; Distributed computing; Wireless; Wireless network; Real-time computing; Engineering; Telecommunications","score_opus":0.027526933685265514,"score_gpt":0.270950328732046,"score_spread":0.24342339504678048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165591146","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.83116394,0.0024159509,0.16091773,0.0003270144,0.00018432684,0.00024063185,0.000120855555,0.00071675197,0.0039127655],"genre_scores_gemma":[0.9610803,0.00024569768,0.038195748,0.000040623425,0.000028446291,0.00004535286,0.000062993175,0.00002245202,0.00027843955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979685,0.00090059795,0.0001349157,0.00014064713,0.00061044586,0.00024485824],"domain_scores_gemma":[0.99020886,0.0060616694,0.00073544285,0.00070034707,0.0018961723,0.00039748542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047007003,0.0008600066,0.000574867,0.0012067436,0.0006470994,0.0006693387,0.0012233596,0.00058045035,0.00064149924],"category_scores_gemma":[0.011513391,0.00020765052,0.00023576888,0.0010982549,0.00046003723,0.0010241449,0.0007593488,0.000372973,0.00011524945],"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.0041567655,0.0009352553,0.013025627,0.00040342903,0.00025129694,0.00012246706,0.00032464915,0.72885716,0.040512174,0.0067877234,0.0016908537,0.20293269],"study_design_scores_gemma":[0.00009245247,0.0009509704,0.0011014908,0.00001359139,0.000027707798,0.00006063037,0.00007359758,0.989652,0.0068082963,0.00076683634,0.00043083957,0.000021544514],"about_ca_topic_score_codex":0.002257294,"about_ca_topic_score_gemma":0.002769872,"teacher_disagreement_score":0.0047007003,"about_ca_system_score_codex":0.0015930193,"about_ca_system_score_gemma":0.0009896123,"threshold_uncertainty_score":0.024860024},"labels":[],"label_agreement":null},{"id":"W2781398886","doi":"10.1504/ijssc.2017.10010065","title":"A* search based next hop selection for routing in opportunistic networks","year":2017,"lang":"en","type":"article","venue":"International Journal of Space-Based and Situated Computing","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","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":"Toronto Metropolitan University","funders":"","keywords":"Computer network; Computer science; Geographic routing; Routing protocol; Hop (telecommunications); Node (physics); Routing (electronic design automation); Distributed computing; Dynamic Source Routing; Benchmark (surveying); Wireless Routing Protocol; Geography; Engineering","score_opus":0.04688670825946679,"score_gpt":0.3033245187005038,"score_spread":0.25643781044103703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2781398886","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.030776225,0.002012978,0.95930433,0.00035251555,0.00021166784,0.00018612831,0.00014855187,0.0006927103,0.006314912],"genre_scores_gemma":[0.6544684,0.001655838,0.33698174,0.00027599747,0.000101857826,0.00034160636,0.00034528703,0.0000599098,0.005769337],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958247,0.00014764699,0.00003266344,0.000057405337,0.0001308332,0.000049043687],"domain_scores_gemma":[0.9988563,0.0006870667,0.0001445083,0.00010027272,0.00016700402,0.00004479998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006411426,0.00037003632,0.0005228404,0.00090546854,0.0007448959,0.00062811584,0.0010175854,0.0006223488,0.0012418436],"category_scores_gemma":[0.0021026405,0.00016286479,0.00034565318,0.0010098496,0.00043529578,0.0008089958,0.0006525211,0.0005343958,0.00029766827],"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.00065260427,0.00033668548,0.0034827362,0.00067351025,0.00022624814,0.00055878714,0.00031403778,0.38361773,0.034541104,0.082598776,0.012445644,0.4805521],"study_design_scores_gemma":[0.000045002816,0.0002455043,0.0005458941,0.000037457165,0.000038989616,0.00046634497,0.00008262284,0.9681199,0.0052451086,0.015976764,0.009168011,0.000028447552],"about_ca_topic_score_codex":0.0023139964,"about_ca_topic_score_gemma":0.0035282734,"teacher_disagreement_score":0.0023139964,"about_ca_system_score_codex":0.00045022502,"about_ca_system_score_gemma":0.0010912031,"threshold_uncertainty_score":0.0046010017},"labels":[],"label_agreement":null},{"id":"W4234782911","doi":"10.1504/ijssc.2018.098691","title":"On the target channel sequence selection for multiple handoffs in cognitive radio-based wireless regional area networks","year":2018,"lang":"en","type":"article","venue":"International Journal of Space-Based and Situated Computing","topic":"Wireless Communication Networks Research","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":"Toronto Metropolitan University","funders":"","keywords":"Cognitive radio; Handover; Channel (broadcasting); Computer network; Computer science; Benchmark (surveying); Throughput; Transmission (telecommunications); Scheme (mathematics); Sequence (biology); Selection (genetic algorithm); Wireless; Real-time computing; Telecommunications; Machine learning; Geography","score_opus":0.06110630847140921,"score_gpt":0.31229287027081953,"score_spread":0.25118656179941035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234782911","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.09594576,0.0010649955,0.90058625,0.00010701682,0.000063279964,0.00009547183,0.000020183581,0.00019270359,0.0019242924],"genre_scores_gemma":[0.9041416,0.0003996679,0.09458714,0.000045196834,0.000036950227,0.00005744694,0.000027921356,0.000015349213,0.00068858964],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992594,0.00030841495,0.000035047,0.000086627915,0.00021133207,0.000099229066],"domain_scores_gemma":[0.9987746,0.0008028979,0.00009944186,0.000082940554,0.00018483496,0.000055340286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076073804,0.00051825034,0.0006048281,0.0005844766,0.0006848162,0.00047484343,0.00077681727,0.00042957114,0.0005834058],"category_scores_gemma":[0.0032017147,0.00016157476,0.00033077496,0.0005550227,0.0006264909,0.00056983647,0.0005245156,0.00039878825,0.00010946619],"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.0004799247,0.00018937518,0.0015592579,0.00016604825,0.00008956281,0.00025162147,0.00026493688,0.7562531,0.021503929,0.0123140905,0.0009978428,0.2059302],"study_design_scores_gemma":[0.000019963807,0.00018681832,0.00032324353,0.0000069163107,0.000022751014,0.00013717203,0.000030978197,0.9945305,0.0025565424,0.0018404182,0.00033193117,0.000012741646],"about_ca_topic_score_codex":0.0036924286,"about_ca_topic_score_gemma":0.0048522362,"teacher_disagreement_score":0.0036924286,"about_ca_system_score_codex":0.00049953314,"about_ca_system_score_gemma":0.0012203087,"threshold_uncertainty_score":0.0073418617},"labels":[],"label_agreement":null}]}