{"id":"W2031324894","doi":"10.1016/j.laa.2013.02.030","title":"Two Laplacians for the distance matrix of a graph","year":2013,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":252,"is_retracted":false,"has_abstract":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Algebraic connectivity; Resistance distance; Mathematics; Laplacian matrix; Distance matrix; Combinatorics; Laplace operator; Eigenvalues and eigenvectors; Connectivity; Graph; Discrete mathematics; Line graph; Mathematical analysis; Graph power; Physics","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001336656,0.00009131915,0.0001243136,0.00003154511,0.0002684576,0.00001938846,0.000195993,0.00003538986,0.00006596531],"category_scores_gemma":[0.00004537535,0.00006362156,0.00007203234,0.0002376201,0.00009551367,0.0000611049,0.0000263914,0.00006334291,0.00002901574],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002817625,"about_ca_system_score_gemma":0.00001030461,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008692384,"about_ca_topic_score_gemma":0.00001259352,"domain_scores_codex":[0.9994077,0.00001382904,0.0002265236,0.0001548899,0.00006841641,0.000128642],"domain_scores_gemma":[0.9985947,0.000786988,0.0001093971,0.0003429429,0.000119361,0.00004661024],"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.000002934447,0.00006286507,0.000025806,0.00004637682,0.0000223453,6.964153e-9,0.0001231399,0.000002505869,0.001577721,0.9958151,0.0009941204,0.001327056],"study_design_scores_gemma":[0.0002491448,0.00001568077,0.0001463683,0.000008519872,0.00006901226,0.00000184747,0.0002674107,0.001644916,0.001988377,0.9542289,0.04128619,0.00009360564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.160078,0.002077475,0.8191006,0.007514049,0.00005021087,0.007311083,0.0005563132,0.0001961941,0.003116088],"genre_scores_gemma":[0.9797865,0.0001538001,0.01402035,0.0001130223,0.00009647847,0.004342872,0.00002165751,0.00002198147,0.001443343],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8197085,"threshold_uncertainty_score":0.2594412,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02218523395327058,"score_gpt":0.3144036897424108,"score_spread":0.2922184557891402,"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."}}