{"id":"W2059252479","doi":"10.4171/owr/2012/19","title":"Mini-Workshop: Hypergraph Turán Problem","year":2013,"lang":"en","type":"article","venue":"Oberwolfach Reports","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hypergraph; Computer science; Mathematics; Combinatorics","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.002241384,0.001272495,0.001057595,0.001020238,0.001291006,0.002713582,0.002164951,0.00216822,0.0458828],"category_scores_gemma":[0.004371116,0.0005356958,0.001699267,0.0009537716,0.0007253668,0.004515465,0.003260406,0.005138729,0.0132193],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001587604,"about_ca_system_score_gemma":0.001205951,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008259518,"about_ca_topic_score_gemma":0.001099646,"domain_scores_codex":[0.9988417,0.0004145599,0.00004892072,0.000318863,0.0002312429,0.0001446805],"domain_scores_gemma":[0.9974368,0.00102443,0.00007415353,0.0002495079,0.0006241829,0.0005909191],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0003225067,0.0001626696,0.000434189,0.0006136477,0.000105769,0.0003455223,0.0001958872,0.006857062,0.002493759,0.184887,0.7070049,0.09657706],"study_design_scores_gemma":[0.0001224896,0.0002085824,0.001514501,0.0004652611,0.0001180705,0.0006880728,0.0004102318,0.03634584,0.003536687,0.3698984,0.586588,0.0001037901],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.04355246,0.02671804,0.4500329,0.09556192,0.09723481,0.0006017449,0.005289142,0.001812694,0.2791963],"genre_scores_gemma":[0.2664641,0.0183967,0.1402809,0.02199193,0.07443777,0.001440356,0.01507017,0.003098248,0.4588198],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.0458828,"threshold_uncertainty_score":0.1534932,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01201486530350154,"score_gpt":0.2302527873693034,"score_spread":0.2182379220658019,"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."}}