{"id":"W2166523409","doi":"10.1109/lics.2007.48","title":"The Complexity of Proving the Discrete Jordan Curve Theorem","year":2007,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Disjoint sets; Combinatorics; Bounded function; Discrete mathematics; Mathematics; Computer science; Algorithm; 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":[],"consensus_categories":[],"category_scores_codex":[0.003712876,0.0001533154,0.0001683069,0.00003357583,0.0004681962,0.0001976503,0.002521906,0.00003573853,0.00001617961],"category_scores_gemma":[0.0002035594,0.00006961721,0.000125186,0.00047116,0.001064157,0.0002047258,0.0011678,0.0002112343,0.00001275266],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004629523,"about_ca_system_score_gemma":0.00006342365,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002542682,"about_ca_topic_score_gemma":0.0006800645,"domain_scores_codex":[0.998111,0.0002251564,0.0004066621,0.0003514816,0.000467383,0.000438279],"domain_scores_gemma":[0.9969235,0.001334814,0.0001579901,0.00135356,0.0001570489,0.00007310231],"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.0000061271,0.00003336968,0.001157278,0.000005395,0.00001145609,0.000001770686,0.0006791296,0.00003005307,0.00007133614,0.9353377,0.0001216623,0.06254468],"study_design_scores_gemma":[0.0002424923,0.0001622554,0.08056489,0.00001119846,0.000007120135,0.00002683277,0.0005024913,0.1784533,0.00433208,0.7316039,0.003830035,0.0002634178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0227689,0.0001068268,0.9495971,0.005241018,0.0004477247,0.0004325038,0.000001450733,0.0001558727,0.02124865],"genre_scores_gemma":[0.9571931,0.000003188544,0.04227181,0.0001906211,0.00009172317,0.000004842158,4.374482e-7,0.000006624482,0.0002377033],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9344242,"threshold_uncertainty_score":0.4686371,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03633940887867611,"score_gpt":0.2765516258077696,"score_spread":0.2402122169290935,"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."}}