{"id":"W4234230435","doi":"10.4018/978-1-5225-7659-4.ch021","title":"A Fast and Space-Economical Algorithm for the Tree Inclusion Problem","year":2018,"lang":"en","type":"book-chapter","venue":"Advances in library and information science (ALIS) book series","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Tree (set theory); Set (abstract data type); Bounded function; Mathematics; Order (exchange); Combinatorics; Space (punctuation); Algorithm; Inclusion (mineral); Computer science; Discrete mathematics; Chemistry","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":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0002752511,0.0002036519,0.0001874577,0.0002986235,0.0007956183,0.0005026027,0.0004425603,0.0001009393,0.00007469939],"category_scores_gemma":[0.00001860708,0.0001542449,0.00003387049,0.0001419157,0.001186274,0.4697746,0.0007746632,0.0001369249,0.00000506279],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002567593,"about_ca_system_score_gemma":0.0001715749,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.908114e-7,"about_ca_topic_score_gemma":0.000006388004,"domain_scores_codex":[0.9988579,0.000009299628,0.0004205402,0.0002937712,0.0002185963,0.0001999325],"domain_scores_gemma":[0.9991712,0.0001466685,0.0002934025,0.0002452586,0.00005718481,0.00008627946],"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.00001011649,0.000001244393,0.00001242517,0.00001472407,0.000001822782,1.441778e-7,0.001289895,0.00007658027,7.003038e-7,0.7986881,0.00001249978,0.1998918],"study_design_scores_gemma":[0.0002512883,0.0001232539,0.0001161846,0.00008628515,0.000003873952,0.00002797397,0.0001586683,0.03736068,0.00008242033,0.007262747,0.954299,0.000227593],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"review","genre_scores_codex":[0.00001476633,0.001793004,0.1368374,0.004554683,0.0005420956,0.0009545317,0.00005794319,0.0001944175,0.8550512],"genre_scores_gemma":[0.0007381589,0.7250133,0.2573492,0.003810775,0.0003108912,0.000152448,0.00007434018,0.00004364403,0.01250726],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.9542865,"threshold_uncertainty_score":0.6289924,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00541216385640624,"score_gpt":0.2099398408281181,"score_spread":0.2045276769717118,"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."}}