{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001767339,0.00006304378,0.00008710507,0.0006036698,0.0001874686,0.00002500259,0.003385606,0.00005559614,0.00005486292],"category_scores_gemma":[0.0003882499,0.00004414798,0.00003859626,0.0004309544,0.0002828704,0.001169386,0.001495572,0.0002479544,0.000008515593],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000500344,"about_ca_system_score_gemma":0.0001197009,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005447206,"about_ca_topic_score_gemma":0.000002883651,"domain_scores_codex":[0.9986216,0.0001228714,0.0004966881,0.0000524253,0.0006307268,0.00007562691],"domain_scores_gemma":[0.9962924,0.0001913952,0.0006154977,0.000670278,0.002206025,0.00002439869],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001695113,0.00004210783,0.000547719,0.000001433634,0.00003172221,1.65274e-7,0.001330886,0.00001556537,0.0003246049,0.8018705,0.00004106513,0.1957773],"study_design_scores_gemma":[0.000532833,0.0002076072,0.002209729,0.0000731758,0.00001198126,0.00004313259,0.0005750403,0.02023691,0.0107003,0.9636874,0.001642148,0.00007973368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2564964,0.0009948612,0.7008951,0.02496178,0.0005140132,0.0006211853,0.00001032006,0.00007245973,0.01543394],"genre_scores_gemma":[0.9705058,0.0004230638,0.02889863,0.0001458363,0.000003723359,0.0000155039,0.000001541801,0.000001622789,0.000004250861],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7140094,"threshold_uncertainty_score":0.6291354,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008801664,0.0001066975,0.0001635016,0.0003678213,0.0001751326,0.00005080856,0.001465697,0.00008455521,0.00001569554],"category_scores_gemma":[0.0001347339,0.00007979894,0.00003916639,0.0002450467,0.000320916,0.002223067,0.0006197248,0.0002644965,0.000002768422],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003331711,"about_ca_system_score_gemma":0.0001150782,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001369191,"about_ca_topic_score_gemma":0.0002835618,"domain_scores_codex":[0.9985867,0.0001015903,0.0007400254,0.00007920527,0.0003987313,0.00009381903],"domain_scores_gemma":[0.9970426,0.0001056293,0.0009619697,0.0006346657,0.001224045,0.00003111924],"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.00001634818,0.00003741496,0.002096207,0.00001122734,0.00009695423,7.265783e-7,0.006821092,0.00001683299,0.0004352429,0.349494,0.00003807548,0.6409359],"study_design_scores_gemma":[0.007044619,0.0009449515,0.1108018,0.001190513,0.0003076283,0.002591965,0.06645325,0.09770494,0.01888038,0.6415957,0.0511774,0.001306867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.118775,0.001169899,0.8725809,0.005746725,0.0003293984,0.0001765274,0.00001667523,0.00003835193,0.001166527],"genre_scores_gemma":[0.9481001,0.001471348,0.05026186,0.0001202768,0.00000970176,0.00001755986,0.000007648531,0.000003164127,0.000008356408],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8293251,"threshold_uncertainty_score":0.3254107,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009647182,0.00007168612,0.0001559808,0.0001487225,0.00008746697,0.0000513357,0.001598955,0.00005956867,0.00002293201],"category_scores_gemma":[0.0003254453,0.0000505614,0.00005473608,0.0002806234,0.000212585,0.001044979,0.0003786886,0.0001980471,0.000009620855],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004608055,"about_ca_system_score_gemma":0.00007076938,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009969289,"about_ca_topic_score_gemma":0.000002844931,"domain_scores_codex":[0.998556,0.0001626754,0.0008301559,0.00004717753,0.0003246925,0.00007925661],"domain_scores_gemma":[0.9965133,0.0005773494,0.001186894,0.0005338898,0.001167116,0.00002145462],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001496407,0.00006700647,0.003812022,0.00001169015,0.00005842181,1.002849e-7,0.0002000934,0.00005612464,0.0003459992,0.9422833,0.0002714813,0.0528788],"study_design_scores_gemma":[0.002694901,0.003499185,0.274164,0.0009091054,0.00005579073,0.0000999917,0.001907645,0.02799376,0.05764711,0.6268976,0.003623242,0.0005076443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4229092,0.0001480568,0.5595139,0.01663332,0.0002749763,0.000216079,0.00001799011,0.00002099232,0.0002654899],"genre_scores_gemma":[0.9903489,0.0005077003,0.008887087,0.0002093809,0.000008353191,0.00002082918,0.00001504351,0.000001042621,0.000001669826],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5674397,"threshold_uncertainty_score":0.2971283,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}