{"id":"W2912680787","doi":"10.1016/j.tcs.2003.06.004","title":"Packing arrays","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto; Carleton University","funders":"","keywords":"Combinatorics; Mathematics; Disjoint sets; Alphabet; Upper and lower bounds; Row; Packing problems; Row and column spaces; Set (abstract data type); Equivalence (formal languages); Matching (statistics); Class (philosophy); Discrete mathematics; Computer science","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.000234432,0.0008524022,0.0009896858,0.001597967,0.001338765,0.00241604,0.0008785932,0.001262414,0.04702443],"category_scores_gemma":[0.002111727,0.000669764,0.0005429627,0.002451434,0.0006175596,0.002599407,0.002086715,0.001577234,0.01657812],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004857551,"about_ca_system_score_gemma":0.0003550122,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002356561,"about_ca_topic_score_gemma":0.0002914642,"domain_scores_codex":[0.9992423,0.0001364763,0.00003911737,0.000173877,0.0002688779,0.000139474],"domain_scores_gemma":[0.9988793,0.0002722936,0.00009886843,0.0004085363,0.0002256317,0.0001154161],"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.0005028359,0.000214756,0.0006779244,0.0002725601,0.00004923632,0.0003410709,0.0002462951,0.01788381,0.04054887,0.6137228,0.05474896,0.270791],"study_design_scores_gemma":[0.0001079704,0.0003550432,0.001050736,0.0001020615,0.00006171074,0.001242849,0.0003341502,0.138679,0.0666508,0.6162025,0.1751235,0.00008979638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0756596,0.001805516,0.5212143,0.001255178,0.001551331,0.0001961228,0.00148073,0.004543788,0.3922933],"genre_scores_gemma":[0.6026168,0.001879877,0.1964864,0.001576769,0.0009865585,0.0004485144,0.003800437,0.001488273,0.1907164],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.04702443,"threshold_uncertainty_score":0.1573124,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005519304663409126,"score_gpt":0.1948762534363203,"score_spread":0.1893569487729112,"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."}}