1 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; 0 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 1 failure of our instrument; 2 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/2110.02047.json · badge: /api/ran/2110.02047.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 |
|---|---|---|
| daisean/hint | canonical (classifier label) classifier basis: classifier_2025 |
1 ran · 2 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| update_node | Ran ran; our contract draft was wrong, not the code |
daisean/hint/build_coding_tree.py pointer only (licence: NONE) · get_code("33d71761e0a8d2f1") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, daisean/hint 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. |
| get_train_and_test | Not yet run unverified (harvested, no recorded run) |
daisean/hint/build_coding_tree.py pointer only (licence: NONE) · get_code("741730a1d883cb6d") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, daisean/hint 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_tree | Not yet run unverified (harvested, no recorded run) |
daisean/hint/build_coding_tree.py pointer only (licence: NONE) · get_code("3462ee95adb2bb33") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, daisean/hint 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 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, 1 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 1 later) and 2 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 |
|---|---|---|---|
| update_node | 1 other paper 1 later |
2305.15182 (2023-05) HiTIN: Hierarchy-aware Tree Isomorphism Network for Hierarchical Text Classification |
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.
Text classification is a primary task in natural language processing (NLP). Recently, graph neural networks (GNNs) have developed rapidly and been applied to text classification tasks. As a special kind of graph data, the tree has a simpler data structure and can provide rich hierarchical information for text classification. Inspired by the structural entropy, we construct the coding tree of the graph by minimizing the structural entropy and propose HINT, which aims to make full use of the hierarchical information contained in the text for the task of text classification. Specifically, we first establish a dependency parsing graph for each text. Then we designed a structural entropy minimization algorithm to decode the key information in the graph and convert each graph to its corresponding coding tree. Based on the hierarchical structure of the coding tree, the representation of the entire graph is obtained by updating the representation of non-leaf nodes in the coding tree layer by layer. Finally, we present the effectiveness of hierarchical information in text classification. Experimental results show that HINT outperforms the state-of-the-art methods on popular benchmarks while having a simple structure and few parameters.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2110.02047")
get_code_for_paper("2110.02047")
have("2110.02047")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2110.02047.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2110.02047)
Connect an agent — have() is free.