{"meta":{"query_hash":"14accb7fce8a","filters":{"venue":"International Conference on Parallel and Distributed Systems"},"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/14accb7fce8a","api":"https://metacan.xera.ac/api/v1/cohort?venue=International+Conference+on+Parallel+and+Distributed+Systems"},"results":[{"id":"W1943774235","doi":"10.1109/icpads.2004.92","title":"Wavelength assignment on bounded degree trees of rings","year":2004,"lang":"en","type":"article","venue":"International Conference on Parallel and Distributed Systems","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Tree (set theory); Wavelength; Node (physics); Bounded function; Time complexity; Upper and lower bounds; Mathematics; Degree (music); Approximation algorithm; Routing (electronic design automation); Network topology; Disjoint sets; Enhanced Data Rates for GSM Evolution; Topology (electrical circuits); Combinatorics; Computer science; Algorithm; Computer network; Physics; Optics; Telecommunications","score_opus":0.07809195675287456,"score_gpt":0.31608982907265426,"score_spread":0.2379978723197797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1943774235","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.08318784,0.000055363875,0.899853,0.0016911273,0.0004638469,0.00032572722,0.00019214836,0.00008714906,0.0141437985],"genre_scores_gemma":[0.9986699,0.00004508989,0.0008789381,0.00004035365,0.000032179472,0.000042484462,0.000041890657,0.0000056663016,0.00024348067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832594,0.00006920425,0.0003152608,0.00038380674,0.0006747898,0.00023096616],"domain_scores_gemma":[0.99903834,0.00010592387,0.00016132873,0.0003307351,0.00024225148,0.000121445155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002506271,0.00016470432,0.00021265438,0.00014514374,0.000083981744,0.00018142982,0.0007664982,0.0000620935,0.000014787204],"category_scores_gemma":[0.00007181747,0.00013620552,0.000053230906,0.00014283128,0.0001154996,0.00022241488,0.00013629938,0.00015632773,0.000029420276],"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.00009309151,0.00013775668,0.0002812882,0.000010499871,0.00004550322,0.000017277069,0.000100474834,0.005169011,0.0005114127,0.9908246,0.000051922078,0.0027571707],"study_design_scores_gemma":[0.008818607,0.002808171,0.029066134,0.0013354034,0.000017907001,0.00013532116,0.0011405908,0.26879156,0.0032458242,0.67879367,0.00458837,0.0012584428],"about_ca_topic_score_codex":0.00008187981,"about_ca_topic_score_gemma":0.000011796445,"teacher_disagreement_score":0.9154821,"about_ca_system_score_codex":0.00012725343,"about_ca_system_score_gemma":0.000088683,"threshold_uncertainty_score":0.55543},"labels":[],"label_agreement":null}]}