{"id":"W2080125678","doi":"10.1016/j.dam.2008.07.006","title":"On the complexity of constructing Golomb Rulers","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":false,"ca_institutions":"Group for Research in Decision Analysis; University of Toronto; HEC Montréal","funders":"","keywords":"Golomb coding; Ruler; Mathematics; Completeness (order theory); Computational complexity theory; Theoretical computer science; Integer (computer science); Discrete mathematics; Combinatorics; Algorithm; Computer science; Artificial intelligence; Programming language","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.003940193,0.0008308692,0.002051923,0.001556466,0.002412236,0.00765759,0.002922459,0.002256131,0.01757249],"category_scores_gemma":[0.04823245,0.001025959,0.00181991,0.002830085,0.003293746,0.01495124,0.004428584,0.004186931,0.002216281],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002707904,"about_ca_system_score_gemma":0.002896299,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004280206,"about_ca_topic_score_gemma":0.005250327,"domain_scores_codex":[0.9927927,0.002834251,0.0004554871,0.0008104061,0.002343655,0.0007634076],"domain_scores_gemma":[0.9209332,0.06693614,0.002064709,0.007196416,0.002139012,0.0007304997],"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.001180774,0.0003888187,0.003492481,0.0005961343,0.0001236118,0.0004539465,0.0009709516,0.1614452,0.004218404,0.6368526,0.01704318,0.1732339],"study_design_scores_gemma":[0.0001031382,0.00005849815,0.0004698973,0.0000505782,0.00004359998,0.0001592611,0.0002171558,0.2206246,0.002110226,0.7734118,0.00271382,0.00003751391],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3942731,0.001717574,0.5311141,0.006325206,0.0003016186,0.0004000429,0.001941202,0.001808706,0.06211853],"genre_scores_gemma":[0.7860391,0.001197238,0.1966705,0.0006357848,0.0003216127,0.0002984376,0.002261261,0.0007060318,0.01187006],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01757249,"threshold_uncertainty_score":0.05878586,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03598714576227698,"score_gpt":0.2091848366784065,"score_spread":0.1731976909161295,"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."}}