{"id":"W4283651127","doi":"10.1007/s00453-022-00990-4","title":"Structure and Complexity of 2-Intersection Graphs of 3-Hypergraphs","year":2022,"lang":"en","type":"article","venue":"Algorithmica","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Manitoba","funders":"Università degli Studi di Firenze","keywords":"Algorithm; Intersection graph; Intersection (aeronautics); Graph; Computer science; Combinatorics; Mathematics; Line 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":[],"consensus_categories":[],"category_scores_codex":[0.00008898073,0.00007013253,0.000135758,0.0001454947,0.00006522304,0.00002742788,0.0004325334,0.00001693126,0.00001028944],"category_scores_gemma":[0.00001172085,0.00007089562,0.00003963666,0.0004046723,0.0001968111,0.0002847445,0.0004774351,0.00009489726,8.866269e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001281951,"about_ca_system_score_gemma":0.00002183628,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005740211,"about_ca_topic_score_gemma":0.000001850414,"domain_scores_codex":[0.9993299,0.00003159197,0.0001627515,0.0001878844,0.0001959217,0.00009199758],"domain_scores_gemma":[0.9995168,0.00002065635,0.0001258309,0.0002451695,0.00006620782,0.00002527859],"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.0000330911,0.0003008369,0.001508646,0.0001685685,0.00008876467,0.00001224015,0.001749461,0.00002263579,0.09715386,0.4507212,0.001455523,0.4467852],"study_design_scores_gemma":[0.0002399574,0.0004194084,0.002333393,0.00001874815,0.000009666272,0.000106368,0.00008430236,0.02346358,0.2551741,0.7175749,0.0003923246,0.0001832882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5119278,0.0003954858,0.4831699,0.0004792803,0.0003984162,0.0002649415,0.0001312838,0.0004035915,0.002829384],"genre_scores_gemma":[0.8608704,0.000001803867,0.1390594,0.00004158277,0.000003547332,0.000003999769,0.000002827904,0.000004198936,0.00001224598],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4466019,"threshold_uncertainty_score":0.289104,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01854088776824441,"score_gpt":0.2402719741603309,"score_spread":0.2217310863920864,"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."}}