{"id":"W2952908729","doi":"10.48550/arxiv.1311.4778","title":"Semantic Word Cloud Representations: Hardness and Approximation Algorithms","year":2013,"lang":"en","type":"preprint","venue":"Zurich Open Repository and Archive (University of Zurich)","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Adjacency list; Combinatorics; Bounded function; Vertex (graph theory); Computer science; Mathematics; Graph; Discrete mathematics; Theoretical 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.0008116555,0.0003085214,0.0005266317,0.0002887802,0.0007946375,0.0005439727,0.001884902,0.0001685183,0.00001317915],"category_scores_gemma":[0.0000284463,0.0003492204,0.0001197392,0.0002818395,0.0004122138,0.001186951,0.00564289,0.0004659982,0.000009072182],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000217834,"about_ca_system_score_gemma":0.0001015764,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007863515,"about_ca_topic_score_gemma":0.00001246939,"domain_scores_codex":[0.9972265,0.0009115283,0.0002911318,0.001014754,0.0002852874,0.0002707381],"domain_scores_gemma":[0.9978834,0.0003463485,0.000511468,0.0008934656,0.0001544851,0.0002108707],"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.00057343,0.002483033,0.01557421,0.005111099,0.002824057,0.001617547,0.1214898,0.001354118,0.009325389,0.5616702,0.03886461,0.2391125],"study_design_scores_gemma":[0.002891621,0.0004178287,0.09421722,0.001427368,0.0004746184,0.0004461045,0.00762117,0.2376709,0.001201485,0.6472213,0.004188304,0.00222213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1757895,0.0006368284,0.8141201,0.0005859795,0.00121744,0.001433527,0.00004678578,0.000135313,0.006034438],"genre_scores_gemma":[0.5131134,0.0009152508,0.4784123,0.00009872299,0.0002549601,0.00001915524,0.0001238507,0.00004081666,0.007021483],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.3373239,"threshold_uncertainty_score":0.999896,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01583044155109476,"score_gpt":0.2236481141465156,"score_spread":0.2078176725954208,"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."}}