A brain reward circuit inhibited by next-generation weight-loss drugs in mice.
The 9 matches
- [1] § Methods › Home-cage monitoring of Glp1rS33W mice › Grouped behaviour analysis ↔ network_plot.ipynb, lines 87–194 · score 0.73 · Behavioural transition networks, transition probabilities, NetworkX, undirected, global, Node
- [2] § Behavioural profiling in Glp1rS33W mice ↔ GLMM_beta_behavior.R, lines 1–55 · score 0.72 · random intercept, mouse ID, LiCl, beta, fitted, spent
- [3] § Methods › Home-cage monitoring of Glp1rS33W mice › Behaviour localization and categorization ↔ location_behavior.ipynb, lines 277–316 · score 0.69 · broader categories, food motivated, Pause, sniff, locations, hopper
- [4] § Behavioural profiling in Glp1rS33W mice ↔ network_plot.ipynb, lines 87–194 · score 0.67 · transition network, Transition probabilities, food motivated, Arrow, Node, raw
- [5] § Methods › Home-cage monitoring of Glp1rS33W mice › Grouped behaviour analysis ↔ build_dataset.ipynb, lines 160–197 · score 0.63 · outgoing transitions, starting behaviour, normalized transition, probabilities
- [6] § Behavioural profiling in Glp1rS33W mice ↔ PCA.R, lines 82–151 · score 0.63 · Principal component, LiCl, PC1, PC2, PCA, variance
- [7] § Behavioural profiling in Glp1rS33W mice ↔ bar_behavior_plots.R, lines 324–398 · score 0.59 · distance travelled, LiCl, motivated, fed, drinking, grooming
- [8] § Methods › Fibre photometry recordings › Calcium analysis (GCaMP) ↔ GCaMP Calcium Events.m, lines 312–341 · score 0.57 · scored trace, smoothed, events, calcium, max, min
- [9] § Methods › Homeostatic (SD) food intake ↔ GLMM_beta_behavior.R, lines 1–55 · score 0.52 · cage floor, dark cycle, SD, drug, vehicle, food
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 · 198 lines · 6.1 KB · MIT · 2 matches
- # %% [markdown]
- # ### This script makes example transition network plots
- #
- # #### Use the transition csv made in build_dataset.ipynb OR real data from normalized_transitions.csv
- # %%
- import matplotlib.pyplot as plt
- from matplotlib import cm
- from matplotlib.colors import to_rgba
- from matplotlib.patches import FancyArrowPatch, Circle
- from matplotlib.lines import Line2D
- import networkx as nx
- import numpy as np
- import os
- import pandas as pd
- # %%
- # Set the working directory
- path_to_csvs = r"C:\Users\irs3th\glp1r-reward-circuit"
- if not os.path.exists(path_to_csvs):
- raise FileNotFoundError(f"Cannot find the path: '{path_to_csvs}'")
- # Verify
- os.chdir(path_to_csvs)
- print("Current Working Directory:", os.getcwd())
- # %%
- # Read csv from build_dataset
- transition_df = pd.read_csv('normalized_transitions.csv')
- # %% [markdown]
- # ## Combining transitions by directionality
- #
- # #### This step merges reciprocal transitions so that, for example, "groom to move" and "move to groom" are combined into a single, bidirectional transition
- #
- # #### Only run this section if your dataset includes bidirectional transitions (the toy data does not so this code is for demonstration)
- #
- # #### If you're not combining directions, you can skip this step and move on to averaging
- # %%
- # collect all transition columns (skip id + group)
- transition_cols = [c for c in transition_df.columns if c not in ["id", "group"]]
- pairs = {}
- for col in transition_cols:
- src, dst = col.split("_", 1) # split only on first underscore
- reverse = f"{dst}_{src}"
- if reverse in transition_cols:
- # build a standardized name (alphabetical to avoid duplicates)
- merged_name = "_".join(sorted([src, dst]))
- pairs.setdefault(merged_name, set()).update([col, reverse])
- else:
- # transitions without a reverse pair stay as is
- pairs[col] = {col}
- # now combine
- for merged_name, cols in pairs.items():
- transition_df[merged_name] = transition_df[list(cols)].sum(axis=1)
- # drop the old directed columns
- transition_df = transition_df[["id", "group"] + list(pairs.keys())]
- # print(transition_df.head())
- # %%
- # Average normalized probability by group
- avg_transition_matrix = (
- transition_df
- .drop(columns=["id"]) # remove numeric ID
- .groupby("group")
- .mean()
- )
- filtered = avg_transition_matrix.reset_index()
- filtered = filtered[
- ~(
- filtered["group"].str.endswith("_light", na=False) |
- filtered["group"].str.startswith("veh", na=False) |
- filtered["group"].str.startswith("saline", na=False)|
- filtered["group"].str.startswith("no", na=False)
- )
- ]
- filtered
- # %% [markdown]
- # ### Plot for combined bidirectional transitions
- # ### Aesthetic updates
- # #### - scaled colors for edges
- # #### - double arrowheads
- # #### - more space between nodes and edges
- # %%
- # Node colors
- node_colors = {
- 'food motivated': 'blue',
- 'drink': 'green',
- 'move/explore': 'hotpink',
- 'groom': 'orange',
- 'shelter': 'grey'
- }
- behavior_numbering = {behavior: i + 1 for i, behavior in enumerate(node_colors)}
- number_to_behavior = {v: k for k, v in behavior_numbering.items()}
- # Calculate global max weight for scaling edges
- # filtered: rows = groups, columns = numeric transition probabilities
- global_max_weight = filtered.select_dtypes(float).max().max()
- # Grayscale colormap for edges
- cmap = cm.Greys
- for _, row in filtered.iterrows():
- group = row["group"] # fixed to get real group name
- G = nx.Graph() # undirected
- # Add edges with raw weights
- for col, value in row.items():
- try:
- val = float(value)
- if val > 0:
- source, target = col.rsplit('_', 1)
- if source in behavior_numbering and target in behavior_numbering:
- G.add_edge(
- behavior_numbering[source],
- behavior_numbering[target],
- weight=val
- )
- except Exception:
- continue
- # Layout (increase `k` to spread nodes apart more)
- pos = nx.spring_layout(G, seed=42, k=1, weight="weight")
- plt.figure(figsize=(5, 5))
- ax = plt.gca()
- # Draw nodes
- for node, (x, y) in pos.items():
- ax.scatter(x, y, s=400, color=node_colors[number_to_behavior[node]], zorder=3)
- # ax.text(x, y, str(node), color="white", fontsize=10,
- #ha="center", va="center", zorder=4)
- # Normalize edge colors
- desired_max = 0.6 # adjust as needed
- norm = plt.Normalize(vmin=0, vmax=desired_max)
- node_radius = 0.05 # adjust to push arrows further away from nodes
- # Draw edges with "constant linewidth" but grayscale color
- for u, v, d in G.edges(data=True):
- weight = d["weight"]
- lw = 3
- color = cmap(norm(weight))
- x1, y1 = pos[u]
- x2, y2 = pos[v]
- # Compute vector and shrink it at both ends
- dx, dy = x2 - x1, y2 - y1
- dist = np.sqrt(dx**2 + dy**2)
- if dist > 0:
- offset_x = dx / dist * node_radius
- offset_y = dy / dist * node_radius
- x1_off, y1_off = x1 + offset_x, y1 + offset_y
- x2_off, y2_off = x2 - offset_x, y2 - offset_y
- else:
- x1_off, y1_off, x2_off, y2_off = x1, y1, x2, y2
- # Draw double-headed arrow
- ax.annotate("",
- xy=(x2_off, y2_off), xycoords="data",
- xytext=(x1_off, y1_off), textcoords="data",
- arrowprops=dict(arrowstyle="<|-|>",
- color=color,
- lw=lw,
- alpha=0.9),
- zorder=2,
- )
- # Add grayscale colorbar
- sm = plt.cm.ScalarMappable(cmap=cmap, norm=norm)
- sm.set_array([])
- cbar = plt.colorbar(sm, ax=ax, shrink=0.5, pad=0.02)
- cbar.set_label("Transition Weight", fontsize=10)
- plt.title(f"Behavior Transition Network: {group}")
- plt.axis("off")
- plt.tight_layout()
- filename = os.path.join(path_to_csvs, f"{str(group).replace('/', '_')}.png")
- #plt.savefig(filename, format="eps", dpi=600)
- plt.show()
- plt.close()
- # %%
network_plot.ipynb at commit 1174a09, under MIT · at the source
Overview
and 13 other authors
Amani Akkoub1, Karan Malik1, Kaleigh I. West1, Sara Michel-Le1, Arun Karthikeyan1, Grace van Gerven1, Olivia A. Dell’Aglio1, Kevin T. Beier2, Larry S. Zweifel3,4, Manoj K. Patel5,7, John N. Campbell1,7,9, Christopher D. Deppmann1,7,9,10,11, Ali D. Güler1,7,9- Department of Biology, University of Virginia,Charlottesville, VA USA
- Department of Physiology and Biophysics, University of California, Irvine,Irvine, CA USA
- Department of Pharmacology, University of Washington,Seattle, WA USA
- Department of Psychiatry, University of Washington,Seattle, WA USA
- Department of Anesthesiology, University of Virginia,Charlottesville, VA USA
- Edward Via College of Osteopathic Medicine,Blacksburg, VA USA
- Neuroscience Graduate Program, University of Virginia,Charlottesville, VA USA
- Department of Physiology, School of Medicine, Adiyaman University,Adiyaman, Turkey
- Program in Fundamental Neuroscience, University of Virginia,Charlottesville, VA USA
- Department of Cell Biology, University of Virginia,Charlottesville, VA USA
- Department of Biomedical Engineering, University of Virginia,Charlottesville, VA USA
Abstract
The abstract is not reproduced here: the paper's license (CC BY-NC-ND) does not allow it. Read it in the paper, at the publisher or on Europe PMC.
Repository
Its files are read in the Code ↔ Paper reader above, with 9 matches between paragraphs and lines of code.
UVACircMetNeuLab/glp1r-reward-circuit
1174a09f338ffd61ec686e58d76e302bbad3be4b, 26 March 2026Availability: 1 check, the latest on 28 September 2026: the link answers
- 28 September 2026: the link answers
12 files
- Dopamine dLight Z Score.m, MATLAB, 196 lines
- GCaMP Calcium Events.m, MATLAB, 405 lines, 1 match
- GLMM_beta_behavior.R, R, 151 lines, 2 matches
- PCA.R, R, 243 lines, 1 match
- Syllable_analysis.ipynb, Jupyter, 533 lines
- bar_behavior_plots.R, R, 398 lines, 1 match
- build_dataset.ipynb, Jupyter, 226 lines, 1 match
- location_behavior.ipynb, Jupyter, 376 lines, 1 match
- locations.ipynb, Jupyter, 403 lines
- network_plot.ipynb, Jupyter, 198 lines, 2 matches
- LICENSE, License, 21 lines
- README.md, Text, 133 lines
Code availability statement
The paper has a code availability statement. Its license (CC BY-NC-ND) does not allow reproducing it here; in short, from what the harvester recognized in it:
- it points to the authors' code: UVACircMetNeuLab/
glp1r-reward-circuit
Read it in the paper: doi.org/10.1038/s41586-026-10444-4.
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;
- 10 scripts, each with its path and the digest of its content;
- 9 matches 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
The paper has a data availability statement. Its license (CC BY-NC-ND) does not allow reproducing it here; in short, from what the harvester recognized in it:
- no repository, dataset or request procedure was recognized in it
Read it in the paper: doi.org/10.1038/s41586-026-10444-4.
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 2, 28 September 2026
- Publisher: n/a → Nature Portfolio
Version 1, 28 September 2026: the first record
Recorded: type, language, journal, volume, issue, pages, dates, 33 authors, 2 keywords, 19 MeSH terms, 2 funders, 55 references, 25 RRIDs.
Cite
This paper
Godschall, E. N., Gungul, T. B., Sajonia, I. R., Buyukaksakal, A. K., Li, O., Ogilvie, S., Keeler, A. B., Tian, G., Shi, Y., Koita, O., Guo, C. X., Deutsch, T. C. J., Steacy, E. J., Crook, M., Zhang, Y., Conley, N. J., Memi, G., Webster, A. N., Yipkin Calhan, O., . . . Güler, A. D. (2026). A brain reward circuit inhibited by next-generation weight-loss drugs in mice. Nature, 654(8120), 1055-1064. https://
BibTeX
@article{godschall2026br
author = {Godschall, Elizabeth N. and Gungul, Taha Bugra and Sajonia, Isabelle R. and Buyukaksakal, Aleyna K. and Li, Orien and Ogilvie, Sophia and Keeler, Austin B. and Tian, Guilian and Shi, Yu and Koita, Omar and Guo, Chloe Xinzhu and Deutsch, Tyler C. J. and Steacy, Eric J. and Crook, Maisie and Zhang, YuChen and Conley, Nicholas J. and Memi, Gulsun and Webster, Addison N. and Yipkin Calhan, O. and Liu, Weile and Akkoub, Amani and Malik, Karan and West, Kaleigh I. and Michel-Le, Sara and Karthikeyan, Arun and van Gerven, Grace and Dell’Aglio, Olivia A. and Beier, Kevin T. and Zweifel, Larry S. and Patel, Manoj K. and Campbell, John N. and Deppmann, Christopher D. and Güler, Ali D.},
title = {{A brain reward circuit inhibited by next-generation weight-loss drugs in mice}},
journal = {Nature},
year = {2026},
month = may,
volume = {654},
number = {8120},
pages = {1055--1064},
publisher = {Nature Portfolio},
issn = {0028-0836},
doi = {10.1038/
url = {https://
pmid = {42092139},
pmcid = {PMC13293854}
}
RIS
TY - JOUR
AU - Godschall, Elizabeth N.
AU - Gungul, Taha Bugra
AU - Sajonia, Isabelle R.
AU - Buyukaksakal, Aleyna K.
AU - Li, Orien
AU - Ogilvie, Sophia
AU - Keeler, Austin B.
AU - Tian, Guilian
AU - Shi, Yu
AU - Koita, Omar
AU - Guo, Chloe Xinzhu
AU - Deutsch, Tyler C. J.
AU - Steacy, Eric J.
AU - Crook, Maisie
AU - Zhang, YuChen
AU - Conley, Nicholas J.
AU - Memi, Gulsun
AU - Webster, Addison N.
AU - Yipkin Calhan, O.
AU - Liu, Weile
AU - Akkoub, Amani
AU - Malik, Karan
AU - West, Kaleigh I.
AU - Michel-Le, Sara
AU - Karthikeyan, Arun
AU - van Gerven, Grace
AU - Dell’Aglio, Olivia A.
AU - Beier, Kevin T.
AU - Zweifel, Larry S.
AU - Patel, Manoj K.
AU - Campbell, John N.
AU - Deppmann, Christopher D.
AU - Güler, Ali D.
TI - A brain reward circuit inhibited by next-generation weight-loss drugs in mice
T2 - Nature
J2 - Nature
PY - 2026
DA - 2026/
VL - 654
IS - 8120
SP - 1055
EP - 1064
SN - 0028-0836
PB - Nature Portfolio
DO - 10.1038/
UR - https://
LA - en
ER -
CSL-JSON
{
"id": "10.1038/
"type": "article-journal",
"title": "A brain reward circuit inhibited by next-generation weight-loss drugs in mice",
"container-title": "Nature",
"author": [
{
"family": "Godschall",
"given": "Elizabeth N."
},
{
"family": "Gungul",
"given": "Taha Bugra"
},
{
"family": "Sajonia",
"given": "Isabelle R."
},
{
"family": "Buyukaksakal",
"given": "Aleyna K."
},
{
"family": "Li",
"given": "Orien"
},
{
"family": "Ogilvie",
"given": "Sophia"
},
{
"family": "Keeler",
"given": "Austin B."
},
{
"family": "Tian",
"given": "Guilian"
},
{
"family": "Shi",
"given": "Yu"
},
{
"family": "Koita",
"given": "Omar"
},
{
"family": "Guo",
"given": "Chloe Xinzhu"
},
{
"family": "Deutsch",
"given": "Tyler C. J."
},
{
"family": "Steacy",
"given": "Eric J."
},
{
"family": "Crook",
"given": "Maisie"
},
{
"family": "Zhang",
"given": "YuChen"
},
{
"family": "Conley",
"given": "Nicholas J."
},
{
"family": "Memi",
"given": "Gulsun"
},
{
"family": "Webster",
"given": "Addison N."
},
{
"family": "Yipkin Calhan",
"given": "O."
},
{
"family": "Liu",
"given": "Weile"
},
{
"family": "Akkoub",
"given": "Amani"
},
{
"family": "Malik",
"given": "Karan"
},
{
"family": "West",
"given": "Kaleigh I."
},
{
"family": "Michel-Le",
"given": "Sara"
},
{
"family": "Karthikeyan",
"given": "Arun"
},
{
"family": "van Gerven",
"given": "Grace"
},
{
"family": "Dell’Aglio",
"given": "Olivia A."
},
{
"family": "Beier",
"given": "Kevin T."
},
{
"family": "Zweifel",
"given": "Larry S."
},
{
"family": "Patel",
"given": "Manoj K."
},
{
"family": "Campbell",
"given": "John N."
},
{
"family": "Deppmann",
"given": "Christopher D."
},
{
"family": "Güler",
"given": "Ali D."
}
],
"container-title-short":
"volume": "654",
"issue": "8120",
"page": "1055-1064",
"DOI": "10.1038/
"PMID": "42092139",
"PMCID": "PMC13293854",
"ISSN": "0028-0836",
"publisher": "Nature Portfolio",
"URL": "https://
"language": "en",
"issued": {
"date-parts": [
[
2026,
5,
6
]
]
}
}
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.1016/j.molmet.2026.102403 [code]
- The central amygdala gates exogenous glucagon-like peptide 1 signals.Journal: Molecular metabolismIn common: Plotly, pandas, SciPy, 1 other tool, mouse, 16 references
- [2] doi:10.1016/j.xcrm.2026.102766 [code]
- A longitudinal single-cell and spatial multiomic atlas of pediatric high-grade glioma.Journal: Cell reports. MedicineIn common: NetworkX, Plotly, OpenCV, 9 other tools, 1 reference
- [3] doi:10.1038/s41467-026-76675-1 [code]
- Long-read proteogenomic atlas of human neuronal differentiation reveals isoform diversity informing neurodevelopmental risk mechanisms.Journal: Nature communicationsIn common: glmmTMB, emmeans, NetworkX, 9 other tools
- [4] doi:10.1016/j.isci.2026.116206 [code]
- Gut distension evokes rapid neural dynamics in vagal and hindbrain populations of larval zebrafish.Journal: iScienceIn common: NetworkX, OpenCV, seaborn, 4 other tools, 4 references
- [5] doi:10.7554/elife.106347 [code]
- Esr1-dependent signaling and transcriptional maturation in the medial preoptic area of the hypothalamus shape the development of mating behavior during adolescence.Journal: eLifeIn common: NetworkX, ggplot2, seaborn, 5 other tools, mouse, author Larry S Zweifel
- [6] doi:10.1038/s42003-026-10957-8 [code]
- Brain defence by the extracellular matrix protein Cochlin.Journal: Communications biologyIn common: NetworkX, Plotly, OpenCV, 8 other tools, mouse
- [7] doi:10.1016/j.stem.2026.05.005 [code]
- Generation of human appetite-regulating neurons and tanycytes from pluripotent stem cells.Journal: Cell stem cellIn common: Plotly, patchwork, ggplot2, 6 other tools, 2 references
- [8] doi:10.1093/bioinformatics/btag592 [code]
- Network-based stratification of allele-specific expression reveals patient subgroups in Huntington's disease.Journal: Bioinformatics (Oxford, England)In common: emmeans, NetworkX, Plotly, 8 other tools
- [9] doi:10.7554/elife.93664 [code]
- Drug-induced changes in connectivity to midbrain dopamine cells revealed by rabies monosynaptic tracing.Journal: eLifeIn common: ggplot2, seaborn, tidyverse, 4 other tools, mouse, author Kevin T Beier
- [10] doi:10.1038/s41514-026-00391-9 [code]
- Region-specific transcriptional signatures of brain aging in the absence of neuropathology at the single-cell level.Journal: npj agingIn common: glmmTMB, Plotly, patchwork, 7 other tools
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, 10 scripts, and 9 matches 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:e4e80e71c1f4c41e…
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.
