{"id":"W1600003812","doi":"10.37236/1962","title":"Perfect Codes in Cartesian Products of 2-Paths and Infinite Paths","year":2005,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"Canadian Nautical Research Society","funders":"","keywords":"Mathematics; Generalization; Cartesian product; Hamming bound; Binary number; Combinatorics; Discrete mathematics; Perfect power; Metric (unit); Block code; Linear code; Algorithm; Arithmetic; Decoding methods","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.0006977674,0.0006029863,0.0004758874,0.001161142,0.0006879321,0.001383607,0.0005600191,0.0007334218,0.001974238],"category_scores_gemma":[0.003782111,0.0004900689,0.0004027495,0.001083089,0.002667286,0.003801869,0.00174356,0.0008807837,0.0003177232],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004481896,"about_ca_system_score_gemma":0.0004893276,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004930464,"about_ca_topic_score_gemma":0.0004857942,"domain_scores_codex":[0.9990798,0.000250197,0.00006551862,0.0001984773,0.0002520891,0.0001538812],"domain_scores_gemma":[0.9968894,0.0014789,0.0007485666,0.0003080951,0.0003707436,0.0002042353],"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.00004241543,0.00001177036,0.0007948583,0.00007286663,0.000007493255,0.0003299821,0.0004524231,0.00909858,0.001960361,0.981911,0.0003254029,0.004992819],"study_design_scores_gemma":[0.00002029727,0.0001812489,0.0008653557,0.00005922714,0.00001627653,0.001318481,0.0002638348,0.04211056,0.003513825,0.9437675,0.007844519,0.0000387793],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7292271,0.002019085,0.2416636,0.0003697412,0.0001207794,0.00005368149,0.0002443966,0.0002141103,0.02608758],"genre_scores_gemma":[0.9487548,0.0008612634,0.04304194,0.00008734537,0.0000976571,0.00006437342,0.0001633091,0.0000515883,0.006877762],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001974238,"threshold_uncertainty_score":0.006604433,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.003893875204224092,"score_gpt":0.1844501038532301,"score_spread":0.180556228649006,"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."}}