{"id":"W2051728965","doi":"10.1007/s00454-013-9521-1","title":"Computing Cartograms with Optimal Complexity","year":2013,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Technische Universität Berlin; Deutsche Forschungsgemeinschaft; National Science Foundation","keywords":"Mathematics; Hamiltonian path; Planar graph; Planar; Combinatorics; Polygon (computer graphics); Time complexity; Polygonal chain; Discrete mathematics; Graph; Regular polygon; Geometry; Computer science","routes":{"ca_aff":true,"ca_fund":true,"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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002824545,0.000338673,0.0003163082,0.0004353634,0.0004788111,0.0006761295,0.000783184,0.00008055003,0.0001931867],"category_scores_gemma":[0.00003949202,0.0002996192,0.0001284161,0.001867995,0.0001800866,0.001179038,0.0003360284,0.0002646458,0.0004102456],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007806247,"about_ca_system_score_gemma":0.0001698334,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001134267,"about_ca_topic_score_gemma":0.000005474636,"domain_scores_codex":[0.9971964,0.0001155094,0.0004758825,0.0007425467,0.0009315667,0.0005381411],"domain_scores_gemma":[0.9981358,0.0003348465,0.0002162549,0.0004181027,0.0006169913,0.0002780021],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001411245,0.0001475459,0.003169625,0.00002932314,0.0001050609,0.00001607672,0.0004248023,0.8059142,0.0001011,0.144055,0.001773676,0.04424954],"study_design_scores_gemma":[0.000719701,0.0002202789,0.1015947,0.00003002263,0.00001172741,0.0001146334,0.00009218723,0.8788748,0.0001259858,0.01650029,0.001210399,0.0005052632],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.263259,0.00008815843,0.7333792,0.0009465041,0.0002179374,0.0003370144,0.000008219828,0.0002853357,0.001478683],"genre_scores_gemma":[0.6790906,0.00000115349,0.3198209,0.0005841574,0.0001448938,0.00002261154,0.0001905139,0.00001624196,0.0001289541],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4158316,"threshold_uncertainty_score":0.9999456,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01722231830427899,"score_gpt":0.2491749199382125,"score_spread":0.2319526016339335,"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."}}