{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00607076,0.004259042,0.002610638,0.005555507,0.002365226,0.006350866,0.006288131,0.002866113,0.0197741],"category_scores_gemma":[0.03700491,0.002326393,0.003079689,0.006190088,0.003812246,0.02075514,0.007471552,0.01106969,0.007363762],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005569822,"about_ca_system_score_gemma":0.001947285,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004057189,"about_ca_topic_score_gemma":0.004474168,"domain_scores_codex":[0.9911951,0.001900556,0.0003286877,0.001916797,0.002531485,0.002127333],"domain_scores_gemma":[0.9752922,0.01496204,0.00142769,0.004782859,0.002052146,0.001483054],"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.00122607,0.0005626561,0.004495617,0.001156498,0.0002611145,0.0003624383,0.0008172994,0.1297054,0.01634469,0.6542691,0.04539994,0.1453992],"study_design_scores_gemma":[0.0001266317,0.0002331844,0.001907408,0.0003420222,0.0001815166,0.0004496018,0.0003789079,0.23063,0.006882158,0.7176085,0.04117565,0.00008435743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1345211,0.01413824,0.6940176,0.01020537,0.001039344,0.0002764126,0.002887169,0.004983047,0.1379317],"genre_scores_gemma":[0.632085,0.01145703,0.316834,0.005837228,0.00203223,0.0008851824,0.005244255,0.002902692,0.02272234],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0197741,"threshold_uncertainty_score":0.06615096,"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."}}