{"id":"W2741567607","doi":"","title":"A sharp lower bound on the number of hyperedges in a friendship 3-hypergraph.","year":2013,"lang":"en","type":"article","venue":"Australas. J Comb.","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Manitoba","funders":"","keywords":"Hypergraph; Combinatorics; Element (criminal law); Friendship; Mathematics; Upper and lower bounds; Set (abstract data type); Discrete mathematics; Computer science; Mathematical analysis; Law; Social psychology","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":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001744578,0.0001654813,0.0002078527,0.0000713922,0.00003494788,0.00003777271,0.0002534394,0.00009937615,0.001178761],"category_scores_gemma":[0.00001967449,0.0001192937,0.00009505569,0.0002934437,0.00008207052,0.0001095656,0.0000178137,0.0002388217,0.0005066036],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001680251,"about_ca_system_score_gemma":0.000006464297,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001241423,"about_ca_topic_score_gemma":0.00002414649,"domain_scores_codex":[0.9991173,0.00005894436,0.0002591481,0.0001399417,0.0001419938,0.0002827229],"domain_scores_gemma":[0.9993632,0.0001571308,0.00003248892,0.0003644819,0.00002582836,0.00005683363],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00009871463,0.0007183132,0.3057665,0.0005107964,0.0004553836,0.00005506059,0.003409377,0.003028214,0.03060218,0.6115158,0.04033191,0.003507759],"study_design_scores_gemma":[0.003152326,0.0004379521,0.779898,0.001177374,0.00009192668,0.0001203004,0.003910797,0.003370779,0.03576925,0.1417636,0.02833463,0.001973023],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9632745,0.00005526442,0.00000340589,0.000167312,0.0003625309,0.0002242537,0.00000761474,0.00007276179,0.03583236],"genre_scores_gemma":[0.9993509,0.000009244558,0.00001230267,0.00005500412,0.00003775705,0.00008137464,0.000002390287,0.00002532224,0.0004256747],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4741315,"threshold_uncertainty_score":0.9997343,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01392492239175733,"score_gpt":0.2137628931770847,"score_spread":0.1998379707853273,"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."}}