{"id":"W1977227483","doi":"10.1007/s00037-009-0266-4","title":"Space-Efficient Counting in Graphs on Surfaces","year":2009,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Bipartite graph; Mathematics; Modulo; Discrete mathematics; Algebraic number; Planar graph; Counting problem; Graph","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":[],"consensus_categories":[],"category_scores_codex":[0.0006501749,0.0001630595,0.000189636,0.0003647128,0.0002192744,0.0001295874,0.0008003599,0.00003706565,0.00001675583],"category_scores_gemma":[0.00009169962,0.0001643355,0.00006611316,0.001128384,0.0001515679,0.0002105035,0.0001334432,0.0002774661,0.00008046707],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009921866,"about_ca_system_score_gemma":0.00007336025,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000011323,"about_ca_topic_score_gemma":0.000008319575,"domain_scores_codex":[0.9979746,0.0001742668,0.000264197,0.0004929585,0.0006911394,0.0004028591],"domain_scores_gemma":[0.9988694,0.0004399653,0.0000851724,0.0003443703,0.0001620549,0.0000990966],"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.0000141071,0.0001192516,0.0007018141,0.000002439741,0.00000212821,0.00001452506,0.0001040552,0.3730081,0.00004894079,0.624627,0.00005632036,0.001301308],"study_design_scores_gemma":[0.0002171553,0.0000696131,0.1268318,0.00001363756,2.982125e-7,0.000005162826,0.00000689337,0.3967496,0.00004638612,0.47591,0.0000493176,0.0001001227],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6568571,0.00006438318,0.3360494,0.002117503,0.0001210807,0.0002287509,0.000005254381,0.0001729935,0.004383501],"genre_scores_gemma":[0.9462115,0.000001104984,0.05325783,0.0004711252,0.00001705484,0.000004112064,0.000008953378,0.000005550945,0.0000227918],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2893543,"threshold_uncertainty_score":0.6701407,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0639715632429065,"score_gpt":0.3344310122917777,"score_spread":0.2704594490488712,"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."}}