Yu Chen, Lingfei Wu, Mohammed Zaki
8 of 14 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; 1 honoured the contract we drafted, 1 violated it and 4 have no contract verdict; 2 failures of our instrument; 6 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/2006.13009.json · badge: /api/ran/2006.13009.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.
| Repository | Role | Ran |
|---|---|---|
| hugochan/IDGL | canonical (classifier label) classifier basis: census |
8 ran · 6 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| SquaredFrobeniusNorm | Ran ran; our contract draft was wrong, not the code |
hugochan/IDGL/src/core/model_handler.py pointer only (licence: Apache-2.0); the stored copy get_code serves, from WtaoZhao/GraphGLOW, is pointer only (licence: NONE) · get_code("4e393b15daa9461c") How it ranThe body of this sample is withheld: this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from WtaoZhao/GraphGLOW, and GitHub detected no licence in that repository 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. |
| accuracy | Ran ran, honoured the contract we drafted |
hugochan/IDGL/src/core/model.py code served (permissive licence) · get_code("4cf9dcdd60711db4") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1) and returned float, ndim 0, dtype family float, shape () as a later run recorded it. The image it ran in was not recorded. If your copy returns the same type, ndim and shape on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| compute_normalized_laplacian | Ran ran, violated the contract we drafted |
hugochan/IDGL/src/core/layers/graphlearn.py code served (permissive licence) · get_code("698d3807a0c41ec9") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1) and returned Tensor, ndim 2, dtype family float, shape (4, 4) as a later run recorded it. The image it ran in was not recorded. If your copy returns the same type, ndim and shape on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| dropout | Ran ran on a synthesized input |
hugochan/IDGL/src/core/layers/common.py code served (permissive licence) · get_code("90744bd46d234211") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned Tensor, ndim 2, dtype family float, shape (2, 4) as a later run recorded it. The image it ran in was not recorded. If your copy returns the same type, ndim and shape on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| normalize_text | Ran ran; our contract draft was wrong, not the code |
hugochan/IDGL/src/core/utils/eval_utils.py code served (permissive licence) · get_code("38ffdcfda0ea6889") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned str. It ran in syntology-harvest-sandbox:v5-deps (sha256:6a292aa1aed1) at 2026-09-27T00:55:33Z. If your copy returns the same type on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| sample_anchors | Ran ran on a synthesized input |
hugochan/IDGL/src/core/layers/anchor.py code served (permissive licence) · get_code("784e90120e8129cf") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned tuple. It ran in syntology-harvest-sandbox:v5-deps (sha256:6a292aa1aed1) at 2026-09-27T00:55:33Z. If your copy returns the same type on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| train_batch | Ran ran on a synthesized input |
hugochan/IDGL/src/core/model.py code served (permissive licence) · get_code("11a56e75a1cddbe8") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned tuple. The image it ran in was not recorded. If your copy returns the same type on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| vectorize_input | Ran ran on a synthesized input |
hugochan/IDGL/src/core/utils/data_utils.py code served (permissive licence) · get_code("81d592687b5f5dd5") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned dict. The image it ran in was not recorded. If your copy returns the same type on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| batch_diff | Not yet run unverified (harvested, no recorded run) |
hugochan/IDGL/src/core/model_handler.py code served (permissive licence) · get_code("e264fe290089eb78") How it ranno invocation recorded. |
| batch_sample_anchors | Not yet run unverified (harvested, no recorded run) |
hugochan/IDGL/src/core/layers/anchor.py code served (permissive licence) · get_code("844daf63f8277a07") How it ranno invocation recorded. |
| batch_select_from_tensor | Not yet run unverified (harvested, no recorded run) |
hugochan/IDGL/src/core/layers/anchor.py code served (permissive licence) · get_code("837b6503909c3bcc") How it ranno invocation recorded. |
| diff | Not yet run unverified (harvested, no recorded run) |
hugochan/IDGL/src/core/model_handler.py pointer only (licence: Apache-2.0); the stored copy get_code serves, from WtaoZhao/GraphGLOW, is pointer only (licence: NONE) · get_code("29922ecc7c935e89") How it ranThe body of this sample is withheld: this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from WtaoZhao/GraphGLOW, and GitHub detected no licence in that repository 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. No invocation recorded. |
| get_binarized_kneighbors_graph | Not yet run unverified (harvested, no recorded run) |
hugochan/IDGL/src/core/layers/graphlearn.py code served (permissive licence) · get_code("80476f95d3822c09") How it ranno invocation recorded. |
| prepare_datasets | Not yet run unverified (harvested, no recorded run) |
hugochan/IDGL/src/core/utils/data_utils.py code served (permissive licence) · get_code("7533b3dc9f5bbfd6") How it ranno invocation recorded. |
Of 14 samples lifted from this paper's linked repositories, 14 carry a function identity and 0 do not. Of the 14 distinct functions with an identity, 6 are also present in other papers whose code we hold (2 with at least one paper dated earlier, 0 the same month, 5 later) and 8 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.
| Function | Also present in | Earliest-dated | Others named |
|---|---|---|---|
| compute_normalized_laplacian | 3 other papers 3 later |
2104.09036 (2021-04) Mining Latent Structures for Multimedia Recommendation |
2311.00423 (2023-11) LLMRec: Large Language Models with Graph Augmentation for Recommendation 2402.17188 (2024-02) PromptMM: Multi-Modal Knowledge Distillation for Recommendation with Prompt-Tuning |
| normalize_text | 3 other papers 1 dated earlier, 2 later |
1909.03329 (2019-09) LAMOL: LAnguage MOdeling for Lifelong Language Learning |
2203.10652 (2022-03) Continual Sequence Generation with Adaptive Compositional Modules 2025.emnlp-industry.89 (2025 (year only)) L4: Mutual Learning Helps Lifelong Language Learning |
| accuracy | 2 other papers 2 later |
2208.08302 (2022-08) Position-aware Structure Learning for Graph Topology-imbalance by Relieving Under-reaching and Over-squashing |
2502.19670 (2025-02) Training Robust Graph Neural Networks by Modeling Noise Dependencies |
| dropout | 2 other papers 2 dated earlier |
1908.04942 (2019-08) Reinforcement Learning Based Graph-to-Sequence Model for Natural Question Generation |
2004.06015 (2020-04) Toward Subgraph-Guided Knowledge Graph Question Generation with Graph Neural Networks |
| SquaredFrobeniusNorm | 1 other paper 1 later |
2502.19670 (2025-02) Training Robust Graph Neural Networks by Modeling Noise Dependencies |
|
| diff | 1 other paper 1 later |
2502.19670 (2025-02) Training Robust Graph Neural Networks by Modeling Noise Dependencies |
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.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
In this paper, we propose an end-to-end graph learning framework, namely Iterative Deep Graph Learning (IDGL), for jointly and iteratively learning graph structure and graph embedding. The key rationale of IDGL is to learn a better graph structure based on better node embeddings, and vice versa (i.e., better node embeddings based on a better graph structure). Our iterative method dynamically stops when the learned graph structure approaches close enough to the graph optimized for the downstream prediction task. In addition, we cast the graph learning problem as a similarity metric learning problem and leverage adaptive graph regularization for controlling the quality of the learned graph. Finally, combining the anchorbased approximation technique, we further propose a scalable version of IDGL, namely IDGL-ANCH, which significantly reduces the time and space complexity of IDGL without compromising the performance. Our extensive experiments on nine benchmarks show that our proposed IDGL models can consistently outperform or match the state-of-the-art baselines. Furthermore, IDGL can be more robust to adversarial graphs and cope with both transductive and inductive learning. Recent years have seen a significantly growing amount of interest in graph neural networks (GNNs), especially on efforts devoted to developing more effective GNNs for node classification [29,36,17,52], graph classification [60,43] and graph generation [47,37,61]. Despite GNNs' powerful ability in learning expressive node embeddings, unfortunately, they can only be used when graph-structured data is available. Many real-world applications naturally admit network-structured data (e.g., social networks). However, these intrinsic graph-structures are not always optimal for the downstream tasks. This is partially because the raw graphs were constructed from the original feature space, which may not reflect the "true" graph topology after feature extraction and transformation. Another potential reason is that real-world graphs are often noisy or even incomplete due to the inevitably error-prone data measurement or collection. Furthermore, many applications such as those in natural language processing [7,57,58] may only have sequential data or even just the original feature matrix, requiring additional graph construction from the original data matrix. To address these limitations, we propose an end-to-end graph learning framework, namely Iterative Deep Graph Learning (IDGL), for jointly and iteratively learning the graph structure and the GNN parameters that are optimized toward the downstream prediction task. The key rationale of our IDGL ˚Corresponding author. 34th Conference on Neural Information Processing Systems (NeurIPS 2020),
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2006.13009")
get_code_for_paper("2006.13009")
have("2006.13009")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2006.13009.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2006.13009)
Connect an agent — have() is free.