{"id":"W2585241149","doi":"10.37236/7958","title":"A Note on Counting Flows in Signed Graphs","year":2019,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Grantová Agentura České Republiky","keywords":"Mathematics; Combinatorics; Abelian group; Signed graph; Zero (linguistics); Graph; Polynomial; Order (exchange); Discrete mathematics; Integer (computer science); Mathematical analysis; Computer science; Linguistics","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.002675294,0.001216345,0.001383272,0.00427523,0.002538949,0.00398248,0.001553622,0.002147393,0.004878174],"category_scores_gemma":[0.01411764,0.0006156358,0.001296698,0.003999619,0.004763767,0.01284313,0.002710678,0.004490618,0.0007469641],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00259028,"about_ca_system_score_gemma":0.001054334,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00246989,"about_ca_topic_score_gemma":0.001709437,"domain_scores_codex":[0.9977791,0.000719598,0.0001446006,0.0004352806,0.000563121,0.0003583662],"domain_scores_gemma":[0.9910859,0.00663712,0.0004708779,0.0006293734,0.0005638434,0.000612821],"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.00005673677,0.00004294843,0.001052424,0.00009024251,0.00001195033,0.00009425486,0.000306205,0.001801823,0.001293023,0.9744505,0.005049578,0.0157503],"study_design_scores_gemma":[0.00001700022,0.00004162504,0.0006062898,0.00007119213,0.00002278616,0.000173625,0.0001023715,0.01337638,0.00155037,0.9657297,0.01826541,0.00004322363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3231592,0.01519043,0.431966,0.02193982,0.006771423,0.0001865387,0.0009840654,0.0009783041,0.1988242],"genre_scores_gemma":[0.8458619,0.01008682,0.09502283,0.004654132,0.005975666,0.0001958667,0.0007043972,0.0004737527,0.03702478],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004878174,"threshold_uncertainty_score":0.01879394,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01912501863073339,"score_gpt":0.2942883673323062,"score_spread":0.2751633487015728,"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."}}