Early Retinal UCHL1 Dysregulation Coupled With Synaptic Loss Reflects Alzheimer's Disease Severity.
The 1 match
- [1] § Experimental Section › Machine Learning Prediction ↔ uchl1_analysis.ipynb, lines 221–359 · score 0.66 · random forest, SHAP, instantiated, fraction, iteration, absolute
Paper
Loaded from Europe PMC by your browser, not stored by OSCR: doi.org · Europe PMC
The paper is loaded when this pane is shown.
The authors' code
Jupyter notebook · 556 lines · 19 KB · no license · 1 match
- # %% [markdown]
- # # Retinal Ubiquitin C-Terminal Hydrolase L1 Dysregulation Converges with Synaptic Vulnerability and Predicts Alzheimer’s Disease Severity
- # %% [markdown]
- # This notebook contains the ML components for the manuscript. The data loading portion is for a specific dataset; the details can be swapped out to load your own dataset.
- # %%
- data_file = "retinal_alzheimers.xlsx" # path to the data file
- required_features = ["Age (yrs)"] # features that must be defined to retain a subject
- features_to_encode = ["Sex", "Ethnicity"] # categorical features that we want to use for prediction
- features_to_drop = ["Column1", "Column2", "Column3", "APOE genotype", "APOE4 presence"]
- stratification_features = ["Clinical Diagnosis", "Sex"]
- savepath = "results/" # path where to save figures/data
- num_bars = 7 # number of features to plot in the feature identification
- # %%
- # %%
- import pandas as pd
- import numpy as np
- import sklearn as sk
- from sklearn.preprocessing import OneHotEncoder
- import anndata as ad
- from matplotlib import pyplot as plt
- from ast import literal_eval
- import scipy
- from sklearn.linear_model import Lasso
- from sklearn.ensemble import RandomForestRegressor
- import seaborn, shap
- import os
- import sklearn
- from sklearn.model_selection import cross_val_score
- from sklearn.model_selection import train_test_split
- from copy import deepcopy
- from pathlib import Path
- from sklearn.utils import shuffle
- from pathlib import Path
- import pickle as pkl # for saving
- from typing import Optional, Sequence, Tuple
- if not os.path.exists(savepath):
- p = Path(savepath)
- p.mkdir(parents=True, exist_ok=True)
- # %% [markdown]
- # # Data Loading
- # %% [markdown]
- # Note that the data file is a .xlsx file and is irregularly-shaped. To simplify loading your own data, you can have a unique index for each row and have column values in the first row.
- # %%
- def encode_apoe(df: pd.DataFrame,
- apoe_colname: str = "APOE genotype"):
- """
- Encodes APOE into a binary value depending on the presence of e4 in the string value.
- """
- if apoe_colname in df.columns:
- df["has_e4"] = df.apply(lambda x: type(x["APOE genotype"]) is str and "e4" in x["APOE genotype"], axis=1).astype(float)
- return
- # %%
- data = pd.read_excel(data_file, index_col="Pt", skiprows=2)
- encode_apoe(data)
- # Remove extraneous rows
- s = [bool(a) for a in data.index.isna()] # Some rows don't have an ID; data file is malformed.
- s = [not(a) and b != "average" for (a,b) in zip(s, data.index)] # Some rows have "average" in the ID column; data file is malformed.
- data = data.loc[s] # exclude rows
- # Some entries have things that they shouldn't; fix
- columns = data.columns
- cols_to_convert = set()
- # Gather the columns that are typed as strings, remove non-numeric data and attempt to convert.
- for i in range(data.shape[0]):
- for j in range(data.shape[1]):
- if isinstance(data.iloc[i,j], str):
- if data.iloc[i,j].endswith("*"): # some entries end in *
- data.iloc[i,j] = float(data.iloc[i,j][:-1])
- cols_to_convert.add(columns[j])
- elif data.iloc[i,j] == "na": # some entries are "na" instead of blank
- data.iloc[i,j] = 0
- cols_to_convert.add(columns[j])
- elif "," in data.iloc[i,j]: # some entries use "," as the floating point
- data.iloc[i,j] = literal_eval(data.iloc[i,j].replace(",","."))
- cols_to_convert.add(columns[j])
- for col in cols_to_convert:
- try:
- data[col] = data[col].astype(float)
- except Exception:
- continue
- # %%
- # Drop uninformative columns (blank or previously encoded)
- to_drop = [False for _ in range(data.shape[0])]
- for f in required_features:
- to_drop |= data[f].isna().values
- data = data.loc[~to_drop, :]
- # %%
- # Encode columns for one-hot encoding.
- for feat in features_to_encode:
- ohe = OneHotEncoder(sparse_output=False)
- recoded = ohe.fit_transform(data[[feat]])
- data.loc[:, ohe.get_feature_names_out()] = recoded
- if feat in stratification_features:
- stratification_features.pop(stratification_features.index(feat))
- stratification_features += list(ohe.get_feature_names_out())
- data.drop(feat, axis=1, inplace=True)
- # %%
- for feat in features_to_drop:
- data.drop(feat, axis=1, inplace=True)
- # %%
- cp_features = ["Retinal Cp % area", "Brain Cp % area"]
- retinal_biomarkers = list(data.columns[39:-7])
- for c in cp_features:
- retinal_biomarkers.pop(retinal_biomarkers.index(c)) # Retinal Cp and Brain Cp are stored in the middle of the retinal features, but we don't want to use them
- predicting_features = retinal_biomarkers
- target_features = ["Braak Stage"]
- # target_features = ["MMSE [score]"] # alternative target
- # %%
- data_train, data_test, label_train, label_test = train_test_split(data[predicting_features],
- data[target_features[0]],
- train_size=0.8,
- stratify=data[stratification_features].fillna(0),
- random_state=0)
- train_subjects = set(data_train.index)
- # %%
- # %%
- model_list = [RandomForestRegressor]
- model_names = {RandomForestRegressor: "RandomForest"}
- # %%
- def make_learning_curve(model, data_train, label_train, train_sizes=np.linspace(0.1,1,10), savepath=None):
- ret = sklearn.model_selection.learning_curve(model, data_train, label_train, train_sizes=train_sizes)
- plt.plot(ret[0], ret[2], ".-")
- plt.xlabel("Data samples")
- plt.ylabel("Score")
- # plt.title(f"Learning curve: {label_train.columns[0]}")
- plt.title(f"Learning curve: {label_train.name}")
- plt.savefig(savepath)
- plt.close()
- return
- def get_permutation_scores(model, data_train, label_train, savepath, n_permutations=200) -> (float, float):
- score, perm_scores, pvalue = sklearn.model_selection.permutation_test_score(model, data_train, label_train, n_permutations=200)
- f = open(savepath, "w")
- f.write(f"Score: {score}\n")
- f.write(f"p value: {pvalue}")
- f.close()
- return score, pvalue
- def plot_shap(model, data_train, target_name, savepath=None, num_kmeans=10, title=""):
- data_train_summary = shap.kmeans(data_train, num_kmeans)
- explainer = shap.KernelExplainer(model.predict, data_train_summary)
- shap_values = explainer.shap_values(data_train)
- shap.summary_plot(shap_values, data_train, title=f"Features predictive of {target_name}", show=False)
- plt.title(f"Features predictive of {target_name}" + f"{title}")
- if savepath is not None:
- plt.savefig(savepath, bbox_inches="tight")
- plt.close()
- return shap_values
- # %%
- model_parameters = {RandomForestRegressor: {"n_estimators":80, "criterion":"absolute_error"}}
- # %%
- for t in target_features:
- print("---------------")
- print(f"Target: {t}")
- data2 = deepcopy(data)
- to_drop = data2[t].isna().values
- data2 = data2.loc[~to_drop, :]
- data2.fillna(0, inplace=True)
- ssubj = set(data2.index)
- train_subj = list(train_subjects.intersection(ssubj))
- # val_subj = list(val_subjects.intersection(ssubj))
- pred_features2 = deepcopy(predicting_features)
- if t in pred_features2:
- pred_features2.pop(pred_features2.index(t))
- # data_train = data2.loc[train_subj, predicting_features]
- data_train = data2.loc[train_subj, pred_features2]
- label_train = data2.loc[train_subj, t]
- data_train, label_train = shuffle(data_train, label_train, random_state=0)
- if data_train.shape[0] < 20:
- print(f"too few subjects for measure {t}")
- continue
- for m in model_list:
- model = m(**model_parameters[m], random_state=0)
- model.fit(data_train, label_train)
- outpath = f"{savepath}/{model_names[m]}/{t.replace('/','div')}/"
- print(f"Model: {model_names[m]}")
- Path(outpath).mkdir(exist_ok=True, parents=True)
- make_learning_curve(model, data_train, label_train, savepath=f"{outpath}/learning_curve.png")
- score = cross_val_score(model, data_train, label_train)
- with open(f"{savepath}/permutation_score.txt", "w") as f:
- f.write(f"Score: {np.mean(score)}\n")
- print(f"Cross val. scores: {score}")
- print(f"Mean score: {np.mean(score)}")
- shap_values = plot_shap(model, data_train, t, savepath=f"{outpath}/shaps_{model.n_estimators}_{model.criterion}.png")
- print("Done")
- # %%
- import numpy as np
- import pandas as pd
- from typing import Callable, Dict, Any, Optional, Union
- import shap
- from collections import defaultdict as dd
- def feature_importance_stability(
- model_callable: Callable,
- X_train: pd.DataFrame,
- y_train: pd.Series,
- X_shap: Optional[pd.DataFrame] = None,
- params: Optional[Dict[str, Any]] = None,
- n_iterations: int = 10,
- n_top: Union[int, list] = 10,
- shap_kwargs: Optional[Dict[str, Any]] = None
- ) -> Dict[str, float]:
- """
- Train a model multiple times and compute the stability of top features based on SHAP values.
- Parameters
- ----------
- model_callable : Callable
- A callable that returns a new model instance when called with **params.
- Example: lambda **kwargs: RandomForestClassifier(**kwargs)
- X_train : pd.DataFrame
- Training features (n_samples, n_features)
- y_train : pd.Series
- Training labels (n_samples,)
- X_shap : pd.DataFrame, optional
- Data to use for SHAP value computation. If None, uses X_train.
- params : dict, optional
- Dictionary of parameters to pass to model_callable
- n_iterations : int, default=10
- Number of times to instantiate, train, and evaluate the model
- n_top : int, default=10
- Number of top features to track
- shap_kwargs : dict, optional
- Additional arguments to pass to shap.Explainer
- Returns
- -------
- dict
- Dictionary with feature names as keys and fraction of runs (0-1)
- where the feature appeared in top n as values.
- shap_value_dict
- SHAP values for each feature.
- """
- if params is None:
- params = {}
- if shap_kwargs is None:
- shap_kwargs = {}
- if X_shap is None:
- X_shap = X_train
- if isinstance(n_top, int):
- n_top = [n_top]
- # Extract feature names from DataFrame
- feature_names = list(X_train.columns)
- n_features = len(feature_names)
- # Track which features appear in top n for each iteration
- top_n_feature_dict = {}
- shap_value_dict = dd(list)
- for n in n_top:
- top_n_feature_dict[n] = dd(int)
- r_state = 0 # control initial random state
- for iteration in range(n_iterations):
- # Instantiate and train model
- model = model_callable(**params, random_state=r_state)
- r_state += 1 # ensure that we have a different state for the next iteration
- model.fit(X_train, y_train)
- # Compute SHAP values
- explainer = shap.Explainer(model, **shap_kwargs)
- shap_values = explainer(X_shap)
- # Get mean absolute SHAP values for each feature
- if hasattr(shap_values, 'values'):
- # For newer SHAP versions that return Explanation objects
- shap_array = shap_values.values
- else:
- shap_array = shap_values
- # Handle multi-class case (take mean across classes if needed)
- if len(shap_array.shape) == 3:
- mean_abs_shap = np.mean(np.abs(shap_array), axis=(0, 2))
- else:
- mean_abs_shap = np.mean(np.abs(shap_array), axis=0)
- # Get top n feature indices
- for idx in range(mean_abs_shap.shape[0]):
- shap_value_dict[feature_names[idx]].append(mean_abs_shap[idx]) # get SHAP values for each feature
- for n in n_top:
- top_n_indices = _select_top_n(mean_abs_shap, min(n, n_features))
- # Update counts for top features
- for idx in top_n_indices:
- top_n_feature_dict[n][feature_names[idx]] += 1
- shap_value_dict[feature_names[idx]].append(mean_abs_shap[idx])
- if iteration % 100 == 0:
- print(f"Iteration {iteration + 1}/{n_iterations} completed")
- print(f"Complete")
- # Convert counts to fractions
- for n in n_top:
- feature_fractions = {
- name: count / n_iterations
- for name, count in top_n_feature_dict[n].items()
- }
- # Sort by fraction (descending)
- top_n_feature_dict[n] = dict(
- sorted(feature_fractions.items(), key=lambda x: x[1], reverse=True)
- )
- return top_n_feature_dict, shap_value_dict
- def _select_top_n(scores: np.ndarray, n_top: int):
- """Select indices of top n scores."""
- n_from = scores.shape[0]
- reference_indices = np.arange(n_from, dtype=int)
- partition = np.argpartition(scores, -n_top)[-n_top:]
- partial_indices = np.argsort(scores[partition])[::-1]
- global_indices = reference_indices[partition][partial_indices]
- return global_indices
- def extract_nonzero(d):
- nd = {}
- for k, v in d.items():
- if v > 0:
- nd[k] = v
- return nd
- # %%
- # Get feature importance stability for a model.
- model = model_list[0]
- rfr_params = {"n_estimators": 80, "criterion": "absolute_error"}
- top_feats, shap_value_dict = feature_importance_stability(model,
- X_train=data_train,
- y_train=label_train,
- params=rfr_params,
- n_iterations=1000,
- n_top=[5,10])
- # %%
- top_5_feats = extract_nonzero(top_feats[5])
- top_10_feats = extract_nonzero(top_feats[10])
- # %%
- top_5_feats
- # %%
- top_10_feats
- # %%
- idx = 0
- top_feat_path = f"{savepath}/{target_features[0].replace(' ', '_')}_top_feats_{idx}.pkl"
- to_save = [top_feats, shap_value_dict]
- while os.path.exists(top_feat_path):
- idx += 1
- top_feat_path = f"{savepath}/{target_features[0].replace(' ', '_')}_top_feats_{idx}.pkl"
- print(f"Output file: {top_feat_path}")
- with open(top_feat_path, "wb") as f:
- pkl.dump(to_save, f)
- # %%
- plot_dict = dict()
- feats_list = []
- shap_frac = []
- shap_val = []
- for k in top_feats[5].keys():
- plot_dict[k] = np.zeros(2)
- plot_dict[k][0] = top_feats[5][k]
- plot_dict[k][1] = np.mean(shap_value_dict[k])
- feats_list.append(k)
- shap_frac.append(plot_dict[k][0])
- shap_val.append(plot_dict[k][1])
- # %%
- def plot_split_bars(
- features: Sequence[str],
- left_values: Sequence[float],
- right_values: Sequence[float],
- left_label: str = "Left",
- right_label: str = "Right",
- left_color: str = "#1f77b4",
- right_color: str = "#ff7f0e",
- figsize: Tuple[float, float] = (10, 6),
- ax: Optional[plt.Axes] = None
- ) -> plt.Axes:
- """
- Create a split horizontal bar plot with two values for each feature.
- Both sides are scaled from 0 (at center) to their maximum values,
- with each half occupying exactly 50% of the plot width.
- Parameters
- ----------
- features : sequence of str
- Names of the features (y-axis labels)
- left_values : sequence of float
- Values for the left side bars (assumed to start from 0)
- right_values : sequence of float
- Values for the right side bars (assumed to start from 0)
- left_label : str, default="Left"
- Label for the left bars in the legend
- right_label : str, default="Right"
- Label for the right bars in the legend
- left_color : str, default="#1f77b4"
- Color for the left bars
- right_color : str, default="#ff7f0e"
- Color for the right bars
- figsize : tuple of float, default=(10, 6)
- Figure size (width, height) in inches
- ax : matplotlib.axes.Axes, optional
- Axes to plot on. If None, creates a new figure.
- Returns
- -------
- ax : matplotlib.axes.Axes
- The axes object with the plot
- Examples
- --------
- >>> features = ['Feature A', 'Feature B', 'Feature C', 'Feature D']
- >>> left_vals = [0.8, 0.6, 0.9, 0.4]
- >>> right_vals = [120, 85, 150, 95]
- >>> ax = plot_split_bars(features, left_vals, right_vals,
- ... left_label="Score", right_label="Count")
- >>> plt.show()
- """
- # Convert to numpy arrays
- left_values = np.array(left_values)
- right_values = np.array(right_values)
- if len(features) != len(left_values) or len(features) != len(right_values):
- raise ValueError("features, left_values, and right_values must have the same length")
- # Create figure if no axes provided
- if ax is None:
- fig, ax = plt.subplots(figsize=figsize)
- # Get maximum for each side (assuming min is 0)
- left_max = np.max(left_values)
- right_max = np.max(right_values)
- # Avoid division by zero
- left_max = left_max if left_max != 0 else 1
- right_max = right_max if right_max != 0 else 1
- # Normalize each side to [0, 1] based on its own max
- left_normalized = left_values / left_max
- right_normalized = right_values / right_max
- # Y positions for bars
- y_pos = np.arange(len(features))
- # Plot left bars (extend from 0 to -1, scaled by normalized values)
- ax.barh(y_pos, -left_normalized, height=0.8,
- color=left_color, label=left_label, alpha=0.8)
- # Plot right bars (extend from 0 to 1, scaled by normalized values)
- ax.barh(y_pos, right_normalized, height=0.8,
- color=right_color, label=right_label, alpha=0.8)
- # Set y-axis labels
- ax.set_yticks(y_pos)
- ax.set_yticklabels(features)
- # Add vertical line at center
- ax.axvline(0, color='black', linewidth=1.5, linestyle='-', alpha=0.3)
- # Set x-axis limits to ensure each half occupies exactly 50%
- ax.set_xlim(-1, 1)
- # Create custom x-tick labels showing actual data values
- # Place ticks at key positions: left edge, left middle, center, right middle, right edge
- left_ticks = [-1, -0.5, 0]
- right_ticks = [0.5, 1]
- # Calculate corresponding actual values
- left_labels = [
- f'{left_max:.2g}',
- f'{0.5 * left_max:.2g}',
- '0'
- ]
- right_labels = [
- f'{0.5 * right_max:.2g}',
- f'{right_max:.2g}'
- ]
- # Set ticks and labels
- ax.set_xticks(left_ticks + right_ticks)
- ax.set_xticklabels(left_labels + right_labels)
- ax.set_xlabel('Value')
- # Add legend
- ax.legend(loc='best')
- # Add grid for easier reading
- ax.grid(axis='x', alpha=0.3, linestyle='--')
- ax.set_axisbelow(True)
- # Invert y-axis so first feature is at top
- ax.invert_yaxis()
- plt.tight_layout()
- return ax
- # %%
- if "MMSE" in target_features[0]:
- target_title = "MMSE"
- elif "Braak" in target_features[0]:
- target_title = "Braak Stage"
- else:
- target_title = target_features[0]
- ax = plot_split_bars(feats_list[:num_bars], shap_frac[:num_bars], shap_val[:num_bars], left_label="Iteration Fraction", right_label="Mean Abs. SHAP")
- ax.set_title(f"Predictive Features of {target_title}")
- fig = ax.get_figure()
- fig.savefig(f"{savepath}/{target_features[0].replace(' ', '_')}_featimpact_{idx}.png", bbox_inches='tight')
- fig.savefig(f"{savepath}/{target_features[0].replace(' ', '_')}_featimpact_{idx}.svg", bbox_inches='tight')
- # %%
uchl1_analysis.ipynb at commit 23d5d9f, no license · at the source
Overview
and 6 other authors
Keith L Black1, Lon S Schneider14, Alfredo A Sadun3, Jesse G Meyer2,15, Dieu‐Trang Fuchs1, Maya Koronyo‐Hamaoui1,8,915 affiliations
- Department of Neurosurgery, Maxine Dunitz Neurosurgical Institute, Cedars‐Sinai Medical Center, Los Angeles, California, USA
- Department of Computational Biomedicine, Cedars‐Sinai Medical Center, Los Angeles, California, USA
- Doheny Eye Institute, University of California, Los Angeles, California, USA
- Board of Governors Regenerative Medicine Institute, Cedars‐Sinai Medical Center, Los Angeles, California, USA
- Division of Infectious Diseases and Immunology, Department of Pediatrics, Guerin Children's at Cedars‐Sinai Medical Center, Los Angeles, California, USA
- Department of Biomedical Sciences, Infectious and Immunologic Diseases Research Center, Cedars‐Sinai Medical Center, Los Angeles, California, USA
- Center For Neural Science and Medicine, Cedars‐Sinai Medical Center, Los Angeles, California, USA
- Department of Biomedical Sciences, Division of Applied Cell Biology and Physiology, Cedars‐Sinai Medical Center, Los Angeles, California, USA
- Department of Neurology, Cedars‐Sinai Medical Center, Los Angeles, California, USA
- David Geffen School of Medicine, University of California, Los Angeles, California, USA
- Macquarie Medical School, Faculty of Medicine, Health and Human Sciences, Macquarie University, Sydney, NSW, Australia
- ProHeme Diagnostics Pty Ltd, Sydney, NSW, Australia
- Department of Pathology, Keck School of Medicine, University of Southern California, Los Angeles, California, USA
- Department of Psychiatry and The Behavioral Sciences, Department of Neurology, Keck School of Medicine, University of Southern California, Los Angeles, California, USA
- Smidt Heart Institute, Cedars‐Sinai Medical Center, Los Angeles, California, USA
Abstract
Synaptic dysfunction is a major driver of cognitive decline in Alzheimer's disease (AD), yet its extent and molecular basis in the retina remain poorly defined. We integrated postmortem retinal and matched brain histopathology with ultrastructural, proteomic, biochemical, and machine‐learning analyses across cognitively normal, mild cognitive impairment, and AD cohorts. Retinal glutamatergic synapses exhibited early, progressive degeneration, marked by loss of presynaptic vesicular glutamate transporter 1 (VGLUT1) and synaptophysin and postsynaptic density protein 95 (PSD95) and N‐methyl‐D‐aspartate receptor subunit 2A (NMDAR2A), along with ribbon synapse ultrastructural disruption. Synaptic deficits correlated with amyloid‐β42 (Aβ42), pathogenic tau, oxidative stress, the Aβ‐binding p75 neurotrophin receptor, and glial activation that paralleled disease progression. Proteomics revealed widespread synaptic remodeling accompanied by disease‐associated microglia, astrocyte‐mediated excitotoxicity, and pyroptotic pathways. The synapse‐enriched deubiquitinase ubiquitin C‐terminal hydrolase L1 (UCHL1) was dysregulated early, particularly in horizontal and bipolar interneurons, and strongly associated with synaptic loss and neuroinflammation. Mechanistically, fibrillar Aβ42 induced rapid UCHL1 and synaptic depletion in human and murine neurons before overt neurodegeneration. Machine‐learning models identified retinal UCHL1 as the strongest predictor of Braak stage and cognitive impairment. These findings establish the retina as an early site of AD synaptopathy and position UCHL1 as a candidate biomarker and mechanistic mediator linking amyloid pathology, neuroinflammation, and synaptic vulnerability.
Reproduced under the paper's license (CC BY), from the paper cited above.
Repository
Its files are read in the Code ↔ Paper reader above, with 1 match between paragraphs and lines of code.
Xomicsdatascience/Ubiquitin_Ad
23d5d9fd2b84d6c372a82e9fc83e7ed48c597f20, 2 December 2025Availability: 1 check, the latest on 27 September 2026: the link answers
- 27 September 2026: the link answers
2 files
- uchl1_analysis.ipynb, Jupyter, 556 lines, 1 match
- README.md, Text, 3 lines
The paper's code and data availability statement is in the Data section.
Tracing map
Proposed by the machine: these links were found in the paper and verified at the source, without human review. The map will receive a Zenodo DOI once one of the paper's authors has validated it with their ORCID.
What the map holds:
- 1 repository of the authors' code, each at its verified commit, with its license and how the link was found in the paper;
- 1 script, each with its path and the digest of its content;
- 1 match between paragraphs of the paper and lines of the code (method lexical-v1);
- neither the text of the paper nor the code itself.
Its JSON (tracing-map.json) is deposited on Zenodo with its DOI once the map is validated.
Data
No dataset and no data link were found in the paper.
Data Availability Statement
Mass spectrometry data are publicly available via the PRIDE Database under the ProteomeXchange accession number PXD040225. All data are available in the main text, tables, and figures or in the supplementary materials (Figures S1–S12 and Tables S1–S7). All other material or data requests should be addressed to the corresponding author. The Jupyter Notebook containing the analysis with random forests has been uploaded to https://
Reproduced under the paper's license (CC BY), from the paper cited above.
Versions
The history of this record: each version stored by the harvester or made by a correction of its authors or of the maintainers of its code, and what changed in its facts. The texts of the paper (its abstract, its availability statements) are not part of it; versions that changed only those are not listed.
Version 1, 27 September 2026: the first record
Recorded: type, language, journal, pages, dates, 26 authors, 8 keywords, 8 funders, 188 references, 25 RRIDs.
Cite
This paper
Rentsendorj, A., Vit, J., Hutton, A., Koronyo, Y., Shahin, S., Robinson, E., Barron, E., Rodriguez, A., Jallow, O., Sheyn, J., Gaire, B. P., Subedi, L., Davis, M. R., Gnanabharathi, B., Ljubimov, A. V., Graham, S. L., Gupta, V. K., Mirzaei, M., Hawes, D., . . . Koronyo‐Hamaoui, M. (2026). Early Retinal UCHL1 Dysregulation Coupled With Synaptic Loss Reflects Alzheimer's Disease Severity. Advanced science (Weinheim, Baden-Wurttemberg, Germany), e00020. https://
BibTeX
@article{rentsendorj2026
author = {Rentsendorj, Altan and Vit, Jean‐Philippe and Hutton, Alexandre and Koronyo, Yosef and Shahin, Saba and Robinson, Edward and Barron, Ernesto and Rodriguez, Anthony and Jallow, Ousman and Sheyn, Julia and Gaire, Bhakta Prasad and Subedi, Lalita and Davis, Miyah R and Gnanabharathi, Barathan and Ljubimov, Alexander V and Graham, Stuart L and Gupta, Vivek K and Mirzaei, Mehdi and Hawes, Debra and Silm, Katlin and Black, Keith L and Schneider, Lon S and Sadun, Alfredo A and Meyer, Jesse G and Fuchs, Dieu‐Trang and Koronyo‐Hamaoui, Maya},
title = {{Early Retinal UCHL1 Dysregulation Coupled With Synaptic Loss Reflects Alzheimer's Disease Severity}},
journal = {Advanced science (Weinheim, Baden-Wurttemberg, Germany)},
year = {2026},
month = aug,
pages = {e00020},
publisher = {Wiley},
issn = {2198-3844},
doi = {10.1002/
url = {https://
pmid = {42666080},
pmcid = {PMC13525425}
}
RIS
TY - JOUR
AU - Rentsendorj, Altan
AU - Vit, Jean‐Philippe
AU - Hutton, Alexandre
AU - Koronyo, Yosef
AU - Shahin, Saba
AU - Robinson, Edward
AU - Barron, Ernesto
AU - Rodriguez, Anthony
AU - Jallow, Ousman
AU - Sheyn, Julia
AU - Gaire, Bhakta Prasad
AU - Subedi, Lalita
AU - Davis, Miyah R
AU - Gnanabharathi, Barathan
AU - Ljubimov, Alexander V
AU - Graham, Stuart L
AU - Gupta, Vivek K
AU - Mirzaei, Mehdi
AU - Hawes, Debra
AU - Silm, Katlin
AU - Black, Keith L
AU - Schneider, Lon S
AU - Sadun, Alfredo A
AU - Meyer, Jesse G
AU - Fuchs, Dieu‐Trang
AU - Koronyo‐Hamaoui, Maya
TI - Early Retinal UCHL1 Dysregulation Coupled With Synaptic Loss Reflects Alzheimer's Disease Severity
T2 - Advanced science (Weinheim, Baden-Wurttemberg, Germany)
J2 - Adv Sci (Weinh)
PY - 2026
DA - 2026/
SP - e00020
SN - 2198-3844
PB - Wiley
DO - 10.1002/
UR - https://
LA - en
ER -
CSL-JSON
{
"id": "10.1002/
"type": "article-journal",
"title": "Early Retinal UCHL1 Dysregulation Coupled With Synaptic Loss Reflects Alzheimer's Disease Severity",
"container-title": "Advanced science (Weinheim, Baden-Wurttemberg, Germany)",
"author": [
{
"family": "Rentsendorj",
"given": "Altan"
},
{
"family": "Vit",
"given": "Jean‐Philippe"
},
{
"family": "Hutton",
"given": "Alexandre"
},
{
"family": "Koronyo",
"given": "Yosef"
},
{
"family": "Shahin",
"given": "Saba"
},
{
"family": "Robinson",
"given": "Edward"
},
{
"family": "Barron",
"given": "Ernesto"
},
{
"family": "Rodriguez",
"given": "Anthony"
},
{
"family": "Jallow",
"given": "Ousman"
},
{
"family": "Sheyn",
"given": "Julia"
},
{
"family": "Gaire",
"given": "Bhakta Prasad"
},
{
"family": "Subedi",
"given": "Lalita"
},
{
"family": "Davis",
"given": "Miyah R"
},
{
"family": "Gnanabharathi",
"given": "Barathan"
},
{
"family": "Ljubimov",
"given": "Alexander V"
},
{
"family": "Graham",
"given": "Stuart L"
},
{
"family": "Gupta",
"given": "Vivek K"
},
{
"family": "Mirzaei",
"given": "Mehdi"
},
{
"family": "Hawes",
"given": "Debra"
},
{
"family": "Silm",
"given": "Katlin"
},
{
"family": "Black",
"given": "Keith L"
},
{
"family": "Schneider",
"given": "Lon S"
},
{
"family": "Sadun",
"given": "Alfredo A"
},
{
"family": "Meyer",
"given": "Jesse G"
},
{
"family": "Fuchs",
"given": "Dieu‐Trang"
},
{
"family": "Koronyo‐Hamaoui",
"given": "Maya"
}
],
"container-title-short":
"page": "e00020",
"DOI": "10.1002/
"PMID": "42666080",
"PMCID": "PMC13525425",
"ISSN": "2198-3844",
"publisher": "Wiley",
"URL": "https://
"language": "en",
"issued": {
"date-parts": [
[
2026,
8,
29
]
]
}
}
The tracing map gets a citation of its own once an author has validated it and it has a DOI.
Similar papers
The papers with a page that share the most with this one: the tools found in their code, their categories, datasets, cited references and authors, the rarest counting most.
- [1] doi:10.1111/ejn.70480 [code]
- Astrocyte Proximity Protects Synapses From Human Amyloid-Beta Induced Degeneration in a Mouse Ex Vivo Model of Early Alzheimer's Disease.Journal: The European journal of neuroscienceIn common: seaborn, scikit-learn, pandas, 3 other tools, Alzheimer's / dementia, cellular / molecular, 7 references
- [2] doi:10.1038/s44318-026-00818-9 [code]
- FAM134B-mediated ER-phagy degrades APP and suppresses Alzheimer's disease pathology.Journal: The EMBO journalIn common: anndata, seaborn, scikit-learn, 4 other tools, Alzheimer's / dementia, cellular / molecular, 2 references
- [3] doi:10.1162/imag.a.1174 [code]
- Retinal nerve fibre layer thickness reflects characteristics of brain grey and white matter.Journal: Imaging neuroscience (Cambridge, Mass.)In common: Matplotlib, NumPy, 5 references
- [4] doi:10.1038/s41514-026-00443-0 [code]
- Network-based discovery of regulatory drivers of cognitive decline in alzheimer's disease.Journal: npj agingIn common: seaborn, scikit-learn, pandas, 3 other tools, Alzheimer's / dementia, 3 references
- [5] doi:10.1038/s41593-026-02267-3 [code]
- Spatial proteomic analysis in human Alzheimer's disease brains enables identification of microenvironment-depende
nt microglial cell states. Journal: Nature neuroscienceIn common: anndata, seaborn, scikit-learn, 4 other tools, Alzheimer's / dementia, cellular / molecular, 2 references - [6] doi:10.1002/ana.78300
- Distribution of Big Tau Isoforms in the Human Central and Peripheral Nervous System.Journal: Annals of neurologyIn common: Alzheimer's / dementia, 6 references
- [7] doi:10.1038/s42003-026-09923-1 [code]
- Scalable discovery of spatial multicellular patterns via neighborhood-to-sequence
transformation. Journal: Communications biologyIn common: anndata, scikit-learn, pandas, 2 other tools, Alzheimer's / dementia, 3 references - [8] doi:10.1038/s41467-026-76837-1 [code]
- Drug screen and machine learning predict neuroprotective agents in a preclinical human model of childhood dementia.Journal: Nature communicationsIn common: SHAP, seaborn, scikit-learn, 4 other tools, Alzheimer's / dementia, 1 reference
- [9] doi:10.1038/s41467-026-71831-z [code]
- Dysfunction of the episodic memory network in the Alzheimer's disease cascade.Journal: Nature communicationsIn common: seaborn, scikit-learn, pandas, 2 other tools, Alzheimer's / dementia, 3 references
- [10] doi:10.1002/imt2.70163 [code]
- Spatial multi-omics unveils sphingolipid metabolic reprogramming within the retinal pathological niche.Journal: iMetaIn common: anndata, seaborn, scikit-learn, 4 other tools, cellular / molecular, 2 references
Contribute
The authors of this paper can claim it, correct its record and validate its tracing map, and the maintainers of its code (its owner, or a public member of its organization) correct what it says of their repository; anyone signed in can ask for its removal. Every request goes to OSCR's own machine, which answers it; your account page follows them.
Sign in with ORCID to claim this paper as one of its authors, correct its record or validate its tracing map: when the paper's metadata lists your ORCID iD, you are recognized at once. Maintainers of its code: sign in with GitHub, then claim the repository on your account page.
Claim this paper
Correct its record
Say what each link of this record is, remove the ones that are not the paper's, add the ones that are missing. The correction becomes a new version of the record, in its Versions section.
Validate its tracing map
You validate the map as this page shows it: 1 repository of the authors' code, each at its verified commit and with its license, 1 script, and 1 match between paragraphs and code (see the Code and Map sections). It then receives a DOI on Zenodo, with you (your ORCID iD) and OSCR as its creators; the code itself is not deposited.
The map's fingerprint: sha256:6fe4b6b432552e04…
Add the badge to its README
The badge links the code to this page. Copy one of these into the README of the paper's code: only you decide where it goes, and nothing is changed for you.
Markdown
[, paste the snippet at the top, then “Commit changes…” and, to review it first, “Create a new branch and start a pull request”. You open the pull request; OSCR asks for no permission.
Request its removal
To ask OSCR to remove this record, the copies of its authors' scripts or its tracing map, use the removal request page: signed in, you say who you are, what to remove and why, then review and confirm the request. Published rules decide every request (how).
Discussion, reproductions, activity
Discussion: questions and error reports about this paper and its code, from signed-in readers and its authors. It opens with sign-in.
Reproductions: reports from readers who ran the authors' code: what they reproduced, with which environment, commit and data. It opens with sign-in.
Activity: what happens around this paper: new versions of its record, its map's validation, discussions and reproductions. It opens with sign-in.
