{"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":"codex-gemma-dda1882f352a","candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.003562589,0.0003002005,0.0006213786,0.0003202157,0.000111355,0.00005724489,0.001154058,0.0002568679,0.00001320644],"category_scores_gemma":[0.0003474119,0.0002155833,0.0003571805,0.0004554791,0.00004644345,0.00005641043,0.0001758697,0.003408149,0.00001576152],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004505387,"about_ca_system_score_gemma":0.0006744569,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005205555,"about_ca_topic_score_gemma":0.00001361912,"domain_scores_codex":[0.9975389,0.0003269104,0.0008246363,0.0002028087,0.0005372248,0.0005695834],"domain_scores_gemma":[0.9963599,0.001413667,0.001216168,0.0007224695,0.0002370799,0.00005073998],"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.0000820588,0.0002947767,0.00004609567,0.00007975039,0.00009167691,0.000004351546,0.0004576046,0.0006663376,0.0001481796,0.9977527,0.0002456982,0.0001308082],"study_design_scores_gemma":[0.0007467489,0.0002548106,0.00004028624,0.0002921084,0.0001264119,0.00003205701,0.00007926395,0.0004084161,0.0004079399,0.9966186,0.0007850839,0.0002082311],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.986352,0.001204364,0.007515995,0.001059084,0.0008626807,0.000672174,0.000004368744,0.0000300662,0.002299285],"genre_scores_gemma":[0.9991186,0.0004250214,0.0000544177,0.0000794709,0.00008313315,0.00001860995,0.00000186144,0.00004806548,0.0001708273],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01276661,"threshold_uncertainty_score":0.9988911,"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."}}