{"id":"W2148659572","doi":"10.5555/1283383.1283456","title":"Succinct indexes for strings, binary relations and multi-labeled trees","year":2007,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":87,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Encoding (memory); String (physics); Set (abstract data type); Binary number; Rank (graph theory); Bit array; Type (biology); String searching algorithm; Data structure; Theoretical computer science; Combinatorics; Mathematics; Arithmetic","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":[],"consensus_categories":[],"category_scores_codex":[0.0002341323,0.00007260102,0.0000764205,0.00008123834,0.0001807721,0.00007199232,0.0002273597,0.00004502742,0.000009487474],"category_scores_gemma":[0.00002754576,0.00005575041,0.00001968456,0.0001364767,0.00001786606,0.0004877521,0.0002067896,0.00005193018,0.000005831343],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001094461,"about_ca_system_score_gemma":0.00001690579,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007142362,"about_ca_topic_score_gemma":0.0001019368,"domain_scores_codex":[0.9993834,0.000007804398,0.000134565,0.0002224891,0.00008642544,0.0001652373],"domain_scores_gemma":[0.9994515,0.0001738162,0.00003704133,0.0002286991,0.00003893476,0.00007000883],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005782196,0.0004946013,0.05596939,0.00002955019,0.00004777079,0.00002618748,0.0009440426,0.0001470006,0.01149554,0.231974,0.01528549,0.6835287],"study_design_scores_gemma":[0.001765495,0.0002063494,0.310828,0.00002648377,0.000007673943,0.00001153673,0.00006586456,0.6693389,0.003186743,0.00168022,0.01260429,0.0002783612],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07639174,0.0001556747,0.9226547,0.0002061527,0.00009870562,0.0001453525,0.000005572785,0.00011127,0.0002307712],"genre_scores_gemma":[0.4588437,0.0000100471,0.5397695,0.00007415374,0.0000336522,0.00000517925,0.000008686767,0.000004278237,0.001250844],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6832503,"threshold_uncertainty_score":0.2273436,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02284381078697994,"score_gpt":0.281223494833351,"score_spread":0.258379684046371,"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."}}