{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003048278,0.001427533,0.002180139,0.002173648,0.003016803,0.004643787,0.004004795,0.002306515,0.01864685],"category_scores_gemma":[0.02286799,0.00125473,0.001979963,0.002271712,0.002795609,0.01204676,0.00451754,0.004571638,0.00273076],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00266158,"about_ca_system_score_gemma":0.001194396,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001455203,"about_ca_topic_score_gemma":0.002693321,"domain_scores_codex":[0.99536,0.001059125,0.0003074943,0.001218062,0.0009826819,0.001072703],"domain_scores_gemma":[0.963699,0.02808151,0.001680943,0.002978967,0.001154128,0.002405395],"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.00272611,0.0007882188,0.02169474,0.002181932,0.0005619169,0.002137201,0.002120132,0.05612066,0.04112732,0.6888491,0.04014882,0.1415438],"study_design_scores_gemma":[0.0003657121,0.0006188915,0.01038658,0.0004079016,0.0005213565,0.00637987,0.001092994,0.2297408,0.02176267,0.6758837,0.05261094,0.0002285846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.365726,0.006816492,0.4938993,0.01012085,0.0006722493,0.0005461721,0.006397648,0.00151708,0.1143041],"genre_scores_gemma":[0.7847787,0.003206018,0.1858122,0.001307727,0.0006775444,0.0007064017,0.003206134,0.0004318551,0.01987341],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01864685,"threshold_uncertainty_score":0.0623799,"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."}}