{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002950461,0.0003044344,0.0002310093,0.001439327,0.0004835175,0.0004695379,0.0009090025,0.0001364795,0.0002241241],"category_scores_gemma":[0.00005959148,0.0003358947,0.0001049784,0.001264626,0.0000844984,0.0007306299,0.00006685455,0.0002817512,0.0001741516],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004594894,"about_ca_system_score_gemma":0.003656898,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_topic_score_codex":0.006978568,"about_ca_topic_score_gemma":0.03590395,"domain_scores_codex":[0.9975035,0.00006582982,0.000371924,0.0007422988,0.000706795,0.000609658],"domain_scores_gemma":[0.997836,0.00009615636,0.0001219474,0.0004440198,0.0004929515,0.001008903],"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.000007342388,0.0000792566,0.0002131692,0.000006517668,0.00002463793,0.00004433507,0.0004038057,0.1325382,0.00003401557,0.836016,0.0004273116,0.03020543],"study_design_scores_gemma":[0.001213973,0.0005533785,0.02883833,0.00005412619,0.00001077512,0.0001383252,0.00007921081,0.09085364,0.000189251,0.8741325,0.003146568,0.0007899491],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1965676,0.00006324326,0.7842578,0.01152544,0.0008469725,0.0003614997,0.000141463,0.0002265523,0.006009423],"genre_scores_gemma":[0.9476994,0.000003896831,0.046501,0.004940621,0.0001954421,0.00002667262,0.0004200264,0.00001797751,0.0001950132],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7511318,"threshold_uncertainty_score":0.9999093,"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."}}