{"id":"W2095879899","doi":"10.1109/tit.2008.2011431","title":"Combinatorial Constructions for Optimal Two-Dimensional Optical Orthogonal Codes","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":true,"ca_institutions":"Lakehead University","funders":"","keywords":"Binary number; Combinatorial design; Coding (social sciences); Code (set theory); Set (abstract data type); Mathematics; Computer science; Sequence (biology); Discrete mathematics; Theoretical computer science; Combinatorics; Algorithm; Arithmetic","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.0008289803,0.0007838121,0.0006949652,0.001768913,0.0008792718,0.001966594,0.0008220381,0.0008147958,0.003122274],"category_scores_gemma":[0.003522108,0.0007581438,0.0008492679,0.001817633,0.001438414,0.001621892,0.001761187,0.001433338,0.0006033105],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001231681,"about_ca_system_score_gemma":0.0008412432,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003817873,"about_ca_topic_score_gemma":0.0005886789,"domain_scores_codex":[0.9989619,0.0003376177,0.00007975317,0.0001447341,0.0003452407,0.000130657],"domain_scores_gemma":[0.9980679,0.0009743234,0.0003193482,0.0002576043,0.0002512576,0.0001295084],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006785923,0.00006893714,0.0003676877,0.0001691293,0.00002248836,0.0001340537,0.0001437601,0.05607608,0.005379978,0.8982512,0.002930669,0.03638812],"study_design_scores_gemma":[0.00009293189,0.0001484186,0.0004196687,0.00009614354,0.00003570706,0.0004198811,0.0001273501,0.2481802,0.006951809,0.7266356,0.01680591,0.00008651792],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1047739,0.001122625,0.8480242,0.0007692605,0.0001839348,0.0001638808,0.0003799756,0.0002117121,0.0443704],"genre_scores_gemma":[0.4863216,0.001440496,0.5000837,0.0004891847,0.0001702099,0.000642603,0.0006531535,0.0001695203,0.0100295],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003122274,"threshold_uncertainty_score":0.01044506,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0055197535792343,"score_gpt":0.2091376246644924,"score_spread":0.2036178710852581,"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."}}