{"id":"W4226086949","doi":"10.1016/j.dam.2023.02.005","title":"Isometric Hamming embeddings of weighted graphs","year":2023,"lang":"en","type":"preprint","venue":"Discrete Applied Mathematics","topic":"Advanced Computing and Algorithms","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"Institute for Collaborative Biotechnologies; Division of Chemical, Bioengineering, Environmental, and Transport Systems; National Institute of Environmental Health Sciences; National Institute of General Medical Sciences; Army Research Office; Alfred P. Sloan Foundation; Natural Sciences and Engineering Research Council of Canada; Office of Naval Research; Google; National Science Foundation; National Institutes of Health; United States-Israel Binational Science Foundation","keywords":"Hamming graph; Combinatorics; Mathematics; Discrete mathematics; Vertex (graph theory); Embedding; Hamming distance; Hamming code; Graph; Computer science; Algorithm","routes":{"ca_aff":true,"ca_fund":true,"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.0009049572,0.0003126741,0.0006881631,0.0005074832,0.0003323119,0.00009416825,0.0007893124,0.000344004,0.00002953979],"category_scores_gemma":[0.0002689172,0.0003065177,0.0002440767,0.001290466,0.0003090076,0.0000384235,0.0006734236,0.000529004,0.00006525481],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008151853,"about_ca_system_score_gemma":0.0001477221,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000147581,"about_ca_topic_score_gemma":0.00001732884,"domain_scores_codex":[0.9975055,0.00003273011,0.0006726169,0.0004739798,0.0008072626,0.0005079135],"domain_scores_gemma":[0.9978061,0.0005961834,0.0007693343,0.000562657,0.0001305191,0.0001352596],"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.000007350005,0.0001539868,0.00003720074,0.001510526,0.0002301035,0.000008737375,0.04530456,0.0009030209,0.0003485551,0.9320084,0.0008064656,0.0186811],"study_design_scores_gemma":[0.0002132126,0.00001560438,0.00002670075,0.0005096832,0.0001188593,4.345406e-7,0.01287991,0.006679901,0.0006491967,0.9767928,0.001547199,0.0005664604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.162286,0.0006301589,0.6505764,0.0007307414,0.003060807,0.00326305,0.0002099611,0.002902835,0.1763401],"genre_scores_gemma":[0.5183799,0.0005335009,0.47765,0.00003867935,0.0004860199,0.0001450147,0.00008903297,0.00017092,0.00250698],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.3560939,"threshold_uncertainty_score":0.9999387,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04113380763223667,"score_gpt":0.3341166078747166,"score_spread":0.2929828002424799,"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."}}