{"id":"W2951301993","doi":"10.48550/arxiv.0905.0135","title":"Sums and products along sparse graphs","year":2009,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Combinatorics; Mathematics; Disjoint sets; Upper and lower bounds; Matching (statistics); Product (mathematics); Discrete mathematics; Generalization; Mathematical proof","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.0005563641,0.0004702774,0.0005959914,0.0001742862,0.0002304629,0.00006258582,0.0004599958,0.0004238819,0.00004155637],"category_scores_gemma":[0.0004851159,0.0003882655,0.000164454,0.0001479258,0.0002282633,0.00007552736,0.0008003598,0.0008826334,0.00001230759],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002588547,"about_ca_system_score_gemma":0.00005887279,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003069285,"about_ca_topic_score_gemma":0.0000201534,"domain_scores_codex":[0.9979121,0.000135342,0.0004733369,0.0007935051,0.0002736135,0.000412079],"domain_scores_gemma":[0.9979788,0.0001734926,0.0002948136,0.001295487,0.000129371,0.0001280506],"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.00008856826,0.0002467808,0.3935255,0.001801058,0.0004933055,0.0001655414,0.004072673,0.00001127643,0.00048296,0.5825164,0.009949554,0.006646375],"study_design_scores_gemma":[0.0002502908,0.00004125369,0.1507373,0.000204061,0.0001519967,0.00003065011,0.00005823327,0.000006830554,0.00120263,0.845351,0.001483788,0.0004819391],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9923677,0.001443311,0.00004397552,0.0003945058,0.0011042,0.0005777776,0.00001978108,0.0002031606,0.003845606],"genre_scores_gemma":[0.993772,0.0004723485,0.004339768,0.000268887,0.0004098953,0.00002366888,0.00002134139,0.00006312726,0.0006290154],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2628347,"threshold_uncertainty_score":0.9998569,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07651435924864014,"score_gpt":0.3007603860183592,"score_spread":0.2242460267697191,"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."}}