{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005488525,0.0007525886,0.001029016,0.003037955,0.001655544,0.002035739,0.001314248,0.001015265,0.007111762],"category_scores_gemma":[0.05082703,0.0006618216,0.0009843042,0.001805665,0.002593061,0.003738081,0.002068079,0.001212328,0.0005836597],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002665283,"about_ca_system_score_gemma":0.001327663,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004019035,"about_ca_topic_score_gemma":0.003343712,"domain_scores_codex":[0.9973888,0.001389592,0.0001116301,0.0004277834,0.0003781451,0.0003040801],"domain_scores_gemma":[0.9560369,0.03345862,0.004136606,0.002705799,0.00165248,0.002009705],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009208727,0.0002939635,0.01515885,0.0003671143,0.0002253921,0.0004096337,0.00067225,0.7200518,0.007626088,0.2128352,0.005922269,0.03551657],"study_design_scores_gemma":[0.00009617512,0.0002793961,0.004506305,0.00009008043,0.00008338645,0.000400531,0.0004166822,0.8535855,0.003220084,0.135339,0.001920797,0.00006214687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6939169,0.001017648,0.270539,0.001924327,0.0001041263,0.0004690221,0.0006582949,0.0007855129,0.03058509],"genre_scores_gemma":[0.9718491,0.0003837935,0.02591335,0.0001976648,0.00003687442,0.0001715205,0.0002272767,0.0001045224,0.001115886],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007111762,"threshold_uncertainty_score":0.02902645,"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."}}