{"id":"W2883962117","doi":"10.4230/lipics.mfcs.2018.37","title":"Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames","year":2018,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; University of California, Santa Barbara; National Science Foundation","keywords":"Diagonal; Combinatorics; Mathematics; Intersection (aeronautics); Line segment; Approximation algorithm; Logarithm; Dominating set; Line (geometry); Discrete mathematics; Geometry; Graph; Mathematical analysis","routes":{"ca_aff":true,"ca_fund":true,"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.001490676,0.00218077,0.002353283,0.001334692,0.001144388,0.002381661,0.003165705,0.00144571,0.00480252],"category_scores_gemma":[0.008745707,0.0009093818,0.0015981,0.003624338,0.001004645,0.004752096,0.003011431,0.002085615,0.001093827],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002758661,"about_ca_system_score_gemma":0.001140981,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00484839,"about_ca_topic_score_gemma":0.004061999,"domain_scores_codex":[0.9974985,0.0007131379,0.0001171732,0.0008872115,0.0004004773,0.0003835229],"domain_scores_gemma":[0.9960211,0.002289543,0.0004752004,0.0005516754,0.0003031142,0.0003594047],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001483848,0.0003053029,0.003380267,0.00102915,0.0003292211,0.0005876753,0.001145011,0.7409233,0.009870382,0.1074543,0.01846058,0.1150311],"study_design_scores_gemma":[0.0001092722,0.0002172105,0.0007508991,0.00007314881,0.00008552419,0.000362125,0.0004117416,0.8757657,0.004349036,0.1095265,0.008312206,0.0000366227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2585481,0.0030633,0.7122225,0.002220422,0.000290081,0.0003592028,0.004003928,0.002776587,0.01651592],"genre_scores_gemma":[0.5644196,0.001242065,0.4193881,0.0007143391,0.0002108662,0.0003551768,0.006643983,0.0005920873,0.006433827],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00484839,"threshold_uncertainty_score":0.0200156,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02871484293033479,"score_gpt":0.3103756508637333,"score_spread":0.2816608079333985,"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."}}