{"id":"W2745422027","doi":"10.37236/6361","title":"Quasi-Eulerian Hypergraphs","year":2017,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Hypergraph; Eulerian path; Mathematics; Combinatorics; Euler's formula; Traverse; Connected component; Euler characteristic; Graph; Discrete mathematics; Pure mathematics; Lagrangian; Mathematical analysis","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":["open_science"],"consensus_categories":[],"category_scores_codex":[0.002406533,0.0001369285,0.0002386098,0.0001450091,0.0008232694,0.00033967,0.005818984,0.00004998111,0.000005104936],"category_scores_gemma":[0.0003520946,0.00008978276,0.0001738373,0.0002797177,0.0002043109,0.0009160254,0.0003777442,0.0009337009,0.00001610168],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001528985,"about_ca_system_score_gemma":0.0004573026,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004174935,"about_ca_topic_score_gemma":0.000003481525,"domain_scores_codex":[0.9979957,0.0002002888,0.0003131515,0.0001469648,0.0006366516,0.0007072701],"domain_scores_gemma":[0.9972997,0.0002092755,0.0006147122,0.00141633,0.0003386817,0.0001213258],"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.00002368677,0.0001126857,0.0002607819,0.000002505762,0.00004728792,0.00001810181,0.0001172677,0.00000891714,0.0002537449,0.9950911,0.0001693043,0.003894628],"study_design_scores_gemma":[0.0006028693,0.0008550342,0.0007219394,0.00001270121,0.000009681768,0.0002389288,0.00002756647,0.0003412774,0.001467699,0.9879957,0.007618723,0.0001078871],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1905855,0.006151207,0.7804871,0.01280709,0.002438381,0.0002629741,6.220681e-7,0.00006813421,0.007198953],"genre_scores_gemma":[0.9985219,0.0007141004,0.0001573998,0.00006530363,0.00009395785,0.000001919927,5.556162e-8,0.00001295551,0.0004323743],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8079364,"threshold_uncertainty_score":0.99956,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01425155632955503,"score_gpt":0.2863594365640059,"score_spread":0.2721078802344508,"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."}}