{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002038298,0.0001909298,0.0002073509,0.0002309943,0.0002777843,0.0006188261,0.0002952189,0.000161391,6.651819e-7],"category_scores_gemma":[0.00002137573,0.0001961197,0.00005167813,0.0003751593,0.00005495648,0.0001386548,0.001070096,0.0002717157,6.507426e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001813155,"about_ca_system_score_gemma":0.0001221543,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002242096,"about_ca_topic_score_gemma":0.000003537996,"domain_scores_codex":[0.9989139,0.00004327131,0.0001934659,0.0005002853,0.0001890072,0.0001600039],"domain_scores_gemma":[0.9992898,0.0000970151,0.0000970932,0.0003086657,0.0001207779,0.00008660864],"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.000002128956,0.00005039801,0.002618063,0.0001684278,0.00002589607,0.00000959411,0.0003759866,0.0002517278,0.00001437901,0.9014086,0.0003744921,0.09470034],"study_design_scores_gemma":[0.0003098411,0.00004931366,0.02104951,0.0001270154,0.00002289091,0.00001357377,0.00001669876,0.04015957,0.0001572355,0.9349849,0.00277132,0.0003381863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6628662,0.01850893,0.3077697,0.001641689,0.004870787,0.0004756311,0.00003848403,0.000359347,0.003469264],"genre_scores_gemma":[0.9921247,0.001277744,0.005999784,0.0001863182,0.00003341672,0.0000185175,0.00002126049,0.000005081699,0.0003331386],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3292585,"threshold_uncertainty_score":0.7997528,"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."}}