{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001159817,0.000440202,0.0006441462,0.0008074855,0.001122238,0.00176141,0.001106729,0.0007826351,0.004054342],"category_scores_gemma":[0.006564091,0.0005784704,0.0004873366,0.000946603,0.001746903,0.003801051,0.002048512,0.001338144,0.0004602245],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002012771,"about_ca_system_score_gemma":0.001090655,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001248168,"about_ca_topic_score_gemma":0.001707181,"domain_scores_codex":[0.9988968,0.000272566,0.00005351764,0.0004184722,0.0001887529,0.0001698758],"domain_scores_gemma":[0.9931289,0.003559484,0.0005912257,0.001972299,0.0003508822,0.0003972375],"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.0006001185,0.0002395737,0.006498623,0.0002345163,0.00003296609,0.00008857052,0.000918137,0.07279139,0.01779601,0.7927956,0.007559826,0.1004447],"study_design_scores_gemma":[0.0000796928,0.000145489,0.002611372,0.00004823422,0.00005582614,0.0002622393,0.000387596,0.2559362,0.02121171,0.7106259,0.008589233,0.00004649428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7125386,0.0002588416,0.2730145,0.0008383529,0.00003386235,0.0000967048,0.0007254088,0.0009281619,0.01156542],"genre_scores_gemma":[0.8884339,0.0002144608,0.1058484,0.0001941025,0.00003259929,0.000140032,0.001155807,0.0002393657,0.003741306],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004054342,"threshold_uncertainty_score":0.01460379,"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."}}