{"id":"W2952789396","doi":"10.48550/arxiv.1505.02695","title":"Palindromic complexity of trees","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Palindrome; Alphabet; TRACE (psycholinguistics); Path (computing); Tree (set theory); Combinatorics; Word (group theory); Upper and lower bounds; Set (abstract data type); Free monoid; Combinatorics on words; Mathematics; Computer science; Discrete mathematics; Monoid; Biology; Linguistics; Genome","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.000908962,0.0004089462,0.0007104154,0.00153049,0.001293218,0.002892488,0.001343206,0.001084339,0.004992518],"category_scores_gemma":[0.006866843,0.0004608562,0.0007478463,0.001264471,0.002271862,0.00537796,0.001951605,0.001964839,0.0004908188],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001122764,"about_ca_system_score_gemma":0.0004688941,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005015774,"about_ca_topic_score_gemma":0.0005156624,"domain_scores_codex":[0.9984916,0.0002815294,0.000120791,0.0004507056,0.0004202139,0.0002350795],"domain_scores_gemma":[0.9916062,0.005882629,0.0008308402,0.0006559122,0.0004595909,0.0005647385],"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.0001760931,0.00009881695,0.0029211,0.0001976114,0.00002407553,0.0004018264,0.001529042,0.01024336,0.00920544,0.9646088,0.0008197626,0.009774094],"study_design_scores_gemma":[0.00002157947,0.00003874836,0.0006879098,0.00001414423,0.00001004858,0.0002631812,0.0001650251,0.01709552,0.001621828,0.9787508,0.001315219,0.00001600408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9048997,0.0006069825,0.07114924,0.001198578,0.00004171783,0.00005081204,0.00050022,0.0001300203,0.02142282],"genre_scores_gemma":[0.9856483,0.0002683291,0.01084012,0.00009892057,0.0001005896,0.00006350617,0.0003600204,0.00003101432,0.002589222],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004992518,"threshold_uncertainty_score":0.01670164,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1565265082672424,"score_gpt":0.2020352384370531,"score_spread":0.04550873016981075,"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."}}