{"id":"W2217268606","doi":"10.5539/cis.v9n1p21","title":"On the Conduciveness of Random Network Graphs for Maximal Assortative or Maximal Dissortative Matching","year":2015,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Jackson State University","keywords":"Matching (statistics); Combinatorics; Vertex (graph theory); Mathematics; Similarity (geometry); Graph; Optimal matching; Random graph; Computer science; Artificial intelligence; Statistics; Image (mathematics)","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002053986,0.0001231725,0.0001818154,0.0001361911,0.0005261966,0.0003736091,0.001033443,0.00002403119,0.000004188003],"category_scores_gemma":[0.0002115564,0.00007450848,0.00004087904,0.0009622639,0.0003482681,0.003847772,0.0003541245,0.000108044,0.000004968187],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002913807,"about_ca_system_score_gemma":0.0002094684,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003273719,"about_ca_topic_score_gemma":0.000002796209,"domain_scores_codex":[0.9987552,0.0001073577,0.0003585369,0.0001781195,0.0003707318,0.0002301102],"domain_scores_gemma":[0.9977045,0.0008683571,0.000253032,0.0003640997,0.0007017368,0.0001082889],"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.0001078827,0.0000158442,0.00008181118,0.000007980761,0.00000981814,1.789784e-7,0.01215217,0.00520907,0.00002106083,0.9478376,0.0007922431,0.03376436],"study_design_scores_gemma":[0.002221168,0.0005995262,0.006807481,0.0001243807,0.000007180842,0.000008785295,0.0006802868,0.9433408,0.0007270104,0.04119981,0.003988591,0.0002949923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05608499,0.00003909116,0.9411709,0.0006620465,0.0003484176,0.0004251003,0.000004993296,0.00003768095,0.001226801],"genre_scores_gemma":[0.9612717,0.00004699876,0.03738001,0.001209836,0.00002641135,0.00004307221,0.000004634625,0.000002617683,0.00001473058],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9381317,"threshold_uncertainty_score":0.4047132,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06545764659012271,"score_gpt":0.3092737139311182,"score_spread":0.2438160673409955,"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."}}