{"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2564964,0.0009948612,0.7008951,0.024961775,0.0005140132,0.00062118535,0.000010320056,0.00007245973,0.015433935],"genre_scores_gemma":[0.97050583,0.00042306376,0.02889863,0.00014583627,0.0000037233585,0.000015503898,0.0000015418015,0.0000016227892,0.0000042508614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862164,0.00012287135,0.0004966881,0.000052425297,0.0006307268,0.00007562691],"domain_scores_gemma":[0.9962924,0.00019139524,0.0006154977,0.000670278,0.002206025,0.000024398689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001767339,0.00006304378,0.00008710507,0.00060366985,0.00018746855,0.00002500259,0.0033856055,0.00005559614,0.00005486292],"category_scores_gemma":[0.00038824993,0.00004414798,0.00003859626,0.00043095436,0.00028287037,0.0011693857,0.0014955723,0.00024795436,0.0000085155925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.000016951126,0.00004210783,0.00054771896,0.0000014336345,0.000031722215,1.6527396e-7,0.0013308863,0.000015565367,0.00032460486,0.8018705,0.00004106513,0.19577727],"study_design_scores_gemma":[0.00053283304,0.0002076072,0.0022097286,0.000073175805,0.000011981263,0.000043132593,0.0005750403,0.020236911,0.010700301,0.9636874,0.001642148,0.000079733676],"about_ca_topic_score_codex":0.0000054472057,"about_ca_topic_score_gemma":0.0000028836514,"teacher_disagreement_score":0.7140094,"about_ca_system_score_codex":0.000050034403,"about_ca_system_score_gemma":0.00011970092,"threshold_uncertainty_score":0.6291354},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11877497,0.001169899,0.87258095,0.0057467255,0.00032939838,0.00017652738,0.000016675232,0.000038351925,0.0011665268],"genre_scores_gemma":[0.9481001,0.001471348,0.050261863,0.00012027683,0.00000970176,0.000017559862,0.000007648531,0.0000031641266,0.000008356408],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858665,0.000101590274,0.00074002537,0.00007920527,0.00039873132,0.00009381903],"domain_scores_gemma":[0.9970426,0.00010562925,0.0009619697,0.0006346657,0.0012240448,0.00003111924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008801664,0.000106697495,0.00016350161,0.00036782134,0.0001751326,0.000050808565,0.0014656972,0.000084555206,0.000015695538],"category_scores_gemma":[0.00013473391,0.00007979894,0.000039166385,0.0002450467,0.00032091603,0.002223067,0.0006197248,0.00026449646,0.0000027684216],"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.00001634818,0.000037414957,0.0020962073,0.000011227344,0.00009695423,7.265783e-7,0.0068210918,0.000016832988,0.0004352429,0.34949398,0.000038075483,0.6409359],"study_design_scores_gemma":[0.0070446194,0.00094495155,0.110801816,0.0011905128,0.00030762827,0.0025919653,0.06645325,0.09770494,0.018880384,0.64159566,0.0511774,0.0013068668],"about_ca_topic_score_codex":0.00013691909,"about_ca_topic_score_gemma":0.0002835618,"teacher_disagreement_score":0.8293251,"about_ca_system_score_codex":0.00003331711,"about_ca_system_score_gemma":0.00011507824,"threshold_uncertainty_score":0.32541066},"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":"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.4229092,0.00014805682,0.55951387,0.016633315,0.00027497628,0.00021607897,0.000017990105,0.000020992324,0.00026548994],"genre_scores_gemma":[0.9903489,0.00050770026,0.008887087,0.00020938086,0.000008353191,0.000020829184,0.000015043505,0.0000010426213,0.0000016698259],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998556,0.0001626754,0.00083015586,0.000047177527,0.00032469252,0.00007925661],"domain_scores_gemma":[0.9965133,0.00057734945,0.0011868939,0.0005338898,0.0011671158,0.000021454618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009647182,0.00007168612,0.00015598079,0.00014872252,0.00008746697,0.0000513357,0.0015989551,0.000059568672,0.000022932007],"category_scores_gemma":[0.00032544532,0.000050561397,0.00005473608,0.0002806234,0.00021258502,0.0010449785,0.00037868856,0.00019804706,0.000009620855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.000014964073,0.00006700647,0.003812022,0.0000116901465,0.00005842181,1.0028493e-7,0.00020009339,0.00005612464,0.0003459992,0.9422833,0.0002714813,0.052878805],"study_design_scores_gemma":[0.0026949008,0.0034991852,0.27416402,0.0009091054,0.00005579073,0.000099991696,0.0019076455,0.027993761,0.057647113,0.6268976,0.0036232423,0.00050764426],"about_ca_topic_score_codex":0.000099692894,"about_ca_topic_score_gemma":0.0000028449313,"teacher_disagreement_score":0.5674397,"about_ca_system_score_codex":0.000046080553,"about_ca_system_score_gemma":0.000070769376,"threshold_uncertainty_score":0.29712832},"labels":[],"label_agreement":null}]}