{"id":"W2953144065","doi":"10.48550/arxiv.1404.6233","title":"Towards Tight Bounds on Theta-Graphs","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Mathematics; Upper and lower bounds; Disjoint sets; Vertex (graph theory); Matching (statistics); Discrete mathematics; Indifference graph; 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.0003030529,0.0002857224,0.0002624821,0.0004282652,0.000207131,0.0002093664,0.001401802,0.0002251149,0.00004470374],"category_scores_gemma":[0.00002804049,0.0003040073,0.0002521171,0.0006528751,0.00006288297,0.0002256642,0.0009206873,0.0004203565,0.0002289202],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001236123,"about_ca_system_score_gemma":0.0002292232,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003260536,"about_ca_topic_score_gemma":0.00001103326,"domain_scores_codex":[0.99824,0.0001638162,0.0001719176,0.0009978265,0.000162767,0.00026369],"domain_scores_gemma":[0.9983701,0.00009413613,0.000185588,0.00102393,0.0001756821,0.0001505278],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001130978,0.00005739366,0.00007497913,0.0000179057,0.00004385633,0.00003425472,0.0000615572,0.3378973,0.0000127964,0.6580121,0.001082149,0.002694446],"study_design_scores_gemma":[0.0003057941,0.0001062579,0.001616916,0.00004281538,0.00003363256,0.000003784164,0.000004738061,0.6124919,0.0002939017,0.3743267,0.01036476,0.0004087224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1608271,0.00004106394,0.8143972,0.0003213856,0.001418708,0.0001863239,0.000008209094,0.0002481631,0.02255176],"genre_scores_gemma":[0.9935927,0.00005438082,0.002031394,0.0003861841,0.0001589575,0.000001098171,0.00003994297,0.00001177622,0.003723558],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8327656,"threshold_uncertainty_score":0.9999412,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06320896069905092,"score_gpt":0.1905753171736831,"score_spread":0.1273663564746322,"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."}}