{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004488966,0.000118034,0.00009082053,0.0000721235,0.000348855,0.0001705101,0.0007493675,0.00004263081,0.00004222969],"category_scores_gemma":[0.00003986136,0.00007956,0.00007469219,0.0004412951,0.0000793549,0.0005069401,0.0001317729,0.00007919474,0.00001621613],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002679589,"about_ca_system_score_gemma":0.0000269787,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001230884,"about_ca_topic_score_gemma":0.00000538228,"domain_scores_codex":[0.9988921,0.00006185612,0.0001782319,0.000305575,0.0002364664,0.0003258183],"domain_scores_gemma":[0.9990562,0.0001858741,0.00008127585,0.0004999866,0.0001407595,0.00003587119],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001372622,0.00001501206,0.00004056226,0.000006921211,0.000007052126,4.105553e-7,0.00006619934,0.2800309,0.00009977879,0.715303,0.0005500233,0.003866465],"study_design_scores_gemma":[0.0002730982,0.00003836011,0.00004181915,0.00000640331,0.000004989813,0.000001931837,0.00001387144,0.802227,0.0008378217,0.1928086,0.003628142,0.0001180013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00004269584,0.0001556908,0.9901495,0.002011525,0.0001176698,0.00072748,0.00001047584,0.0001369387,0.006648043],"genre_scores_gemma":[0.1568438,0.00008280433,0.836946,0.000299849,0.0002716009,0.0006361507,0.000139568,0.00005886228,0.004721412],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5224944,"threshold_uncertainty_score":0.3244362,"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."}}