{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001119079,0.0008923069,0.0009172069,0.003691737,0.003425822,0.003977932,0.001428723,0.002235101,0.01462439],"category_scores_gemma":[0.007131352,0.0008389042,0.001085656,0.002752602,0.0026752,0.008743686,0.004414923,0.001889375,0.002450525],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001730912,"about_ca_system_score_gemma":0.0008296639,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001780152,"about_ca_topic_score_gemma":0.0027661,"domain_scores_codex":[0.9972861,0.001014863,0.0001249053,0.0005928185,0.0004201011,0.0005611457],"domain_scores_gemma":[0.9934075,0.003347793,0.001124321,0.0009934925,0.0005087091,0.0006181376],"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.0001594301,0.00007584858,0.000970954,0.0001330996,0.000043636,0.0005498251,0.0004321992,0.004792715,0.0016413,0.9713014,0.005346229,0.01455325],"study_design_scores_gemma":[0.0000249848,0.00002738037,0.0005349419,0.00008347152,0.00002818632,0.0004906812,0.0003978859,0.01534009,0.001249315,0.9720895,0.009706007,0.00002771147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3707285,0.001544754,0.4007567,0.003610387,0.0007680992,0.0002991279,0.001742112,0.000569675,0.2199807],"genre_scores_gemma":[0.8436399,0.001241737,0.09874311,0.001141758,0.0004189505,0.0002731769,0.001730539,0.0002704216,0.05254032],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01462439,"threshold_uncertainty_score":0.04892343,"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."}}