{"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03539728,0.00021503377,0.95983505,0.0006291338,0.003741305,0.00011384119,0.00000485685,0.000019561745,0.000043957265],"genre_scores_gemma":[0.6342798,0.000013946618,0.36472997,0.00013084304,0.00083331263,0.0000033836322,4.079742e-7,0.000003971867,0.000004398951],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979704,0.000023473984,0.0005710682,0.00023143321,0.0008612409,0.0003424001],"domain_scores_gemma":[0.9979682,0.00017527604,0.0003656146,0.00017474021,0.0011255518,0.00019062374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018424706,0.00012666936,0.00017113257,0.0003202155,0.00022429883,0.00032284015,0.0010545332,0.00002497503,0.0000021304647],"category_scores_gemma":[0.00010926036,0.00010077415,0.00006851961,0.0003164311,0.00022953487,0.00156893,0.00034949798,0.000112364294,0.0000045592224],"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.000009420312,0.0000935549,0.000053691267,0.000007139605,0.000015523048,0.000005632102,0.002197502,0.0088097425,0.0035047522,0.284332,0.00001942827,0.7009516],"study_design_scores_gemma":[0.00012289951,0.00030562058,0.00047080033,0.0002598549,0.000009357398,0.00057307974,0.0004916145,0.93333316,0.035477903,0.02197623,0.0066232053,0.00035630557],"about_ca_topic_score_codex":0.00001181984,"about_ca_topic_score_gemma":0.0000029403886,"teacher_disagreement_score":0.9245234,"about_ca_system_score_codex":0.00007823252,"about_ca_system_score_gemma":0.00014968123,"threshold_uncertainty_score":0.41094506},"labels":[],"label_agreement":null}]}