{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002186627,0.000118727,0.0001563603,0.00004182773,0.0002775555,0.00007871124,0.0003960643,0.00003281197,0.00001839881],"category_scores_gemma":[0.00003292503,0.00008191654,0.00006674726,0.0005777056,0.001047795,0.0001325409,0.00008306967,0.0001132307,0.000004986249],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009316639,"about_ca_system_score_gemma":0.00001316505,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.87865e-7,"about_ca_topic_score_gemma":0.000001960787,"domain_scores_codex":[0.9991207,0.00003742328,0.0002497648,0.0001727909,0.0002447809,0.000174611],"domain_scores_gemma":[0.999427,0.0001225853,0.00003504637,0.0002482252,0.00004060052,0.0001265011],"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.000002247478,0.00001461086,0.000100924,0.0001257362,0.0000130378,3.775256e-7,0.005827581,0.001958425,0.01060209,0.9802617,0.000008585398,0.001084673],"study_design_scores_gemma":[0.000127583,0.00006397057,0.0006512469,0.0001070993,0.00004082418,0.00000971505,0.0004344605,0.8443679,0.004904125,0.1490875,0.00003786326,0.0001676775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1919787,0.00003318014,0.8050004,0.0002400923,0.0001607988,0.0001404943,0.000009548846,0.00008857346,0.002348153],"genre_scores_gemma":[0.9895467,0.000003042092,0.01035287,0.00003720548,0.00003883064,0.00000720685,0.000001374604,0.00001171659,0.000001070834],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8424095,"threshold_uncertainty_score":0.3860646,"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."}}