{"id":"W2076126465","doi":"10.1090/s0002-9939-2013-11760-0","title":"An uncountable family of copies of a non-chainable tree-like continuum in the plane","year":2013,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Nipissing University","funders":"","keywords":"Uncountable set; Annotation; Disjoint sets; Type (biology); Computer science; Tree (set theory); Algorithm; Artificial intelligence; Mathematics; Combinatorics; Countable set; 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.0004409674,0.0003210791,0.0004871689,0.001471682,0.002121207,0.002386007,0.001008446,0.0006853809,0.005401851],"category_scores_gemma":[0.001739681,0.0005074476,0.0009318538,0.001037143,0.002585018,0.004198436,0.001873116,0.001297119,0.0007344864],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001627752,"about_ca_system_score_gemma":0.000470435,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002135597,"about_ca_topic_score_gemma":0.001660546,"domain_scores_codex":[0.9992685,0.0000843488,0.00004163386,0.0002364468,0.0002935223,0.00007548385],"domain_scores_gemma":[0.9989359,0.0003357281,0.0001418134,0.0001914988,0.0002054131,0.000189618],"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.00005060126,0.00002495207,0.001224927,0.00005540929,0.00001688555,0.0006815332,0.0004739656,0.002200003,0.004392019,0.9847133,0.0008871212,0.005279211],"study_design_scores_gemma":[0.00005717275,0.00006923592,0.003079826,0.00006591133,0.00005008983,0.00212404,0.0009149875,0.03798472,0.007331458,0.9167463,0.03152393,0.00005219075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.559105,0.001142081,0.348282,0.001044903,0.00009896001,0.0000734584,0.0006693667,0.0007935766,0.08879077],"genre_scores_gemma":[0.8985181,0.0007230433,0.07737979,0.0001768764,0.0000619389,0.0001318244,0.0008377916,0.0002217303,0.02194897],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005401851,"threshold_uncertainty_score":0.018071,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01355567766355073,"score_gpt":0.2814856615919814,"score_spread":0.2679299839284307,"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."}}