{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003691211,0.0003916169,0.0005057838,0.000927125,0.0002536083,0.0001543033,0.003447354,0.0002313094,0.00002563295],"category_scores_gemma":[0.00005456242,0.0003441074,0.0001706396,0.0007598497,0.0007644014,0.0008520278,0.001692058,0.0006130905,0.00001992955],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007637096,"about_ca_system_score_gemma":0.0005276775,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007538124,"about_ca_topic_score_gemma":0.00002184864,"domain_scores_codex":[0.9965838,0.00003164504,0.000598145,0.001301453,0.001041497,0.0004434587],"domain_scores_gemma":[0.9968415,0.0004084959,0.0003659299,0.001986978,0.0002419948,0.0001550487],"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.00001092468,0.0001138087,0.0003285698,0.00006771992,0.00002920551,0.0003502602,0.001391645,0.01288486,0.0003130381,0.06403812,0.000743585,0.9197283],"study_design_scores_gemma":[0.0006201888,0.0003311777,0.002245456,0.0007731437,0.00001543606,0.0003900343,2.795977e-7,0.5587902,0.005007424,0.4253193,0.005265511,0.001241882],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001225478,0.0008558211,0.9911127,0.0002619104,0.001140309,0.0002599867,0.00001774296,0.0001113149,0.006117685],"genre_scores_gemma":[0.05722992,0.0005228379,0.9407532,0.0007382542,0.0003096594,0.000008926115,0.00002784265,0.0000379374,0.0003714391],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9184864,"threshold_uncertainty_score":0.9999011,"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."}}