{"id":"W4281652320","doi":"10.4230/lipics.icalp.2023.57","title":"Optimal Adjacency Labels for Subgraphs of Cartesian Products","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo; Agence Nationale de la Recherche","keywords":"Adjacency list; Combinatorics; Cartesian product; Mathematics; Cartesian coordinate system; Graph; Class (philosophy); Discrete mathematics; Adjacency matrix; Computer science; Artificial intelligence","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004990764,0.0003057165,0.0004442546,0.0004472141,0.0002264326,0.0000502146,0.001947962,0.0001755136,0.00003106114],"category_scores_gemma":[0.00006464252,0.0003582561,0.0002933469,0.001120448,0.0001299525,0.0002111167,0.001807396,0.0004270343,0.000006342113],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006989993,"about_ca_system_score_gemma":0.0003666118,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000134043,"about_ca_topic_score_gemma":0.000008198877,"domain_scores_codex":[0.9976682,0.0001308389,0.0003037393,0.001334741,0.0001493996,0.0004130572],"domain_scores_gemma":[0.9973283,0.000104851,0.0003971244,0.001618361,0.0004111671,0.0001401405],"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.00005016659,0.0002822821,0.001620286,0.000379754,0.0001504255,0.00006698666,0.0005427945,0.2470068,0.0007334076,0.7471851,0.001649364,0.000332575],"study_design_scores_gemma":[0.003609893,0.001223453,0.001197363,0.0003602053,0.0004916848,0.00001721853,0.0004429648,0.4353167,0.0100773,0.538186,0.006598995,0.002478197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8082488,0.0007559874,0.1850504,0.0005032167,0.001974543,0.001409475,0.0001340408,0.000487946,0.001435661],"genre_scores_gemma":[0.9792784,0.0001083243,0.01911749,0.00005405714,0.00001297946,0.000006703836,0.00003747408,0.00002263129,0.001361881],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2089991,"threshold_uncertainty_score":0.9998869,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06837309668492549,"score_gpt":0.1897325292423077,"score_spread":0.1213594325573822,"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."}}