{"id":"W2015967296","doi":"10.1016/j.disopt.2005.08.008","title":"Berge’s theorem for the maximum charge problem","year":2006,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Lethbridge; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Simon Fraser University","keywords":"Mathematics; Generalization; Combinatorics; Charge (physics); Graph; Matching (statistics); Discrete mathematics; Mathematical analysis; Statistics; Quantum mechanics; Physics","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.002563657,0.001489774,0.001894447,0.002393218,0.001956054,0.004400865,0.00305892,0.00369584,0.02251373],"category_scores_gemma":[0.01176191,0.0007632276,0.001827052,0.002796119,0.003931021,0.009844839,0.004129563,0.007665936,0.002514128],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002204431,"about_ca_system_score_gemma":0.001296882,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001600175,"about_ca_topic_score_gemma":0.001424135,"domain_scores_codex":[0.9988855,0.0002933838,0.00004405513,0.0002348085,0.0003559097,0.0001863471],"domain_scores_gemma":[0.9972212,0.001992784,0.00009663039,0.0002093566,0.0002971782,0.0001827964],"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.00002111231,0.00002016936,0.00005828551,0.00008803292,0.00001507977,0.00002179443,0.00005748167,0.0025578,0.0003641837,0.9812639,0.007171996,0.008360308],"study_design_scores_gemma":[0.00001826683,0.000005396663,0.00006664024,0.00001510172,0.000005825842,0.00003014958,0.0000173464,0.006274305,0.000152302,0.9874325,0.005974254,0.000007911871],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02238049,0.006463703,0.6182325,0.02586741,0.00172768,0.0001415234,0.0007357322,0.0003115726,0.3241393],"genre_scores_gemma":[0.6043118,0.01218712,0.2105719,0.01096926,0.004367849,0.001084681,0.001118685,0.00110178,0.1542869],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02251373,"threshold_uncertainty_score":0.07531589,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01185349235856581,"score_gpt":0.2624375729190806,"score_spread":0.2505840805605148,"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."}}