{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3289224,0.0017634723,0.64671457,0.0010032001,0.00010828064,0.00021960364,0.0005935856,0.0012713886,0.01940353],"genre_scores_gemma":[0.7279684,0.0014283088,0.26128843,0.00021421758,0.00012467004,0.00017915253,0.00070226117,0.00018914192,0.0079053715],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989262,0.00032339533,0.000057735604,0.00017160366,0.00021588926,0.00030505718],"domain_scores_gemma":[0.99791163,0.0009997546,0.00035378593,0.0003609112,0.00019084536,0.0001831235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008112136,0.00040009947,0.000875504,0.00055102113,0.0010275773,0.0013189467,0.0017522991,0.0007441782,0.0032304523],"category_scores_gemma":[0.0037976112,0.00055876555,0.00053083524,0.0013052206,0.0006501256,0.0027797008,0.0015697394,0.0007701574,0.0008295113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.00082294416,0.00018475647,0.0013896822,0.0004879113,0.00005336679,0.0003604049,0.0004278957,0.70223904,0.021471769,0.15881354,0.010515552,0.10323322],"study_design_scores_gemma":[0.00009670462,0.00010419322,0.00056594907,0.00003838648,0.000021439138,0.00017685485,0.00013035636,0.8497317,0.0044203135,0.13536291,0.009332129,0.000019124092],"about_ca_topic_score_codex":0.0018366938,"about_ca_topic_score_gemma":0.0019635304,"teacher_disagreement_score":0.0032304523,"about_ca_system_score_codex":0.0009428634,"about_ca_system_score_gemma":0.00065276737,"threshold_uncertainty_score":0.010806918},"labels":[],"label_agreement":null}]}