{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001691946,0.0001325813,0.0002258958,0.00003180817,0.00009066967,0.000007044916,0.0001803701,0.00004609231,0.00006353377],"category_scores_gemma":[0.00001940416,0.00009096726,0.0000665718,0.0001159241,0.0004184592,0.00001787204,0.00001974083,0.0001278705,0.00004733271],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001060404,"about_ca_system_score_gemma":0.000004793121,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.99771e-7,"about_ca_topic_score_gemma":4.701661e-7,"domain_scores_codex":[0.999324,0.00001104087,0.0002716598,0.00008114998,0.0001545955,0.0001575712],"domain_scores_gemma":[0.9993527,0.0002117843,0.00007334134,0.0003179375,0.00001244652,0.00003180888],"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.000003307407,0.00001168609,0.000009393902,0.0001453877,0.0000409656,0.000001008404,0.001842098,0.0003650001,0.006255951,0.9909804,0.00027373,0.00007101888],"study_design_scores_gemma":[0.0006738862,0.00004575136,0.0001011726,0.0002265728,0.00005948499,0.00009371778,0.01745849,0.01425091,0.08896983,0.8771682,0.0003517145,0.0006002349],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8027663,0.00002081513,0.008605143,0.00001832058,0.00009257437,0.0002512424,0.0000158969,0.0001464064,0.1880833],"genre_scores_gemma":[0.9953011,0.00000505627,0.004592791,0.00001773936,0.00001765827,0.00002146861,0.000003198855,0.00002348116,0.000017547],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1925348,"threshold_uncertainty_score":0.3709537,"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."}}