{"id":"W1599317246","doi":"10.1007/978-3-540-87744-8_33","title":"Succinct Representations of Arbitrary Graphs","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Upper and lower bounds; Combinatorics; Vertex (graph theory); Constant (computer programming); Discrete mathematics; Mathematics; Multiplicative function; Graph; Computer science","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.0004831158,0.0009388801,0.0006736767,0.001260001,0.0004837649,0.002425466,0.001520451,0.001020221,0.01413263],"category_scores_gemma":[0.003920905,0.0005790165,0.000560337,0.002527708,0.0008331863,0.006188648,0.002036708,0.002305553,0.002865988],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006427991,"about_ca_system_score_gemma":0.000526314,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000693051,"about_ca_topic_score_gemma":0.001549123,"domain_scores_codex":[0.9993487,0.0001728807,0.00005425855,0.0001031894,0.0002535418,0.00006747295],"domain_scores_gemma":[0.9979039,0.0008753388,0.0001317058,0.0007789599,0.0002451227,0.00006495664],"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.0002560693,0.00008424338,0.0002087999,0.000381347,0.00002214199,0.0002403954,0.0004205468,0.05183286,0.004622016,0.7157811,0.02834441,0.1978061],"study_design_scores_gemma":[0.00002999762,0.00002815174,0.00009446884,0.00009401202,0.00001784619,0.0001819405,0.0001067596,0.0852118,0.003796282,0.879272,0.03114834,0.000018398],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03579318,0.001395187,0.9106886,0.001402571,0.0003766216,0.0001702393,0.004886398,0.003023074,0.04226413],"genre_scores_gemma":[0.4240507,0.003704271,0.5081947,0.0006850513,0.0003439624,0.0005664522,0.0167478,0.001946799,0.04376013],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01413263,"threshold_uncertainty_score":0.0472784,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01759427741672307,"score_gpt":0.2553327667620378,"score_spread":0.2377384893453147,"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."}}