{"id":"W4403346558","doi":"10.1007/s00373-025-02985-8","title":"Noncrossing Longest Paths and Cycles","year":2025,"lang":"en","type":"preprint","venue":"Graphs and Combinatorics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Ottawa; Carleton University; University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada; Grantová Agentura České Republiky; National Science Foundation","keywords":"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003973642,0.0007061774,0.0005570732,0.002515004,0.001277069,0.002892838,0.001003133,0.001165968,0.01119338],"category_scores_gemma":[0.003986329,0.0005428888,0.0005427537,0.002546792,0.001580932,0.003435834,0.001793969,0.001361136,0.0008751324],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009744629,"about_ca_system_score_gemma":0.0004748348,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007980703,"about_ca_topic_score_gemma":0.00124942,"domain_scores_codex":[0.9995031,0.0001255946,0.00002335448,0.0001401483,0.0001443683,0.00006329171],"domain_scores_gemma":[0.99845,0.0008420537,0.0002077561,0.0001953068,0.000175329,0.0001295276],"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.00002356887,0.00002155586,0.0005782965,0.00007345115,0.000008290029,0.00009105133,0.0001572534,0.00654999,0.001161186,0.9661477,0.002207917,0.02297979],"study_design_scores_gemma":[0.000005453135,0.000005123641,0.0001965513,0.00002093371,0.000006415034,0.00008922703,0.00008723576,0.009896135,0.0007346437,0.9825147,0.006438125,0.000005398313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3859158,0.003402804,0.4853331,0.002383353,0.0005153625,0.0001261955,0.0008466946,0.0005272811,0.1209495],"genre_scores_gemma":[0.8396922,0.002767798,0.1032315,0.0003997814,0.0003630402,0.0001463445,0.001063535,0.0003976884,0.05193811],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01119338,"threshold_uncertainty_score":0.03744555,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01388533289748297,"score_gpt":0.2518536452386769,"score_spread":0.2379683123411939,"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."}}