{"meta":{"query_hash":"cc17cbc6e1d5","filters":{"venue":"International Journal of Information Technology Communications and Convergence"},"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/cc17cbc6e1d5","api":"https://metacan.xera.ac/api/v1/cohort?venue=International+Journal+of+Information+Technology+Communications+and+Convergence"},"results":[{"id":"W2032795059","doi":"10.1504/ijitcc.2011.042124","title":"On the top-down evaluation of tree inclusion problem","year":2011,"lang":"en","type":"article","venue":"International Journal of Information Technology Communications and Convergence","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"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 Winnipeg","funders":"","keywords":"Combinatorics; Tree (set theory); Mathematics; Space (punctuation); Matching (statistics); Node (physics); Set (abstract data type); Discrete mathematics; Computer science; Physics; Statistics","score_opus":0.03999548666942057,"score_gpt":0.32010495912081555,"score_spread":0.28010947245139495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032795059","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.062215723,0.0013516031,0.8857849,0.0029220781,0.00033741354,0.00056643883,0.0008041319,0.0040143933,0.04200344],"genre_scores_gemma":[0.26720494,0.00084637874,0.7046464,0.0010651613,0.00031162406,0.00039268218,0.0024131848,0.0011355638,0.02198405],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996691,0.0008998852,0.00014903968,0.0005180851,0.0011380324,0.0006040593],"domain_scores_gemma":[0.9956077,0.0025931657,0.00016465843,0.0007203763,0.0006880497,0.00022608708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024008467,0.0011401605,0.0015715378,0.0011597229,0.0015665487,0.003330704,0.0027745531,0.0016879652,0.01638275],"category_scores_gemma":[0.009636965,0.00050116784,0.0013150033,0.0021953615,0.0014673029,0.008608081,0.004905394,0.002739309,0.002491149],"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.0015707185,0.00063150417,0.0015803565,0.0011247664,0.00009061304,0.0006244881,0.00045767808,0.114931226,0.00977083,0.20462732,0.04528495,0.61930555],"study_design_scores_gemma":[0.00019478876,0.00021770736,0.00047331073,0.00014157756,0.00011391058,0.00037934308,0.00036909548,0.6237407,0.011329134,0.33958602,0.023410887,0.000043490574],"about_ca_topic_score_codex":0.004446834,"about_ca_topic_score_gemma":0.0055718003,"teacher_disagreement_score":0.01638275,"about_ca_system_score_codex":0.0016997958,"about_ca_system_score_gemma":0.0019143743,"threshold_uncertainty_score":0.054805756},"labels":[],"label_agreement":null},{"id":"W2082076097","doi":"10.1504/ijitcc.2011.042125","title":"Unordered tree matching and ordered tree matching: the evaluation of tree pattern queries","year":2011,"lang":"en","type":"article","venue":"International Journal of Information Technology Communications and Convergence","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":1,"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 Winnipeg","funders":"","keywords":"Computer science; Tree (set theory); Descendant; Matching (statistics); Ancestor; K-ary tree; Theoretical computer science; Search tree; Set (abstract data type); Tree traversal; Tree structure; Algorithm; Mathematics; Binary tree; Combinatorics; Search algorithm","score_opus":0.037282766949322275,"score_gpt":0.2923406455522601,"score_spread":0.2550578786029378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082076097","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.07631083,0.0019526834,0.91430634,0.00046077772,0.00010668281,0.0002321979,0.00039685718,0.0016514008,0.004582236],"genre_scores_gemma":[0.37482703,0.0007558173,0.61974806,0.00016546292,0.00011059714,0.00016379682,0.0009983813,0.0004847085,0.0027461092],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99183285,0.002969559,0.0006184688,0.0010226218,0.0030220728,0.0005343246],"domain_scores_gemma":[0.99020535,0.006442485,0.00065260375,0.0014015182,0.0010318641,0.00026600694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004457454,0.0007736639,0.0014215696,0.002417842,0.00067795557,0.002995444,0.0027090388,0.0014648199,0.003904278],"category_scores_gemma":[0.022159355,0.00037733561,0.00075566984,0.0043980493,0.0011558281,0.011034241,0.002032863,0.0008993937,0.0007572994],"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.001900583,0.0004174147,0.006863754,0.0008632494,0.0001525552,0.0005255659,0.00056387676,0.0859401,0.012856194,0.13524653,0.0062874053,0.74838275],"study_design_scores_gemma":[0.000095434836,0.00042703436,0.0014194819,0.00005731469,0.00006772269,0.0006588,0.0002938818,0.8431475,0.020501139,0.12501098,0.008278423,0.000042279626],"about_ca_topic_score_codex":0.0027773727,"about_ca_topic_score_gemma":0.0020864021,"teacher_disagreement_score":0.004457454,"about_ca_system_score_codex":0.0013557845,"about_ca_system_score_gemma":0.0015704151,"threshold_uncertainty_score":0.023573577},"labels":[],"label_agreement":null},{"id":"W2091873835","doi":"10.1504/ijitcc.2013.059399","title":"Inference of network impairment effect on the quality of high definition IPTV distribution","year":2013,"lang":"en","type":"article","venue":"International Journal of Information Technology Communications and Convergence","topic":"Image and Video Quality Assessment","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":"Communications Research Centre Canada","funders":"","keywords":"IPTV; Packet loss; Computer science; Quality (philosophy); Network packet; Inference; Video quality; The Internet; Multimedia; Computer network; Artificial intelligence; World Wide Web; Engineering; Operations management","score_opus":0.02482889900779829,"score_gpt":0.31738243715338244,"score_spread":0.29255353814558416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091873835","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.9774075,0.000065683445,0.021567037,0.000023777853,0.00000787105,0.00003056811,0.00011850949,0.000081759885,0.00069718546],"genre_scores_gemma":[0.9985759,0.00003252833,0.0011759126,0.0000036980316,0.0000025443821,0.000004673943,0.000087570894,0.0000040467585,0.00011304559],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927026,0.00026422538,0.000036097335,0.00014468611,0.00019658293,0.0000882169],"domain_scores_gemma":[0.99445194,0.0038677985,0.0004612093,0.00035071865,0.00070282706,0.00016547891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017784712,0.0004722911,0.00030328176,0.0006187927,0.000118180695,0.0005178561,0.00034861156,0.00039612124,0.00057349744],"category_scores_gemma":[0.010092521,0.00019836606,0.0003619577,0.00027510125,0.00032296721,0.0005355477,0.00043118984,0.00051127665,0.00018536072],"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.0037364142,0.00084070524,0.5164483,0.00027933097,0.00024036101,0.0006289084,0.0005471899,0.3388874,0.04561434,0.0006508916,0.00057439314,0.09155176],"study_design_scores_gemma":[0.000020738013,0.00077574997,0.25576496,0.000013411411,0.00008239235,0.00016450559,0.00014890358,0.7284677,0.014049568,0.00036314884,0.000119712335,0.000029244671],"about_ca_topic_score_codex":0.005084411,"about_ca_topic_score_gemma":0.002689856,"teacher_disagreement_score":0.005084411,"about_ca_system_score_codex":0.0005727062,"about_ca_system_score_gemma":0.00024638337,"threshold_uncertainty_score":0.010109663},"labels":[],"label_agreement":null}]}