{"id":"W2405750571","doi":"","title":"On pairs of graphs having n-2 cards in common.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Arithmetic; Discrete 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.0001855518,0.0001161293,0.0002305287,0.0001382962,0.000021597,0.00001276138,0.0001552159,0.00007473482,0.0000462631],"category_scores_gemma":[0.00001226161,0.0001167693,0.00006601811,0.0002502424,0.00002932698,0.00009114873,0.00001573321,0.0001505162,0.00005455161],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002740054,"about_ca_system_score_gemma":0.000004076247,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001623579,"about_ca_topic_score_gemma":0.00001368972,"domain_scores_codex":[0.9992911,0.00005678194,0.0002419571,0.00009984396,0.0001219067,0.0001883602],"domain_scores_gemma":[0.9995424,0.00009554429,0.00002825178,0.0002645209,0.00002164246,0.0000477035],"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.000004557637,0.00006091235,0.03520025,0.00008880224,0.00003068424,0.000005648478,0.000514316,0.001040343,0.002345659,0.9577973,0.002147016,0.0007645331],"study_design_scores_gemma":[0.000600656,0.00007970517,0.04491274,0.0001428168,0.000005949193,0.0000019437,0.0002394492,0.001341106,0.004476022,0.9478964,0.0001042945,0.0001988795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9885671,0.0001691733,0.000001859304,0.000008748583,0.001275831,0.000169817,0.000001921809,0.0001022069,0.00970338],"genre_scores_gemma":[0.9998859,0.000007022185,0.000007765902,0.00001060217,0.000001928348,0.00003877002,0.000002054353,0.00002151553,0.00002439965],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01131888,"threshold_uncertainty_score":0.4761714,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005526605941752675,"score_gpt":0.1902429468726312,"score_spread":0.1847163409308785,"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."}}