{"id":"W2148022401","doi":"","title":"When can a graph form an orthogonal polyhedron","year":2004,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polyhedron; Vertex (graph theory); Combinatorics; Mathematics; Regular polygon; Integer points in convex polyhedra; Convex polytope; Graph; Convex set; Algorithm; Geometry; Convex optimization; Linear programming","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.000908639,0.0005201644,0.0008326212,0.000992398,0.001063496,0.003183524,0.0008687737,0.001997428,0.01204461],"category_scores_gemma":[0.01028513,0.0005198682,0.0007700928,0.001124508,0.002851849,0.009986276,0.001460442,0.001893256,0.00302441],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009631536,"about_ca_system_score_gemma":0.0006359502,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002252325,"about_ca_topic_score_gemma":0.002186672,"domain_scores_codex":[0.9980021,0.0003821947,0.0001143429,0.000645364,0.0004636289,0.000392373],"domain_scores_gemma":[0.9958247,0.001520686,0.0004094867,0.001321261,0.0005774748,0.0003463959],"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.0002758536,0.0001676458,0.002445658,0.0003695519,0.0000635098,0.0004398774,0.0009530251,0.01868694,0.004103972,0.7910032,0.02411392,0.1573769],"study_design_scores_gemma":[0.00002647839,0.00005773812,0.0006760833,0.00008688988,0.0000194538,0.0003302371,0.0008204125,0.03219436,0.002348583,0.92203,0.04137195,0.00003790178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.175022,0.001199604,0.7200281,0.01069552,0.0009689428,0.0003855056,0.002502246,0.00179185,0.08740626],"genre_scores_gemma":[0.7503501,0.001645553,0.2224792,0.001300036,0.0005026698,0.0002752827,0.002619547,0.0008166887,0.02001096],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01204461,"threshold_uncertainty_score":0.04029322,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02769961273247762,"score_gpt":0.2479184367730683,"score_spread":0.2202188240405907,"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."}}