{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001435859,0.001169062,0.001900406,0.002339172,0.002161964,0.007427234,0.004110294,0.002143322,0.01332179],"category_scores_gemma":[0.01352356,0.0007991407,0.001747829,0.005738014,0.002944289,0.01473243,0.003440933,0.003057179,0.001517432],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003017162,"about_ca_system_score_gemma":0.002519918,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004914538,"about_ca_topic_score_gemma":0.007939045,"domain_scores_codex":[0.9969277,0.0008209238,0.0001774922,0.000558147,0.0008929147,0.0006228711],"domain_scores_gemma":[0.9876422,0.007705251,0.0007307151,0.002667751,0.0007284503,0.0005257276],"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.0004146089,0.0002935609,0.002466213,0.0004208999,0.00007178383,0.0001777492,0.0006972865,0.09467135,0.006685692,0.7681836,0.01686153,0.1090557],"study_design_scores_gemma":[0.00004511179,0.00002184984,0.0003624262,0.00002102169,0.00003166993,0.00007151155,0.0001480714,0.1622716,0.002365689,0.8320397,0.002600848,0.0000206159],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4791901,0.001229836,0.4630827,0.007043381,0.0003890327,0.000235826,0.001586617,0.002829748,0.0444128],"genre_scores_gemma":[0.7979183,0.0008198516,0.180832,0.0005120357,0.0003827451,0.0002427286,0.001972991,0.0009954664,0.01632371],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01332179,"threshold_uncertainty_score":0.0445658,"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."}}