{"id":"W1988776662","doi":"10.1016/j.dam.2005.07.006","title":"Equivalence of some LP-based lower bounds for the Golomb ruler problem","year":2005,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal; Université du Québec à Montréal","funders":"","keywords":"Golomb coding; Mathematics; Upper and lower bounds; Ruler; Combinatorics; Equivalence (formal languages); Linear programming; Discrete mathematics; Algorithm; Computer science; Artificial intelligence; Image compression","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.007099144,0.002313036,0.003037141,0.004111151,0.002055547,0.01000659,0.005712014,0.00333734,0.01748411],"category_scores_gemma":[0.03949549,0.001002165,0.002339283,0.004585396,0.004015845,0.01288274,0.005243351,0.01217323,0.002478303],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004650256,"about_ca_system_score_gemma":0.002485063,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001898166,"about_ca_topic_score_gemma":0.001722859,"domain_scores_codex":[0.9907568,0.003089316,0.0003694768,0.001241701,0.003169183,0.001373626],"domain_scores_gemma":[0.9643993,0.02833792,0.001180348,0.002503422,0.00257573,0.001003347],"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.0003782422,0.0003362405,0.000504944,0.0003069243,0.00007092336,0.00009383121,0.0002939725,0.04571613,0.001501075,0.8787467,0.01262255,0.0594283],"study_design_scores_gemma":[0.00004501478,0.00007726953,0.0002727046,0.00007255023,0.00003436007,0.00005500587,0.00008738443,0.1788463,0.001095612,0.8159595,0.003422309,0.00003210579],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05089796,0.004060871,0.8216376,0.004973788,0.0007830625,0.0002175926,0.00105516,0.0007165922,0.1156574],"genre_scores_gemma":[0.6940046,0.004811223,0.2566772,0.003019683,0.00264951,0.001056518,0.002864802,0.001539627,0.0333769],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01748411,"threshold_uncertainty_score":0.05849016,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01101644449755482,"score_gpt":0.2194154620141217,"score_spread":0.2083990175165669,"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."}}