{"id":"W1939369593","doi":"","title":"Using MCG to Find PP-Cycles in Planar Graphs","year":2005,"lang":"en","type":"article","venue":"Optical Fiber Communication Conference","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Planar; Exploit; Computer science; Planar graph; Algorithm; Theoretical computer science; Computer security; Graph; Computer graphics (images)","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.0001062481,0.0001621874,0.0001981123,0.000101014,0.00006232041,0.00004663701,0.0006227745,0.0001441267,0.0001219505],"category_scores_gemma":[0.0001178718,0.0001727992,0.00003027965,0.0003658093,0.0001292262,0.0002016979,0.0001657422,0.0004132138,0.0002177646],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001023726,"about_ca_system_score_gemma":0.00001359549,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009071427,"about_ca_topic_score_gemma":0.00009578057,"domain_scores_codex":[0.9990392,0.00002787578,0.0003021729,0.0001793262,0.0001273857,0.000324034],"domain_scores_gemma":[0.9987919,0.0002510421,0.00001970145,0.0007905584,0.00005040336,0.00009634579],"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.00003219154,0.0001210162,0.0007768877,0.00003595653,0.00003282638,0.000005339356,0.0003738848,0.3227661,0.01359808,0.3552788,0.0007618538,0.306217],"study_design_scores_gemma":[0.001009674,0.00009945349,0.01570758,0.0006134899,0.00003520933,0.00002241873,0.0003988934,0.8561807,0.009062848,0.05671486,0.05858464,0.001570188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8442509,0.001957178,0.08902201,0.005316979,0.0000856889,0.0006710989,0.00001631762,0.001450753,0.05722906],"genre_scores_gemma":[0.6186989,0.0002770571,0.3808579,0.00006917042,0.000009325972,0.00002026922,0.00000561423,0.00001600989,0.00004580874],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5334147,"threshold_uncertainty_score":0.7046549,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04898361978010056,"score_gpt":0.2897745962765607,"score_spread":0.2407909764964601,"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."}}