Ke Xu, Junran Wu, Shangzhe Li, He Zhu, Yicheng Pan, Yue Hou, Ruomei Liu, Ze Yuan
3 of 3 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, 0 violated it and 0 have no contract verdict; 2 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/2403.17307.json · badge: /api/ran/2403.17307.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 |
|---|---|---|
| Rooooyy/HILL | canonical (classifier label) classifier basis not recorded on the link |
3 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| child_tree_deepth | Ran ran, honoured the contract we drafted |
Rooooyy/HILL/model/coding_tree.py pointer only (licence: MIT); the stored copy get_code serves, from Rooooyy/HiTIN, is pointer only (licence: NONE) · get_code("b16d0d091d08f27f") How it ranThe body of this sample is withheld: this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from Rooooyy/HiTIN, 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. |
| cut_volume | Ran ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT) |
Rooooyy/HILL/model/coding_tree.py pointer only (licence: MIT); the stored copy get_code serves, from Rooooyy/HiTIN, is pointer only (licence: NONE) · get_code("721b31dc7e862365") How it ranThe body of this sample is withheld: this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from Rooooyy/HiTIN, 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. |
| graph_parse | Ran ran; our contract draft was wrong, not the code |
Rooooyy/HILL/model/coding_tree.py code served (permissive licence) · get_code("21dda7ecf92b5b2c") 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.
|
Of 3 samples lifted from this paper's linked repositories, 3 carry a function identity and 0 do not. Of the 3 distinct functions with an identity, 3 are also present in other papers whose code we hold (3 with at least one paper dated earlier, 0 the same month, 3 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 |
|---|---|---|---|
| child_tree_deepth | 7 other papers 6 dated earlier, 1 later · 3 only as an assembly brick |
2206.02404 (2022-06) A Simple yet Effective Method for Graph Classification |
2206.13510 (2022-06) Structural Entropy Guided Graph Hierarchical Pooling 2304.12000 (2023-04) Hierarchical State Abstraction Based on Structural Information Principles and 4 more not named here |
| cut_volume | 6 other papers 5 dated earlier, 1 later · 3 only as an assembly brick |
2206.02404 (2022-06) A Simple yet Effective Method for Graph Classification |
2206.13510 (2022-06) Structural Entropy Guided Graph Hierarchical Pooling 2304.12000 (2023-04) Hierarchical State Abstraction Based on Structural Information Principles and 3 more not named here |
| graph_parse | 6 other papers 5 dated earlier, 1 later · 2 only as an assembly brick |
2206.02404 (2022-06) A Simple yet Effective Method for Graph Classification |
2206.13510 (2022-06) Structural Entropy Guided Graph Hierarchical Pooling 2304.12000 (2023-04) Hierarchical State Abstraction Based on Structural Information Principles and 3 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.
Existing self-supervised methods in natural language processing (NLP), especially hierarchical text classification (HTC), mainly focus on self-supervised contrastive learning, extremely relying on human-designed augmentation rules to generate contrastive samples, which can potentially corrupt or distort the original information. In this paper, we tend to investigate the feasibility of a contrastive learning scheme in which the semantic and syntactic information inherent in the input sample is adequately reserved in the contrastive samples and fused during the learning process. Specifically, we propose an information lossless contrastive learning strategy for HTC, namely Hierarchy-aware Information Lossless contrastive Learning (HILL), which consists of a text encoder representing the input document, and a structure encoder directly generating the positive sample. The structure encoder takes the document embedding as input, extracts the essential syntactic information inherent in the label hierarchy with the principle of structural entropy minimization, and injects the syntactic information into the text representation via hierarchical representation learning. Experiments on three common datasets are conducted to verify the superiority of HILL.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2403.17307")
get_code_for_paper("2403.17307")
have("2403.17307")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2403.17307.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2403.17307)
Connect an agent — have() is free.