{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004800302,0.0004003588,0.0006365026,0.00007105328,0.0001890631,0.0002558063,0.0002973106,0.0002666349,0.00002506467],"category_scores_gemma":[0.0002357733,0.0002437155,0.00008316484,0.0000456925,0.0001348981,0.00003611014,0.0004469782,0.0006129465,5.699367e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002217562,"about_ca_system_score_gemma":0.00005142981,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007051651,"about_ca_topic_score_gemma":0.00004250388,"domain_scores_codex":[0.9982478,0.00009899688,0.0004110538,0.0005448253,0.0003698238,0.0003275075],"domain_scores_gemma":[0.9987683,0.0005957091,0.0001679756,0.0003259745,0.00005108465,0.00009097515],"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.001865214,0.0003453227,0.00014429,0.006938023,0.0006904238,0.00008570361,0.02711638,0.001099949,0.0001922795,0.8046628,0.002902578,0.1539571],"study_design_scores_gemma":[0.001814702,0.00006123862,0.0002607881,0.0001513867,0.0001300358,0.00003293894,0.0001115177,0.2240833,0.00002618745,0.7730598,0.00002218396,0.0002459406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2768502,0.001286762,0.7190334,0.0003464212,0.0004403575,0.001261621,0.0003762448,0.00005838598,0.000346659],"genre_scores_gemma":[0.9331797,0.0004056222,0.06575213,0.0001350473,0.0003254738,0.00009603779,0.00002777319,0.00003894797,0.00003923398],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6563296,"threshold_uncertainty_score":0.993843,"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."}}