{"id":"W1971650774","doi":"10.1137/s0097539702415950","title":"Counting Complexity Classes for Numeric Computations I: Semilinear Sets","year":2003,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Betti number; Complexity class; Completeness (order theory); Computation; Mathematics; Class (philosophy); Discrete mathematics; Characterization (materials science); Counting problem; Euler's formula; Euler characteristic; Combinatorics; Model of computation; Transfer (computing); Computational complexity theory; Time complexity; Algorithm; Computer science; Physics; Mathematical analysis","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":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001438304,0.0002881559,0.000378891,0.000273242,0.00176289,0.0007107912,0.0009069558,0.00007399109,0.00002064294],"category_scores_gemma":[0.000360074,0.0002820814,0.0002812658,0.0007730462,0.0001155037,0.0004047843,0.0001432661,0.0006304801,0.00003025717],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001094641,"about_ca_system_score_gemma":0.000198208,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004071104,"about_ca_topic_score_gemma":0.000002573242,"domain_scores_codex":[0.997409,0.0002670417,0.0006680468,0.0004698597,0.0005106225,0.000675432],"domain_scores_gemma":[0.9973867,0.001147801,0.0004555037,0.0003751557,0.0004075623,0.0002273011],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002156231,0.0005340662,0.001550956,0.0001081654,0.0001738636,0.00008089042,0.001334654,0.06024648,0.0001625433,0.8104454,0.005740537,0.1196009],"study_design_scores_gemma":[0.00101977,0.0002861941,0.001311199,0.0001746877,0.00001394111,0.0007080268,0.0001513479,0.8758022,0.0002772476,0.09246159,0.02733953,0.0004542248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02868611,0.0001900186,0.9655038,0.000738444,0.002021401,0.0002399626,0.000006727575,0.0002225097,0.002391007],"genre_scores_gemma":[0.533773,0.000009821172,0.4650389,0.0008191519,0.0003051134,0.00000237858,0.000003936898,0.00001993801,0.00002777902],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8155558,"threshold_uncertainty_score":0.9999632,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0597100730862779,"score_gpt":0.3185660829249645,"score_spread":0.2588560098386866,"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."}}