{"id":"W4303453263","doi":"10.21203/rs.3.rs-2122747/v1","title":"Data structures for computing unique palindromes in static and non-static strings","year":2022,"lang":"en","type":"preprint","venue":"Research Square","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Japan Society for the Promotion of Science; University of Waterloo","keywords":"Substring; String (physics); Palindrome; Combinatorics; Time complexity; Interval (graph theory); Algorithm; Upper and lower bounds; Data structure; Mathematics; Discrete mathematics; Computer science","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001368081,0.001121105,0.002239193,0.002596321,0.001329811,0.002422891,0.003757091,0.001433097,0.005141555],"category_scores_gemma":[0.009666783,0.00107409,0.001709016,0.005830677,0.001175699,0.009346539,0.003322013,0.001989512,0.00155584],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001814453,"about_ca_system_score_gemma":0.002709407,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001928419,"about_ca_topic_score_gemma":0.003667186,"domain_scores_codex":[0.9972895,0.0001901271,0.0005204142,0.0009837993,0.000718935,0.0002973001],"domain_scores_gemma":[0.9906392,0.002865433,0.001172235,0.003784131,0.001034844,0.000504224],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.005586708,0.001137628,0.03555771,0.002867214,0.0003971221,0.001216737,0.002794299,0.06324761,0.0922254,0.1283799,0.03152255,0.635067],"study_design_scores_gemma":[0.0007225907,0.001277622,0.005699931,0.0003351962,0.0003192939,0.001089252,0.001302326,0.642405,0.09078387,0.224282,0.03159587,0.0001870823],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.4512904,0.003273598,0.504609,0.00166947,0.0004361763,0.0005510825,0.01212991,0.02076258,0.005277755],"genre_scores_gemma":[0.5566585,0.0003683182,0.4260437,0.0002867224,0.0001744862,0.0004641121,0.0128992,0.0007482825,0.002356815],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005141555,"threshold_uncertainty_score":0.01720023,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1343253763329418,"score_gpt":0.4459075118476089,"score_spread":0.3115821355146671,"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."}}