{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005321872,0.0006061656,0.0003648035,0.001241874,0.0004452585,0.001016516,0.0006010064,0.0004262404,0.002691003],"category_scores_gemma":[0.003700506,0.0004286269,0.0005688741,0.0008684215,0.001264884,0.003282888,0.001650627,0.000835399,0.0003686372],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004994053,"about_ca_system_score_gemma":0.0001992418,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006458425,"about_ca_topic_score_gemma":0.0006159616,"domain_scores_codex":[0.9991587,0.000217519,0.00005944637,0.0002612298,0.0001775469,0.0001254988],"domain_scores_gemma":[0.9977175,0.0007351036,0.000464152,0.0005615464,0.0002810202,0.0002407044],"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.0004193067,0.0001268503,0.004710622,0.000239025,0.00009936904,0.0006278236,0.001518148,0.04768034,0.0269281,0.8155765,0.00290405,0.09916987],"study_design_scores_gemma":[0.00003263963,0.000165852,0.002849414,0.00004834039,0.00004705641,0.0006090328,0.0005505002,0.1342166,0.008936644,0.8435308,0.008973498,0.00003972798],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5658023,0.000349583,0.4230274,0.0001909524,0.00005427771,0.00005728977,0.0004134374,0.0002496984,0.009855106],"genre_scores_gemma":[0.9154608,0.0003909945,0.07702949,0.00009402711,0.00007016135,0.00008255571,0.0007749489,0.0001512944,0.005945696],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002691003,"threshold_uncertainty_score":0.009002268,"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."}}