{"id":"W2950333589","doi":"10.48550/arxiv.1303.4897","title":"Maximum Edge-Disjoint Paths in $k$-sums of Graphs","year":2013,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Disjoint sets; Enhanced Data Rates for GSM Evolution; Combinatorics; Mathematics; Computer science; Telecommunications","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.004585864,0.0004263579,0.0006265186,0.0006111191,0.0001836532,0.0004468987,0.004151443,0.0003366411,0.0001129724],"category_scores_gemma":[0.000636399,0.0004575283,0.0003735743,0.001021439,0.0003916394,0.0003242812,0.004627734,0.0009670886,0.00004657975],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009415341,"about_ca_system_score_gemma":0.000311222,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00286061,"about_ca_topic_score_gemma":0.00127361,"domain_scores_codex":[0.9933894,0.003437897,0.0009368527,0.001101513,0.0006214529,0.0005128701],"domain_scores_gemma":[0.9925156,0.001053555,0.0007019765,0.003922594,0.001604277,0.0002020312],"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.000004734276,0.0008588208,0.002390548,0.0003197002,0.00006689841,0.00001304419,0.01243708,0.0001038032,0.001049172,0.7600161,0.001028003,0.2217121],"study_design_scores_gemma":[0.001086769,0.000001773147,0.01962268,0.004140574,0.00002974979,0.00002176704,0.000185736,0.2084133,0.03849529,0.7212715,0.005459241,0.00127171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.142637,0.002027279,0.8104688,0.006932452,0.001009487,0.0009972109,0.00006472259,0.0004303806,0.0354327],"genre_scores_gemma":[0.6763543,0.0007307806,0.3210396,0.0001132868,0.00001996684,0.0001473227,0.0001256283,0.00004236306,0.001426738],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5337174,"threshold_uncertainty_score":0.9997876,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01771570312206111,"score_gpt":0.2250483221976506,"score_spread":0.2073326190755894,"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."}}