{"id":"W2542588801","doi":"10.1002/rsa.20778","title":"Perfect matchings and Hamiltonian cycles in the preferential attachment model","year":2018,"lang":"en","type":"preprint","venue":"Random Structures and Algorithms","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Preferential attachment; Mathematics; Combinatorics; Hamiltonian path; Hamiltonian (control theory); Vertex (graph theory); Graph; Complex network; Mathematical optimization","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002665323,0.0004066103,0.000961423,0.001346878,0.001052644,0.001624567,0.00160103,0.00167835,0.003486129],"category_scores_gemma":[0.01485185,0.0005735543,0.0006321833,0.001316362,0.00252726,0.003799856,0.001684971,0.001111281,0.0003363637],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001731433,"about_ca_system_score_gemma":0.0007985982,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00260687,"about_ca_topic_score_gemma":0.001724791,"domain_scores_codex":[0.9984539,0.0006606759,0.00006311116,0.0002873158,0.0003044091,0.0002306064],"domain_scores_gemma":[0.9921036,0.00494098,0.001174513,0.0005907902,0.000613543,0.0005765166],"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.00009257916,0.00005268496,0.001593722,0.00009886743,0.00006004304,0.0002190629,0.000265083,0.07224706,0.0008608666,0.9116091,0.001477469,0.01142341],"study_design_scores_gemma":[0.0000420279,0.00003799378,0.0004181367,0.00002243436,0.00002265677,0.0001025206,0.00006536126,0.2453612,0.0003827819,0.7522147,0.00131194,0.00001823821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4518641,0.001361242,0.5293007,0.001887333,0.00008766312,0.00009034525,0.0002116528,0.0001882673,0.01500875],"genre_scores_gemma":[0.9783846,0.000394404,0.01747603,0.0001628127,0.00005584852,0.00005905679,0.0000694594,0.00002229853,0.003375513],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003486129,"threshold_uncertainty_score":0.01409578,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04485699537068072,"score_gpt":0.3393181932293433,"score_spread":0.2944611978586626,"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."}}