{"id":"W2977288278","doi":"10.1016/j.laa.2021.10.023","title":"Incidence hypergraphs: Injectivity, uniformity, and matrix-tree theorems","year":2021,"lang":"en","type":"preprint","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Incidence matrix; Combinatorics; Discrete mathematics; Characteristic polynomial; Incidence (geometry); Injective function; Adjacency matrix; Integer matrix; Tutte polynomial; Polynomial; Graph; Eigenvalues and eigenvectors; Symmetric matrix; Nonnegative matrix; Line graph; Voltage graph","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004799604,0.0003938548,0.0004914849,0.0001786399,0.0004600795,0.0001906503,0.0004264576,0.0003943896,0.00004854712],"category_scores_gemma":[0.0001628171,0.0003804553,0.000144536,0.0004442581,0.0002428089,0.0001501001,0.001204742,0.0007338295,0.00001904809],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002033731,"about_ca_system_score_gemma":0.0001056744,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002597392,"about_ca_topic_score_gemma":0.00009273695,"domain_scores_codex":[0.9980839,0.00011242,0.0004780068,0.0008034832,0.000232646,0.0002895214],"domain_scores_gemma":[0.9976656,0.0006597876,0.0002832755,0.0009667465,0.0002228376,0.0002017427],"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.000005064294,0.0001884522,0.0005448796,0.0003687644,0.00008192867,0.000001368138,0.0004029556,0.000004193032,0.0008312969,0.9944824,0.00013065,0.002958037],"study_design_scores_gemma":[0.0001878432,0.00002079842,0.001272285,0.0001201691,0.0002121189,0.00005263994,0.0003911951,0.000952862,0.001451124,0.9929716,0.001920106,0.0004472849],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9696546,0.003438827,0.01937488,0.001124722,0.00007620265,0.001992083,0.0002235411,0.0003228142,0.003792292],"genre_scores_gemma":[0.9849204,0.001929726,0.01084091,0.0001221093,0.0002055757,0.001247718,0.0001424752,0.00006039988,0.0005306915],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01526575,"threshold_uncertainty_score":0.9998648,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02684083845138563,"score_gpt":0.3138531900473483,"score_spread":0.2870123515959627,"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."}}