{"id":"W2022058915","doi":"10.1016/j.jcta.2007.11.007","title":"The number of possibilities for random dating","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Combinatorics; Vertex (graph theory); Induced subgraph isomorphism problem; Mathematics; Random graph; Graph; Set (abstract data type); Discrete mathematics; Computer science; Line graph; Voltage graph; Programming language","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.01041894,0.0005664479,0.002648909,0.002743752,0.005322899,0.01079904,0.004528337,0.006465213,0.02683864],"category_scores_gemma":[0.07386266,0.002160711,0.00198603,0.002874154,0.007363716,0.02255811,0.004438828,0.006285284,0.002242774],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001524254,"about_ca_system_score_gemma":0.001104908,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002678656,"about_ca_topic_score_gemma":0.0003878298,"domain_scores_codex":[0.9929839,0.003356183,0.0004443768,0.00137421,0.001151239,0.0006900125],"domain_scores_gemma":[0.9146667,0.06278479,0.004,0.01332607,0.001855741,0.003366712],"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.0001409036,0.0000405303,0.001195829,0.00007178616,0.00003420788,0.0001033101,0.0002186003,0.003060151,0.0001937343,0.9839988,0.002388227,0.008553797],"study_design_scores_gemma":[0.00002888272,0.000008351441,0.0001568399,0.00002245443,0.00001930207,0.0003010306,0.0001043723,0.006244806,0.0001692714,0.9910706,0.001854194,0.00001978801],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5297794,0.004430896,0.1991441,0.02236618,0.0004939478,0.0001775526,0.001938808,0.001245203,0.2404239],"genre_scores_gemma":[0.9704746,0.0006800959,0.0174854,0.0004740442,0.000270693,0.0001522658,0.0002648745,0.0001670247,0.01003097],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02683864,"threshold_uncertainty_score":0.08978415,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02580193314037548,"score_gpt":0.3056127799729388,"score_spread":0.2798108468325633,"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."}}