{"id":"W115542354","doi":"10.46298/dmtcs.291","title":"An Efficient Algorithm for the Maximum Distance Problem","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Algorithm; Time complexity; Scalability; Scheduling (production processes); Preprocessor; Computer science; Artificial intelligence; Mathematical optimization","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002192151,0.002415905,0.002110724,0.002264151,0.002072094,0.003784499,0.004656537,0.003768185,0.02711365],"category_scores_gemma":[0.01137538,0.001163765,0.002725594,0.003963354,0.001562014,0.008259591,0.005619581,0.004718647,0.008209215],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002855632,"about_ca_system_score_gemma":0.003914022,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003662394,"about_ca_topic_score_gemma":0.00500811,"domain_scores_codex":[0.9956507,0.000937166,0.0003259445,0.001197945,0.001291572,0.0005966507],"domain_scores_gemma":[0.994983,0.002951029,0.0002494954,0.0009278926,0.0006626649,0.0002259819],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000766568,0.0006640968,0.001198623,0.001059226,0.000167913,0.0002759633,0.0005058119,0.0869085,0.007994423,0.1953036,0.06996761,0.6351877],"study_design_scores_gemma":[0.0004837626,0.0002087819,0.0004049489,0.0001096489,0.00008159626,0.0005019903,0.0003225812,0.4851712,0.004854044,0.469837,0.0379457,0.0000786915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006582894,0.0004525502,0.9738515,0.001485656,0.0002111389,0.0004264434,0.00068004,0.002694071,0.01361565],"genre_scores_gemma":[0.06647897,0.0003356924,0.9206738,0.0005076602,0.000153918,0.0005675174,0.002556342,0.0006765558,0.008049588],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02711365,"threshold_uncertainty_score":0.0907042,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01037868799014362,"score_gpt":0.2578276345565877,"score_spread":0.2474489465664441,"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."}}