{"id":"W3017007515","doi":"10.4230/lipics.cpm.2020.11","title":"Summarizing Diverging String Sequences, with Applications to Chain-Letter Petitions","year":2020,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Automatic summarization; Heuristic; String (physics); Sequence (biology); Computer science; Tree (set theory); Variety (cybernetics); Set (abstract data type); Chain (unit); Algorithm; Theoretical computer science; Mathematics; Combinatorics; Artificial intelligence","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":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003629158,0.000654259,0.0006340136,0.0003973213,0.0007970807,0.001501341,0.003104266,0.0002918844,0.00001600988],"category_scores_gemma":[0.00003626111,0.000576004,0.0002345825,0.0005463398,0.00009385972,0.00151998,0.005318249,0.001160654,0.0001539237],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002466727,"about_ca_system_score_gemma":0.0002485806,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006967045,"about_ca_topic_score_gemma":0.00002301118,"domain_scores_codex":[0.9964224,0.00004039312,0.001063108,0.0008068056,0.0008169532,0.0008503019],"domain_scores_gemma":[0.9966483,0.000131106,0.0006299102,0.001750743,0.0003605668,0.0004793722],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0004416239,0.001791727,0.009654961,0.01407758,0.002607883,0.0002329645,0.07605152,0.06404221,0.001015707,0.5183789,0.1146432,0.1970618],"study_design_scores_gemma":[0.002359087,0.0003899678,0.0006342481,0.002609138,0.0001588879,0.00009464208,0.001010457,0.386193,0.0009824191,0.007489631,0.5953196,0.002758929],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001476382,0.00004618673,0.9879448,0.003481981,0.0007007829,0.002499951,0.001788217,0.0004443827,0.00161725],"genre_scores_gemma":[0.1386376,0.00008109499,0.8453053,0.008035702,0.001172887,0.002390591,0.004062873,0.0001183324,0.0001956451],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5108892,"threshold_uncertainty_score":0.9996691,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02790906043722501,"score_gpt":0.2671914755954198,"score_spread":0.2392824151581948,"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."}}