{"id":"W1831273253","doi":"10.1007/978-3-642-12200-2_17","title":"Compact Rich-Functional Binary Relation Representations","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Binary relation; Binary number; Redundancy (engineering); Relation (database); Theoretical computer science; Data structure; Set operations; Binary data; Abstraction; Representation (politics); Set (abstract data type); Algorithm; Data mining; Mathematics; Arithmetic; Discrete mathematics; Programming language","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.0006127295,0.0005869659,0.0006272846,0.001328542,0.0008156034,0.002945443,0.001033084,0.0008330179,0.01762563],"category_scores_gemma":[0.002114858,0.0005468539,0.0005860042,0.002095851,0.001195777,0.00768039,0.001850127,0.002235342,0.003645774],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005943219,"about_ca_system_score_gemma":0.0002938773,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003482551,"about_ca_topic_score_gemma":0.0005927969,"domain_scores_codex":[0.9994206,0.0001228723,0.00004889766,0.0001155735,0.0002105831,0.00008145154],"domain_scores_gemma":[0.9989687,0.000324186,0.00007899123,0.0003868559,0.0001775284,0.00006375188],"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.00002524835,0.00001413902,0.00004370782,0.00004968593,0.000004410058,0.00004225901,0.0001993694,0.0006826879,0.001308336,0.9612234,0.00322172,0.03318509],"study_design_scores_gemma":[0.000006006776,0.00001108509,0.00006737084,0.00002026632,0.000008538555,0.0001404704,0.00006699833,0.005048024,0.001016355,0.9769104,0.01669585,0.000008792057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05780927,0.001190157,0.8130309,0.001046625,0.0003023371,0.0001002958,0.001494404,0.002598833,0.1224272],"genre_scores_gemma":[0.6532571,0.001471565,0.2462247,0.0005502405,0.0004034362,0.0002239682,0.002735391,0.001396135,0.09373746],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01762563,"threshold_uncertainty_score":0.0589636,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01898075420139992,"score_gpt":0.2507049437817532,"score_spread":0.2317241895803533,"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."}}