{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009628018,0.000720815,0.001064259,0.002959948,0.002369181,0.007776485,0.002346304,0.002149023,0.01260756],"category_scores_gemma":[0.009222738,0.001146522,0.001178391,0.003746801,0.002349004,0.01040679,0.002973699,0.002184131,0.001091073],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003309342,"about_ca_system_score_gemma":0.001146866,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003795328,"about_ca_topic_score_gemma":0.003725184,"domain_scores_codex":[0.9976195,0.0005297888,0.0001470022,0.0005999926,0.0006715646,0.0004321791],"domain_scores_gemma":[0.9884166,0.006527628,0.002241667,0.0007401672,0.0009713984,0.001102509],"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.001462323,0.0005971724,0.02288137,0.0008261579,0.0002288799,0.001141968,0.003366416,0.1241892,0.007792381,0.7773151,0.01520335,0.04499558],"study_design_scores_gemma":[0.0001302706,0.000107839,0.005142679,0.00009133354,0.00008781401,0.000589147,0.00115091,0.1860053,0.004121601,0.7945374,0.007970193,0.00006532251],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9066116,0.0004670543,0.06703887,0.002341816,0.00004231909,0.0001527861,0.003553234,0.0005555167,0.01923676],"genre_scores_gemma":[0.9526454,0.0002977657,0.03273207,0.0002899579,0.00008779737,0.0001895347,0.00590099,0.0002251206,0.007631282],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01260756,"threshold_uncertainty_score":0.04217643,"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."}}