{"id":"W1993294649","doi":"10.1016/j.tcs.2013.09.031","title":"Succinct encoding of arbitrary graphs","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Upper and lower bounds; Mathematics; Constant (computer programming); Vertex (graph theory); Discrete 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":[],"consensus_categories":[],"category_scores_codex":[0.0007408035,0.0001526379,0.000208563,0.0002172291,0.0002587688,0.000307487,0.003059634,0.00004189699,0.0001303067],"category_scores_gemma":[0.00004217246,0.0001122089,0.00006915948,0.001128405,0.001689989,0.001652841,0.001673912,0.0001622233,0.0001006592],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001830965,"about_ca_system_score_gemma":0.00008902558,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002230687,"about_ca_topic_score_gemma":1.06798e-7,"domain_scores_codex":[0.9978988,0.0000661534,0.0003073613,0.0005783647,0.0006798306,0.0004694606],"domain_scores_gemma":[0.998255,0.0002073801,0.00008809391,0.0009835592,0.0002085167,0.0002574504],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001092572,0.00003956489,0.0001203996,0.000005449347,0.000001791752,0.000003326956,0.000126442,0.00001530394,0.002718543,0.9488884,0.0001237503,0.04795598],"study_design_scores_gemma":[0.0001319407,0.0001357774,0.004283912,0.00003792435,0.000001773851,0.00002336641,0.000004200183,0.5527784,0.01324346,0.4291351,0.00005365676,0.0001705391],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07684191,0.00003534069,0.9164783,0.0003893941,0.0004572033,0.0001497958,0.000001226122,0.0001315787,0.005515215],"genre_scores_gemma":[0.7250334,0.000004199427,0.2746753,0.0002359326,0.00003914224,0.00000448857,4.969041e-7,0.000003654443,0.000003429583],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6481915,"threshold_uncertainty_score":0.6226835,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007668647300515955,"score_gpt":0.227461928451841,"score_spread":0.219793281151325,"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."}}