{"meta":{"query_hash":"daa827f3e5bc","filters":{"venue":"International Journal of Computer Science and Artificial Intelligence"},"cohort_total":1,"direct_labels_cover":0,"predictions_cover":1,"exported":1,"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/daa827f3e5bc","api":"https://metacan.xera.ac/api/v1/cohort?venue=International+Journal+of+Computer+Science+and+Artificial+Intelligence"},"results":[{"id":"W2333804416","doi":"10.5963/ijcsai0204001","title":"Efficient Streaming Algorithms for Tree Matching Problems","year":2012,"lang":"en","type":"article","venue":"International Journal of Computer Science and Artificial Intelligence","topic":"Advanced Database Systems and Queries","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":"University of Winnipeg","funders":"","keywords":"Computer science; Node (physics); XML; Tree (set theory); Overhead (engineering); Matching (statistics); Focus (optics); Theoretical computer science; Data structure; Algorithm; Data mining; Mathematics; Programming language","score_opus":0.051595295629546394,"score_gpt":0.3265719468394973,"score_spread":0.2749766512099509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2333804416","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011884323,0.0016214915,0.98179907,0.00035651337,0.00009320731,0.0001747174,0.00024494802,0.001179595,0.002646091],"genre_scores_gemma":[0.10872012,0.0016683507,0.8839803,0.00022603273,0.00026627272,0.000417092,0.0014356743,0.0003504638,0.0029356768],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847716,0.00040077275,0.00015934357,0.00032063713,0.00046363205,0.00017838794],"domain_scores_gemma":[0.9969309,0.0019663859,0.00023741646,0.00034072256,0.0003887706,0.00013588871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024107068,0.0015189904,0.0016712865,0.0021703702,0.000975567,0.0016458789,0.002703555,0.0017979471,0.0055630277],"category_scores_gemma":[0.008935644,0.00067742245,0.0011457027,0.0045237094,0.0006265625,0.006106932,0.0018938249,0.0020466861,0.0014733004],"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.00057418237,0.00039398932,0.0016475917,0.00090431375,0.0001456071,0.0001529306,0.0003458411,0.28776783,0.007218817,0.096975476,0.017999606,0.58587384],"study_design_scores_gemma":[0.00010997081,0.00007773929,0.00014628604,0.000021729156,0.000022965824,0.000121200006,0.000053824147,0.90731615,0.0014332889,0.08732112,0.0033627057,0.000012967228],"about_ca_topic_score_codex":0.0023566263,"about_ca_topic_score_gemma":0.0022667397,"teacher_disagreement_score":0.0055630277,"about_ca_system_score_codex":0.0013186296,"about_ca_system_score_gemma":0.0014032786,"threshold_uncertainty_score":0.01861018},"labels":[],"label_agreement":null}]}