{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00280815,0.0001352588,0.0004519937,0.00003651786,0.0005830316,0.00002466148,0.0004053604,0.00007700424,0.00006433037],"category_scores_gemma":[0.003374164,0.00007652262,0.0003401467,0.00008392731,0.0005126427,0.000225895,0.00007299037,0.0001952458,2.148751e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002113557,"about_ca_system_score_gemma":0.00009249228,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.77117e-7,"about_ca_topic_score_gemma":2.059558e-7,"domain_scores_codex":[0.9983042,0.0003136019,0.0008067712,0.00007393552,0.000313667,0.0001877862],"domain_scores_gemma":[0.9927731,0.005537652,0.000852082,0.000271767,0.0005153058,0.00005006211],"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.00454585,0.00004501159,0.0001882831,0.00005226746,0.000165117,0.000004115912,0.003333997,0.000001126416,0.0001074044,0.9900072,0.001189339,0.0003603267],"study_design_scores_gemma":[0.002736684,0.0002607615,0.00003687122,0.00004869005,0.00006014052,0.0002801163,0.001946886,0.000001986618,0.002984639,0.9883654,0.003189551,0.00008830232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.989587,0.0002970908,0.0008683407,0.00006437394,0.005452991,0.0002208359,0.000009779758,0.00001187685,0.003487691],"genre_scores_gemma":[0.9948133,0.0001158986,0.003199697,0.0000169261,0.0007939294,0.000005375576,3.301479e-7,0.00002317085,0.001031391],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005531108,"threshold_uncertainty_score":0.4484267,"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."}}