4 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, 1 violated it and 0 have no contract verdict; 3 failures of our instrument; 3 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/2412.09902.json · badge: /api/ran/2412.09902.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 |
|---|---|---|
| xiexuanting/fpgc | canonical (classifier label) classifier basis: census |
4 ran · 3 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| load_twitch_gamer | Ran ran; our contract draft was wrong, not the code |
xiexuanting/fpgc/FPGC-main/load_data.py pointer only (licence: NONE); the stored copy get_code serves, from jlinki/jdr, is pointer only (licence: NONE) · get_code("d4e6fd9f6cd8a3ad") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, xiexuanting/fpgc 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. |
| rand_train_test_idx | Ran ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT) |
xiexuanting/fpgc/FPGC-main/data_utils.py pointer only (licence: NONE); the stored copy get_code serves, from CUAI/Non-Homophily-Large-Scale, is pointer only (licence: NONE) · get_code("13234652741e2264") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, xiexuanting/fpgc 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. |
| sample_mask | Ran ran, violated the contract we drafted |
xiexuanting/fpgc/FPGC-main/utils.py pointer only (licence: NONE) · get_code("b32fd748b4bbe3bf") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, xiexuanting/fpgc 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. |
| to_planetoid | Ran ran; our contract draft was wrong, not the code |
xiexuanting/fpgc/FPGC-main/data_utils.py pointer only (licence: NONE) · get_code("f7843797de50ce62") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, xiexuanting/fpgc 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. |
| even_quantile_labels | Not yet run unverified (harvested, no recorded run) |
xiexuanting/fpgc/FPGC-main/data_utils.py pointer only (licence: NONE) · get_code("5c9307a7a17f1a3f") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, xiexuanting/fpgc 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. |
| load_fb100 | Not yet run unverified (harvested, no recorded run) |
xiexuanting/fpgc/FPGC-main/load_data.py pointer only (licence: NONE); the stored copy get_code serves, from CUAI/Non-Homophily-Large-Scale, is pointer only (licence: NONE) · get_code("0765a875204d931d") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, xiexuanting/fpgc 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. |
| load_twitch | Not yet run unverified (harvested, no recorded run) |
xiexuanting/fpgc/FPGC-main/load_data.py pointer only (licence: NONE); the stored copy get_code serves, from CUAI/Non-Homophily-Large-Scale, is pointer only (licence: NONE) · get_code("563a5ce4dce55a17") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, xiexuanting/fpgc 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. |
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, 7 are also present in other papers whose code we hold (7 with at least one paper dated earlier, 0 the same month, 6 later) and 0 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 |
|---|---|---|---|
| sample_mask | 28 other papers 28 dated earlier |
1603.08861 (2016-03) Revisiting Semi-Supervised Learning with Graph Embeddings |
1710.10568 (2017-10) Stochastic Training of Graph Convolutional Networks with Variance Reduction 1710.10903 (2017-10) Graph Attention Networks and 25 more not named here |
| rand_train_test_idx | 14 other papers 12 dated earlier, 2 later |
2110.14446 (2021-10) Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methods |
2302.01524 (2023-02) Ordered GNN: Ordering Message Passing to Deal with Heterophily and Over-smoothing 2306.08274 (2023-06) A Simple and Scalable Graph Neural Network for Large Directed Graphs and 11 more not named here |
| even_quantile_labels | 8 other papers 6 dated earlier, 2 later |
2210.07606 (2022-10) Revisiting Heterophily For Graph Neural Networks |
2302.01524 (2023-02) Ordered GNN: Ordering Message Passing to Deal with Heterophily and Over-smoothing 2306.08274 (2023-06) A Simple and Scalable Graph Neural Network for Large Directed Graphs and 5 more not named here |
| load_fb100 | 8 other papers 7 dated earlier, 1 later |
2110.14446 (2021-10) Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methods |
2210.07606 (2022-10) Revisiting Heterophily For Graph Neural Networks 2302.01524 (2023-02) Ordered GNN: Ordering Message Passing to Deal with Heterophily and Over-smoothing and 5 more not named here |
| load_twitch_gamer | 8 other papers 7 dated earlier, 1 later |
2210.07606 (2022-10) Revisiting Heterophily For Graph Neural Networks |
2302.01524 (2023-02) Ordered GNN: Ordering Message Passing to Deal with Heterophily and Over-smoothing 2310.09202 (2023-10) Graph Distillation with Eigenbasis Matching and 5 more not named here |
| to_planetoid | 8 other papers 7 dated earlier, 1 later |
2110.14446 (2021-10) Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methods |
2302.01524 (2023-02) Ordered GNN: Ordering Message Passing to Deal with Heterophily and Over-smoothing 2306.08274 (2023-06) A Simple and Scalable Graph Neural Network for Large Directed Graphs and 5 more not named here |
| load_twitch | 4 other papers 3 dated earlier, 1 later |
2110.14446 (2021-10) Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methods |
2302.01524 (2023-02) Ordered GNN: Ordering Message Passing to Deal with Heterophily and Over-smoothing 2312.14438 (2023-12) PC-Conv: Unifying Homophily and Heterophily with Two-fold Filtering and 1 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.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Most existing graph clustering methods primarily focus on exploiting topological structure, often neglecting the ``missing-half" node feature information, especially how these features can enhance clustering performance. This issue is further compounded by the challenges associated with high-dimensional features. Feature selection in graph clustering is particularly difficult because it requires simultaneously discovering clusters and identifying the relevant features for these clusters. To address this gap, we introduce a novel paradigm called ``one node one model", which builds an exclusive model for each node and defines the node label as a combination of predictions for node groups. Specifically, the proposed ``Feature Personalized Graph Clustering (FPGC)" method identifies cluster-relevant features for each node using a squeeze-and-excitation block, integrating these features into each model to form the final representations. Additionally, the concept of feature cross is developed as a data augmentation technique to learn low-order feature interactions. Extensive experimental results demonstrate that FPGC outperforms state-of-the-art clustering methods. Moreover, the plug-and-play nature of our method provides a versatile solution to enhance GNN-based models from a feature perspective.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2412.09902")
get_code_for_paper("2412.09902")
have("2412.09902")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2412.09902.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2412.09902)
Connect an agent — have() is free.