{"id":"W2751588130","doi":"10.1016/j.disc.2018.06.021","title":"Spanning Euler tours and spanning Euler families in hypergraphs with particular vertex cuts","year":2018,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Hypergraph; Vertex (graph theory); Euler's formula; Spanning tree; Euler characteristic; Traverse; Discrete mathematics; Graph; Mathematical analysis","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.0005261457,0.0002499974,0.0003204028,0.0002725428,0.0001861142,0.0002036914,0.0005952733,0.00006516401,0.0000128811],"category_scores_gemma":[0.0002154086,0.0001902699,0.00004733548,0.0007980035,0.0004487704,0.000584445,0.0003777203,0.000226361,0.00003638345],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002558349,"about_ca_system_score_gemma":0.00003600321,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001087881,"about_ca_topic_score_gemma":0.00002399556,"domain_scores_codex":[0.9980698,0.00008028239,0.0003057684,0.0004685704,0.0004734964,0.000602123],"domain_scores_gemma":[0.9985857,0.0003242565,0.0001027091,0.000718947,0.0001144336,0.0001539529],"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.0001281415,0.0003689135,0.04388212,0.000576974,0.0002558629,0.0004534786,0.07077485,0.0007751528,0.008949463,0.8566973,0.0005650289,0.01657274],"study_design_scores_gemma":[0.003515736,0.001434511,0.02217219,0.002277321,0.00008941851,0.0003179854,0.01291116,0.5135482,0.0209659,0.4179553,0.002414518,0.002397743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7394052,0.0001987746,0.2562158,0.0002599,0.00009690571,0.0002528317,0.000001932128,0.0001278945,0.00344082],"genre_scores_gemma":[0.8791254,0.00002649735,0.1205409,0.00007123577,0.00003032714,0.00002849613,0.000001388297,0.00003201142,0.0001437726],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.512773,"threshold_uncertainty_score":0.7758983,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01965353357901875,"score_gpt":0.2796994088672856,"score_spread":0.2600458752882668,"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."}}