{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008804123,0.0004171472,0.0003493831,0.001032737,0.0005846906,0.0004508878,0.002058034,0.000363613,0.00009528283],"category_scores_gemma":[0.00009931253,0.0003887469,0.0001560901,0.0008433376,0.0008411598,0.001018663,0.0005854625,0.001379472,0.0001290641],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001253012,"about_ca_system_score_gemma":0.0003832912,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001067998,"about_ca_topic_score_gemma":0.00001795741,"domain_scores_codex":[0.9967385,0.00005257316,0.0004602512,0.001341715,0.0009272313,0.000479719],"domain_scores_gemma":[0.9972471,0.0006437019,0.0002854158,0.001395182,0.0002505774,0.0001780096],"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.00002159067,0.0001501084,0.0006816902,0.00003697284,0.00004564994,0.0002168003,0.001860966,0.1496595,0.003930511,0.5517074,0.0001544985,0.2915343],"study_design_scores_gemma":[0.0002465389,0.0001093594,0.004400619,0.0001136748,0.000009235258,0.0001229358,1.808714e-7,0.2679859,0.001366891,0.7240794,0.001008864,0.0005564493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003853781,0.0001261656,0.9871604,0.001110593,0.003641487,0.0002743994,0.000006579433,0.0002167823,0.007078201],"genre_scores_gemma":[0.4423233,0.00003100762,0.5521997,0.001694801,0.001388697,0.00001273172,0.00005421153,0.00006088839,0.002234639],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4419379,"threshold_uncertainty_score":0.9998565,"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."}}