{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000594917,0.0005127569,0.000404575,0.0007123611,0.0005982253,0.0005964462,0.0009594173,0.0006176329,0.001316881],"category_scores_gemma":[0.002025117,0.0002981309,0.0005270957,0.0006701895,0.0006934429,0.0007536684,0.001157526,0.0008249611,0.0006632177],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005514068,"about_ca_system_score_gemma":0.001063007,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006379882,"about_ca_topic_score_gemma":0.0008986741,"domain_scores_codex":[0.999278,0.0001837312,0.00003986385,0.0001064475,0.0003134142,0.00007845696],"domain_scores_gemma":[0.9992185,0.0003542944,0.00007686726,0.0001490268,0.0001671247,0.00003424223],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003307572,0.0001463229,0.0009499667,0.0001575925,0.00007994125,0.0002004379,0.0002608938,0.2243509,0.05346359,0.1429716,0.003386436,0.5737016],"study_design_scores_gemma":[0.0001226321,0.0002224513,0.0002813842,0.00003251027,0.00003940708,0.0005182367,0.00006454129,0.8742253,0.04089144,0.07018948,0.01334696,0.00006563254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007451967,0.00004445732,0.9911512,0.0000413306,0.0000171852,0.0000448196,0.00001748846,0.0001516411,0.001079884],"genre_scores_gemma":[0.06820013,0.00007182888,0.9299037,0.00005258662,0.00001784843,0.0001194775,0.00009783961,0.000051959,0.001484488],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001316881,"threshold_uncertainty_score":0.004405379,"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."}}