{"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5257263,0.00014357624,0.4729424,0.00043448186,0.00056678837,0.00014128648,3.8512908e-7,0.000013431191,0.000031338695],"genre_scores_gemma":[0.9539071,0.000029831888,0.045537334,0.00009904762,0.000402002,0.000005771811,0.0000039784995,0.000010920058,0.000004031887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797696,0.00010492274,0.0006475472,0.00020495473,0.00083920115,0.00022643252],"domain_scores_gemma":[0.99549156,0.00043335895,0.00090878946,0.00015619198,0.0029132809,0.00009683428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001893869,0.00015410637,0.0002658501,0.00022010208,0.0000983812,0.0002075764,0.00070511026,0.00008277028,0.000010079948],"category_scores_gemma":[0.00013633983,0.00013854311,0.00011750426,0.00020328391,0.00005296941,0.00056895666,0.00012286229,0.00023090967,0.0000012094264],"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.00004636992,0.00007939426,0.0073326617,0.000021798207,0.00015187354,0.0000032207163,0.00016674548,0.5003074,0.0012248948,0.0046384116,0.00017590547,0.48585135],"study_design_scores_gemma":[0.0016405657,0.00014474642,0.003926861,0.00038652727,0.00003238953,0.00003161445,0.000039780676,0.98937017,0.0038671785,0.00038466483,0.000042816664,0.00013271504],"about_ca_topic_score_codex":0.000012287574,"about_ca_topic_score_gemma":0.000001892035,"teacher_disagreement_score":0.4890628,"about_ca_system_score_codex":0.00009604989,"about_ca_system_score_gemma":0.00021652403,"threshold_uncertainty_score":0.5649624},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08558986,0.00004962448,0.91009766,0.0029388594,0.0009810379,0.00011612147,0.0000020645152,0.000026223519,0.0001985401],"genre_scores_gemma":[0.972472,0.000017487939,0.026484014,0.00039893657,0.0005873445,0.0000012164252,0.0000074814748,0.00001279324,0.000018736193],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982975,0.00007645576,0.00057176704,0.0002673791,0.00044848467,0.00033839833],"domain_scores_gemma":[0.99766016,0.0005263101,0.0007255131,0.00019524344,0.00071839726,0.00017440534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014435727,0.00017151366,0.00028645288,0.0003084984,0.00039574134,0.0009911238,0.0009488401,0.000105244224,0.000005109327],"category_scores_gemma":[0.00009605278,0.00016344979,0.000116015115,0.00011389255,0.00007255686,0.00047878365,0.00014019925,0.00040003224,6.4824803e-7],"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.0005675952,0.00029600214,0.054036766,0.000038508206,0.00018571952,0.0006190009,0.00038809745,0.26833802,0.00073332316,0.01809527,0.00051224435,0.65618944],"study_design_scores_gemma":[0.0020762265,0.00016763854,0.0023093987,0.0003880723,0.000013513903,0.000086849956,0.000040068844,0.9941206,0.00010911539,0.00040378756,0.00011813063,0.0001666064],"about_ca_topic_score_codex":0.000071313516,"about_ca_topic_score_gemma":0.000016226753,"teacher_disagreement_score":0.8868821,"about_ca_system_score_codex":0.000117390126,"about_ca_system_score_gemma":0.00040676328,"threshold_uncertainty_score":0.955743},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24126416,0.00008067925,0.750764,0.007342192,0.00028510828,0.0002095648,0.0000028584636,0.00002430001,0.00002709818],"genre_scores_gemma":[0.9904282,0.000022146321,0.0080844425,0.0010246916,0.00039776263,0.000010656835,0.000012071928,0.000012920073,0.00000712542],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981393,0.00026537353,0.00044016496,0.0002607467,0.0005905877,0.0003038336],"domain_scores_gemma":[0.9941796,0.0034605009,0.00047576264,0.00016786972,0.0016184015,0.00009786527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014050987,0.00016859407,0.00021438817,0.0003899738,0.00030456978,0.00027721428,0.0010765751,0.000086037566,0.000005914292],"category_scores_gemma":[0.00032472925,0.00013065897,0.00009830718,0.0004775045,0.00019314667,0.00022723095,0.00011379508,0.00050830765,0.000001149217],"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.0022085584,0.00052919105,0.009542766,0.000015361962,0.00026640232,0.000052804626,0.0011587741,0.93306005,0.0017216668,0.014014251,0.0020184694,0.035411693],"study_design_scores_gemma":[0.002488455,0.0003285461,0.0012418835,0.0006219735,0.0000044909234,0.00003733245,0.00005761712,0.9916717,0.002214363,0.0011170965,0.00007980883,0.0001367343],"about_ca_topic_score_codex":0.000035232384,"about_ca_topic_score_gemma":0.00003932367,"teacher_disagreement_score":0.74916404,"about_ca_system_score_codex":0.00018726585,"about_ca_system_score_gemma":0.00029600682,"threshold_uncertainty_score":0.5328118},"labels":[],"label_agreement":null}]}