{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008481931,0.0007056547,0.0006849882,0.0009860233,0.0006372131,0.002060495,0.001557043,0.001074103,0.005606043],"category_scores_gemma":[0.006354168,0.0004349637,0.0005192358,0.002075113,0.001173913,0.004917794,0.002402948,0.002514478,0.001013967],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001374887,"about_ca_system_score_gemma":0.001501997,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001379346,"about_ca_topic_score_gemma":0.00275058,"domain_scores_codex":[0.9987195,0.0003725681,0.00009486701,0.0001814826,0.000467499,0.0001641315],"domain_scores_gemma":[0.994163,0.002686508,0.0002685763,0.002119019,0.000611237,0.0001515955],"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.0009182695,0.0002646125,0.0006035267,0.000385259,0.00003622798,0.0004008496,0.0005559647,0.06865688,0.009100311,0.7017086,0.02540907,0.1919604],"study_design_scores_gemma":[0.00009773616,0.00005927348,0.0001903821,0.000111088,0.0000363563,0.0001860184,0.0001191024,0.128858,0.0103825,0.8432114,0.01671996,0.0000281256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1419102,0.00185566,0.8003514,0.006337172,0.0006253127,0.0002532426,0.006450955,0.004318175,0.03789793],"genre_scores_gemma":[0.7322811,0.001520666,0.2398749,0.00123172,0.0002771578,0.0003730534,0.008138641,0.001013537,0.01528912],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005606043,"threshold_uncertainty_score":0.01875412,"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."}}