{"id":"W2008914847","doi":"10.1016/s0166-218x(99)00163-8","title":"Pancyclicity and NP-completeness in planar graphs","year":2000,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Completeness (order theory); Combinatorics; NP-complete; Planar; Planar graph; Discrete mathematics; Graph; Time complexity; Computer science","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003797124,0.000188142,0.0002924933,0.0001555057,0.0001049632,0.00009567419,0.0007186667,0.00006275476,0.00004198926],"category_scores_gemma":[0.00001612927,0.0001644637,0.00003923145,0.0005568342,0.0001444286,0.0002055412,0.0001237892,0.0002013055,0.00006377388],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000017595,"about_ca_system_score_gemma":0.00001399304,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008473583,"about_ca_topic_score_gemma":0.00001403396,"domain_scores_codex":[0.9985281,0.00002891163,0.0003148875,0.0003956695,0.000307574,0.0004248734],"domain_scores_gemma":[0.9989277,0.0002228406,0.00005814993,0.0006612759,0.00001544965,0.0001146479],"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.00001256185,0.00006507471,0.0001608498,0.00007420844,0.000009206407,0.00001372741,0.001418857,0.00004355173,0.001782307,0.9772307,0.00003172247,0.01915718],"study_design_scores_gemma":[0.0004708892,0.00002457039,0.001255485,0.00002864204,0.000003520118,0.00002065631,0.0001445361,0.008294314,0.0008823329,0.988052,0.0005578213,0.0002652114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.667103,0.0001426567,0.2876396,0.0003563752,0.00003495943,0.0007728045,0.00001394122,0.0002715491,0.04366509],"genre_scores_gemma":[0.8277246,0.0001141528,0.1716708,0.0002043513,0.00001376563,0.00009922436,0.000005107812,0.00002629191,0.0001417365],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1606216,"threshold_uncertainty_score":0.6706633,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0183941956439401,"score_gpt":0.2686029003853998,"score_spread":0.2502087047414597,"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."}}