{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000369467,0.001061547,0.0007889784,0.001658289,0.001499922,0.003192798,0.001252479,0.001658199,0.02645257],"category_scores_gemma":[0.001918087,0.0006468481,0.0008422711,0.001748895,0.001798066,0.003357644,0.002211671,0.004309508,0.005270108],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001335094,"about_ca_system_score_gemma":0.0007244677,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001614805,"about_ca_topic_score_gemma":0.001510257,"domain_scores_codex":[0.9993995,0.00007176058,0.00002899462,0.0001962908,0.0001633655,0.0001401474],"domain_scores_gemma":[0.9990963,0.0003456187,0.00008746025,0.0001059074,0.0001987999,0.0001660698],"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.0001191663,0.00002883948,0.0001729026,0.0001160764,0.00001755485,0.0001601511,0.0001048625,0.003235113,0.001784567,0.9596822,0.01073698,0.02384161],"study_design_scores_gemma":[0.00001858708,0.00003312981,0.0002930212,0.00004548638,0.00001174638,0.0002693027,0.00009461759,0.00652384,0.0009505049,0.9628871,0.02885658,0.00001600813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1680224,0.001720429,0.3819934,0.003639474,0.001381912,0.0002296459,0.003405088,0.0008430612,0.4387646],"genre_scores_gemma":[0.450623,0.002624588,0.2216708,0.001072295,0.0004567157,0.0004062516,0.004911777,0.001106998,0.3171276],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02645257,"threshold_uncertainty_score":0.08849269,"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."}}