{"id":"W4366829792","doi":"10.1017/s096354832300010x","title":"Expected number of faces in a random embedding of any graph is at most linear","year":2023,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Combinatorics; Mathematics; Embedding; Conjecture; Multigraph; Upper and lower bounds; Vertex (graph theory); Random regular graph; Discrete mathematics; Random graph; Graph embedding; Multiplicity (mathematics); Graph; 1-planar graph; Line graph; Computer science; Geometry","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001574532,0.0001854536,0.0004880985,0.0002256876,0.0001951699,0.0000325957,0.001166654,0.00008618517,0.0000149458],"category_scores_gemma":[0.0005099489,0.0001924715,0.0001151859,0.004201904,0.000121736,0.0001920267,0.001795084,0.0002431223,0.00001193575],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001368443,"about_ca_system_score_gemma":0.0001030832,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002122929,"about_ca_topic_score_gemma":0.00001213103,"domain_scores_codex":[0.9976366,0.0003982926,0.0008116775,0.0004544148,0.0003523184,0.0003467586],"domain_scores_gemma":[0.9972851,0.0008852487,0.0003417547,0.0009626697,0.0004528163,0.00007246906],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001074405,0.001268733,0.6379015,0.0007762903,0.0001266048,0.00001444105,0.04225855,0.01917046,0.006324267,0.2665857,0.00108134,0.02438463],"study_design_scores_gemma":[0.002653453,0.00007201907,0.02303025,0.0003348141,0.000007319368,0.000005118809,0.0001677968,0.9230039,0.008998178,0.04111551,0.0002307054,0.0003810021],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9711897,0.0002590384,0.02663802,0.0002797941,0.0002847343,0.0003956643,0.000002173758,0.0002063406,0.0007445597],"genre_scores_gemma":[0.9935719,0.0001252532,0.006194407,0.00003280816,0.00001041777,0.000009195413,0.000005169666,0.00001118272,0.00003962816],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9038334,"threshold_uncertainty_score":0.7848761,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04208248376731293,"score_gpt":0.319149447904812,"score_spread":0.2770669641374991,"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."}}