{"id":"W2945067836","doi":"10.1007/978-3-030-17402-6_10","title":"$$k$$-cuts on a Path","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University","funders":"","keywords":"Path (computing); Combinatorics; Limit (mathematics); Path length; Node (physics); Representation (politics); Random graph; Graph; Maximum cut; Mathematics; Discrete mathematics; Order (exchange); Computer science; Physics; Mathematical analysis; Quantum mechanics","routes":{"ca_aff":true,"ca_fund":false,"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.0003615765,0.0003681598,0.0004784489,0.0002475766,0.00008717667,0.0001087787,0.0008008854,0.0002574933,0.00009808755],"category_scores_gemma":[0.000731594,0.0002951981,0.00007685876,0.0001578428,0.000191052,0.00005542552,0.0002937289,0.0006282099,0.0001830609],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001495148,"about_ca_system_score_gemma":0.0003578597,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001994591,"about_ca_topic_score_gemma":0.000009361714,"domain_scores_codex":[0.9976456,0.000008641705,0.0003316618,0.0008080511,0.000781933,0.0004241542],"domain_scores_gemma":[0.997125,0.001766461,0.0001697748,0.0006882643,0.0001404846,0.0001100158],"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.00001159888,0.00002581168,5.590632e-7,0.0001270434,0.000006244615,0.00004888111,0.0001488307,0.0004369719,0.00001248956,0.8131599,0.00008743597,0.1859343],"study_design_scores_gemma":[0.0001510846,0.0003029452,0.000001784751,0.0006554598,0.00001195709,0.00001960004,7.445489e-8,0.09583502,0.0001015783,0.9020137,0.0005794034,0.0003274071],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001620442,0.00006639114,0.9838838,0.0001687046,0.001177894,0.0003291988,0.0000229292,0.00006263956,0.01427225],"genre_scores_gemma":[0.09503101,0.0000332343,0.8955761,0.003494487,0.0009656897,0.00001412206,0.000008765096,0.0001500704,0.004726531],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1856069,"threshold_uncertainty_score":0.99995,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03498321012605584,"score_gpt":0.2927314945862712,"score_spread":0.2577482844602154,"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."}}