SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2405.19933 · 2024

Learning Latent Graph Structures and their Uncertainty

arXiv · PDF · Open in the Atlas

Code that ran

7 of 7 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (0 of them constructed an object rather than computing a result; 0 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 7 failures of our instrument; 0 no recorded run), measured 2026-11-22; repository links from the Papers with Code archive attributed under CC BY-SA, no affiliation; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.

"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/2405.19933.json · badge: /api/ran/2405.19933.svg

Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.

RepositoryRoleRan
allemanenti/Learning-Calibrated-Structures canonical (classifier label)
classifier basis: census
7 ran · 0 no recorded run
FunctionStatusWhere it lives
alphabetically_sorted_dict Ran
ran; our contract draft was wrong, not the code
allemanenti/Learning-Calibrated-Structures/utils/utils.py
pointer only (licence: NONE) · get_code("f8457b017f7ba4cf")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, allemanenti/Learning-Calibrated-Structures when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

build_tri_community_graph Ran
ran; our contract draft was wrong, not the code
allemanenti/Learning-Calibrated-Structures/dataset/dataset.py
pointer only (licence: NONE) · get_code("51893e7f620bfba9")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, allemanenti/Learning-Calibrated-Structures when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

inverse_sigmoid Ran
ran; our contract draft was wrong, not the code
allemanenti/Learning-Calibrated-Structures/utils/utils.py
pointer only (licence: NONE) · get_code("1a375795f2408153")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, allemanenti/Learning-Calibrated-Structures when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

nice_dict Ran
ran; our contract draft was wrong, not the code
allemanenti/Learning-Calibrated-Structures/utils/utils.py
pointer only (licence: NONE) · get_code("702fe2f4cdc76be3")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, allemanenti/Learning-Calibrated-Structures when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

pp_ae Ran
ran; our contract draft was wrong, not the code
allemanenti/Learning-Calibrated-Structures/loss/loss.py
pointer only (licence: NONE) · get_code("b1a8c36114ec87c5")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, allemanenti/Learning-Calibrated-Structures when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

pp_ae_and_se Ran
ran; our contract draft was wrong, not the code
allemanenti/Learning-Calibrated-Structures/loss/loss.py
pointer only (licence: NONE) · get_code("ef9826fbd16794ad")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, allemanenti/Learning-Calibrated-Structures when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

pp_se Ran
ran; our contract draft was wrong, not the code
allemanenti/Learning-Calibrated-Structures/loss/loss.py
pointer only (licence: NONE) · get_code("ef95beb5cf9bfbde")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, allemanenti/Learning-Calibrated-Structures when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

Also present in other papers' code

Of 7 samples lifted from this paper's linked repositories, 7 carry a function identity and 0 do not. Of the 7 distinct functions with an identity, 1 are also present in other papers whose code we hold (1 with at least one paper dated earlier, 1 the same month, 1 later) and 6 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).

Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.

FunctionAlso present inEarliest-datedOthers named
inverse_sigmoid 21 other papers
9 dated earlier, 2 the same month, 10 later
2311.11284 (2023-11)
LucidDreamer: Towards High-Fidelity Text-to-3D Generation via Interval Score Matching
2311.17061 (2023-11)
HumanGaussian: Text-Driven 3D Human Generation with Gaussian Splatting
2311.17082 (2023-11)
DreamPropeller: Supercharge Text-to-3D Generation with Parallel Sampling
and 18 more not named here

Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-22.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

Graph neural networks use relational information as an inductive bias to enhance prediction performance. Not rarely, task-relevant relations are unknown and graph structure learning approaches have been proposed to learn them from data. Given their latent nature, no graph observations are available to provide a direct training signal to the learnable relations. Therefore, graph topologies are typically learned on the prediction task alongside the other graph neural network parameters. In this paper, we demonstrate that minimizing point-prediction losses does not guarantee proper learning of the latent relational information and its associated uncertainty. Conversely, we prove that suitable loss functions on the stochastic model outputs simultaneously grant solving two tasks: (i) learning the unknown distribution of the latent graph and (ii) achieving optimal predictions of the target variable. Finally, we propose a sampling-based method that solves this joint learning task. Empirical results validate our theoretical claims and demonstrate the effectiveness of the proposed approach.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2405.19933")
get_code_for_paper("2405.19933")
have("2405.19933")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/2405.19933.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/2405.19933.svg)](https://syntology.ai/paper/2405.19933)

Connect an agent — have() is free.