{"id":"W2407557179","doi":"","title":"On the number of longest and almost longest cycles in cubic graphs","year":2012,"lang":"en","type":"article","venue":"Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU)","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Combinatorics","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.0007788801,0.0004017027,0.0006234043,0.001946949,0.00156943,0.002148843,0.001150744,0.001127078,0.004301362],"category_scores_gemma":[0.00653579,0.0004834067,0.0004200712,0.002145599,0.001759317,0.00327515,0.001275624,0.0007464454,0.000282344],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001701928,"about_ca_system_score_gemma":0.0006319932,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002206162,"about_ca_topic_score_gemma":0.00344029,"domain_scores_codex":[0.9990884,0.0002003444,0.00006501817,0.0002491995,0.0001727281,0.0002242796],"domain_scores_gemma":[0.9916229,0.005748266,0.001213834,0.0004725253,0.0004410107,0.0005014685],"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.001100453,0.0002429932,0.03173176,0.001519531,0.0002091821,0.0007095119,0.001572696,0.1101893,0.02000279,0.7022243,0.01748631,0.1130111],"study_design_scores_gemma":[0.00007443594,0.0001560013,0.01011665,0.0001761248,0.00009357441,0.001303868,0.001314657,0.1055218,0.007451806,0.854292,0.01939314,0.0001060427],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9279209,0.004708202,0.03434853,0.002889117,0.0001198847,0.0000441944,0.001542873,0.0001890099,0.02823723],"genre_scores_gemma":[0.9765335,0.001360822,0.01662286,0.0002404294,0.0001387968,0.00005634992,0.0007330299,0.00006752286,0.004246802],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004301362,"threshold_uncertainty_score":0.01438951,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0150280472645653,"score_gpt":0.2143569784580794,"score_spread":0.1993289311935141,"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."}}