{"id":"W2103621885","doi":"10.1109/glocom.2005.1578005","title":"A greedy algorithm for deriving optical orthogonal codes using rejected delays reuse","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Greedy algorithm; Algorithm; Reuse; Computer science; Code (set theory); Set (abstract data type); Process (computing); Reduction (mathematics); Mathematics; Engineering","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005882276,0.000530799,0.0006137231,0.0001906124,0.0006426282,0.0002544998,0.001871271,0.0003703515,0.000138584],"category_scores_gemma":[0.0001165557,0.0005920235,0.0002820625,0.0006675043,0.0002487604,0.0004843038,0.0002294505,0.0004748542,0.0001121759],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000492605,"about_ca_system_score_gemma":0.0002423172,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000101614,"about_ca_topic_score_gemma":0.001351884,"domain_scores_codex":[0.9970313,0.0002147088,0.0009643299,0.0004673698,0.0003026292,0.00101971],"domain_scores_gemma":[0.996807,0.0002619165,0.0001718123,0.002042694,0.0003604215,0.000356109],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002320609,0.00223068,0.003732337,0.0004710939,0.002891671,0.0000476701,0.001661564,0.115411,0.01952409,0.1964173,0.09502456,0.5623559],"study_design_scores_gemma":[0.001564921,0.0001039954,0.001163909,0.0002414867,0.0002240932,0.0004315224,0.0003855247,0.9073017,0.00130095,0.004829044,0.08123132,0.001221597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3782834,0.002125376,0.5911291,0.0009297763,0.001680047,0.001786438,0.001483941,0.001861024,0.02072097],"genre_scores_gemma":[0.796649,0.0002621434,0.2021141,0.0001230997,0.0002985432,0.0001883791,0.0001979299,0.0000578538,0.000108942],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7918906,"threshold_uncertainty_score":0.9996531,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03087476027758857,"score_gpt":0.2722429596859024,"score_spread":0.2413681994083138,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}