{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001343205,0.0006701602,0.0009392108,0.0007150488,0.001144357,0.001649255,0.001566928,0.001305937,0.004164035],"category_scores_gemma":[0.01154284,0.0006352191,0.00074829,0.0005923031,0.001441265,0.003858562,0.001160828,0.001454523,0.0005506428],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001598513,"about_ca_system_score_gemma":0.000559231,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007762094,"about_ca_topic_score_gemma":0.001186718,"domain_scores_codex":[0.9984113,0.0004922748,0.00007405791,0.0003645619,0.0003368434,0.00032104],"domain_scores_gemma":[0.9853284,0.01001808,0.001090822,0.002063782,0.0006772478,0.0008216266],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0035234,0.0005796528,0.06357609,0.0005764628,0.0003972755,0.001637758,0.0005025039,0.5349084,0.09174483,0.2141671,0.01274811,0.0756384],"study_design_scores_gemma":[0.00008328198,0.0003713735,0.01009393,0.00002878464,0.00008743715,0.001254388,0.0002359167,0.8499386,0.03228432,0.1030577,0.00248122,0.00008310148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8663377,0.0002816856,0.122393,0.001714745,0.00007077939,0.00007987395,0.0007070274,0.0003538422,0.008061304],"genre_scores_gemma":[0.9809039,0.0001888107,0.0157442,0.0001512307,0.00006455577,0.0001141342,0.0005170274,0.00009591721,0.002220158],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004164035,"threshold_uncertainty_score":0.01393008,"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."}}