{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":3,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":3,"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":"cc17cbc6e1d5","filters":{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Yangjun Chen","is_ca":true},{"name":"Yibin Chen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03999548666942057,"gpt":0.3201049591208155,"spread":0.2801094724513949,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002400847,0.00114016,0.001571538,0.001159723,0.001566549,0.003330704,0.002774553,0.001687965,0.01638275],"category_scores_gemma":[0.009636965,0.0005011678,0.001315003,0.002195362,0.001467303,0.008608081,0.004905394,0.002739309,0.002491149],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001699796,"about_ca_system_score_gemma":0.001914374,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004446834,"about_ca_topic_score_gemma":0.0055718,"domain_scores_codex":[0.996691,0.0008998852,0.0001490397,0.0005180851,0.001138032,0.0006040593],"domain_scores_gemma":[0.9956077,0.002593166,0.0001646584,0.0007203763,0.0006880497,0.0002260871],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001570718,0.0006315042,0.001580357,0.001124766,0.00009061304,0.0006244881,0.0004576781,0.1149312,0.00977083,0.2046273,0.04528495,0.6193056],"study_design_scores_gemma":[0.0001947888,0.0002177074,0.0004733107,0.0001415776,0.0001139106,0.0003793431,0.0003690955,0.6237407,0.01132913,0.339586,0.02341089,0.00004349057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06221572,0.001351603,0.8857849,0.002922078,0.0003374135,0.0005664388,0.0008041319,0.004014393,0.04200344],"genre_scores_gemma":[0.2672049,0.0008463787,0.7046464,0.001065161,0.0003116241,0.0003926822,0.002413185,0.001135564,0.02198405],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01638275,"threshold_uncertainty_score":0.05480576,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Yangjun Chen","is_ca":true},{"name":"Leping Zou","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03728276694932228,"gpt":0.2923406455522601,"spread":0.2550578786029378,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004457454,0.0007736639,0.00142157,0.002417842,0.0006779556,0.002995444,0.002709039,0.00146482,0.003904278],"category_scores_gemma":[0.02215935,0.0003773356,0.0007556698,0.004398049,0.001155828,0.01103424,0.002032863,0.0008993937,0.0007572994],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001355784,"about_ca_system_score_gemma":0.001570415,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002777373,"about_ca_topic_score_gemma":0.002086402,"domain_scores_codex":[0.9918329,0.002969559,0.0006184688,0.001022622,0.003022073,0.0005343246],"domain_scores_gemma":[0.9902053,0.006442485,0.0006526037,0.001401518,0.001031864,0.0002660069],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001900583,0.0004174147,0.006863754,0.0008632494,0.0001525552,0.0005255659,0.0005638768,0.0859401,0.01285619,0.1352465,0.006287405,0.7483827],"study_design_scores_gemma":[0.00009543484,0.0004270344,0.001419482,0.00005731469,0.00006772269,0.0006588,0.0002938818,0.8431475,0.02050114,0.125011,0.008278423,0.00004227963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07631083,0.001952683,0.9143063,0.0004607777,0.0001066828,0.0002321979,0.0003968572,0.001651401,0.004582236],"genre_scores_gemma":[0.374827,0.0007558173,0.6197481,0.0001654629,0.0001105971,0.0001637968,0.0009983813,0.0004847085,0.002746109],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004457454,"threshold_uncertainty_score":0.02357358,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Omneya Issa","is_ca":true},{"name":"Filippo Speranza","is_ca":true},{"name":"Wei Li","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02482889900779829,"gpt":0.3173824371533824,"spread":0.2925535381455842,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001778471,0.0004722911,0.0003032818,0.0006187927,0.0001181807,0.0005178561,0.0003486116,0.0003961212,0.0005734974],"category_scores_gemma":[0.01009252,0.0001983661,0.0003619577,0.0002751013,0.0003229672,0.0005355477,0.0004311898,0.0005112767,0.0001853607],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005727062,"about_ca_system_score_gemma":0.0002463834,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005084411,"about_ca_topic_score_gemma":0.002689856,"domain_scores_codex":[0.9992703,0.0002642254,0.00003609734,0.0001446861,0.0001965829,0.0000882169],"domain_scores_gemma":[0.9944519,0.003867798,0.0004612093,0.0003507186,0.0007028271,0.0001654789],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.003736414,0.0008407052,0.5164483,0.000279331,0.000240361,0.0006289084,0.0005471899,0.3388874,0.04561434,0.0006508916,0.0005743931,0.09155176],"study_design_scores_gemma":[0.00002073801,0.00077575,0.255765,0.00001341141,0.00008239235,0.0001645056,0.0001489036,0.7284677,0.01404957,0.0003631488,0.0001197123,0.00002924467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9774075,0.00006568345,0.02156704,0.00002377785,0.00000787105,0.00003056811,0.0001185095,0.00008175988,0.0006971855],"genre_scores_gemma":[0.9985759,0.00003252833,0.001175913,0.000003698032,0.000002544382,0.000004673943,0.00008757089,0.000004046758,0.0001130456],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005084411,"threshold_uncertainty_score":0.01010966,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}