{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001530837,0.0002234531,0.000199988,0.0001094355,0.000917539,0.001029282,0.002289045,0.00004717733,0.00004640667],"category_scores_gemma":[0.00005458309,0.0001444197,0.000101593,0.0009640859,0.001678254,0.000487412,0.0003422257,0.0001433723,0.00002182767],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005271163,"about_ca_system_score_gemma":0.0001003752,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001346271,"about_ca_topic_score_gemma":0.000001255425,"domain_scores_codex":[0.9976174,0.00005267347,0.0003862026,0.0006591571,0.0007195211,0.0005650396],"domain_scores_gemma":[0.9977968,0.0004639985,0.0001340574,0.001089741,0.0002770154,0.0002383287],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002104841,0.00006662066,0.00000550901,0.000007122484,0.000004222708,0.000002026216,0.0007233671,0.004880156,0.00003121164,0.8242199,0.00001312346,0.1700446],"study_design_scores_gemma":[0.0001954375,0.00009905783,0.00005442738,0.00002275006,0.000008906734,0.00004808854,0.00006470961,0.8325724,0.0001146661,0.1663822,0.0002452996,0.0001921047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000337063,0.00001826078,0.9952866,0.00154997,0.0004096149,0.000684033,0.000006629431,0.0002301773,0.001477589],"genre_scores_gemma":[0.2996126,0.000006174133,0.6999933,0.0002505188,0.00007081545,0.00004408365,0.000001820619,0.00001022328,0.00001053191],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8276922,"threshold_uncertainty_score":0.9925389,"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."}}