{"id":"W2940975645","doi":"10.46298/dmtcs.6340","title":"Parking functions, tree depth and factorizations of the full cycle into transpositions","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Factorization; Bijection; Combinatorics; Sequence (biology); Mathematics; Set (abstract data type); Upper and lower bounds; Tree (set theory); Simple (philosophy); Discrete mathematics; Computer science; Algorithm; Biology","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005995987,0.0004670586,0.0005488249,0.001150469,0.001287084,0.001695685,0.0005374628,0.0005419147,0.006104516],"category_scores_gemma":[0.002360678,0.000324387,0.0006909743,0.0008135305,0.002141159,0.003799603,0.001046436,0.001038253,0.0007728383],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001114485,"about_ca_system_score_gemma":0.0006387517,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003404112,"about_ca_topic_score_gemma":0.002735137,"domain_scores_codex":[0.9995248,0.00005375903,0.00002619604,0.000145306,0.00007976386,0.0001701593],"domain_scores_gemma":[0.9986755,0.000448102,0.0002268774,0.0001965904,0.0001690519,0.0002838037],"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.0001887824,0.00003331947,0.001537928,0.00005428488,0.00001144804,0.0001416609,0.0005894055,0.00679433,0.003799707,0.9655978,0.001627233,0.0196241],"study_design_scores_gemma":[0.00001871369,0.00005928166,0.001546254,0.00002883157,0.00001345318,0.0003615546,0.0002495364,0.01741999,0.001816677,0.972154,0.006296683,0.00003483839],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7784828,0.001004484,0.1803783,0.0005830327,0.00008289742,0.00005169276,0.001006969,0.000296815,0.03811306],"genre_scores_gemma":[0.9654959,0.0004202234,0.02544978,0.0001150259,0.00005120359,0.00003937187,0.0004779193,0.00006412662,0.007886436],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006104516,"threshold_uncertainty_score":0.02042168,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008808573795939184,"score_gpt":0.2052965266309861,"score_spread":0.1964879528350469,"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."}}