None of the 6 samples (functions and classes) lifted from this paper's linked repositories has a recorded run on a synthesized input (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/2302.01313.json · badge: /api/ran/2302.01313.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 |
|---|---|---|
| purdueminds/isdea | canonical (classifier label) classifier basis not recorded on the link |
0 ran · 6 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| create_framework_directory | Not yet run unverified (harvested, no recorded run) |
purdueminds/isdea/ISDEA/src/etexood/loggings.py code served (permissive licence) · get_code("99753818721d4c17") How it ranno invocation recorded. |
| create_logger | Not yet run unverified (harvested, no recorded run) |
purdueminds/isdea/ISDEA/src/etexood/loggings.py code served (permissive licence) · get_code("6b5baf0619d81359") How it ranno invocation recorded. |
| fa_mo_tree | Not yet run unverified (harvested, no recorded run) |
purdueminds/isdea/ISDEA/generate.py code served (permissive licence) · get_code("febbc82884e487a6") How it ranno invocation recorded. |
| gr_tree | Not yet run unverified (harvested, no recorded run) |
purdueminds/isdea/ISDEA/generate.py code served (permissive licence) · get_code("2dc7241c82904bed") How it ranno invocation recorded. |
| load | Not yet run unverified (harvested, no recorded run) |
purdueminds/isdea/ISDEA/rename.py code served (permissive licence) · get_code("a49dbe7a1a1c291f") How it ranno invocation recorded. |
| merge_and_lock | Not yet run unverified (harvested, no recorded run) |
purdueminds/isdea/ISDEA/generate.py code served (permissive licence) · get_code("591130e854003d5d") How it ranno invocation recorded. |
Of 6 samples lifted from this paper's linked repositories, 6 carry a function identity and 0 do not. Of the 6 distinct functions with an identity, 0 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 0 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.
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.
The task of fully inductive link prediction in knowledge graphs has gained significant attention, with various graph neural networks being proposed to address it. This task presents greater challenges than traditional inductive link prediction tasks with only new nodes, as models must be capable of zero-shot generalization to both unseen nodes and unseen relation types in the inference graph. Despite the development of novel models, a unifying theoretical understanding of their success remains elusive, and the limitations of these methods are not well-studied. In this work, we introduce the concept of double permutation-equivariant representations and demonstrate its necessity for effective performance in this task. We show that many existing models, despite their diverse architectural designs, conform to this framework. However, we also identify inherent limitations in double permutation-equivariant representations, which restrict these models's ability to learn effectively on datasets with varying characteristics. Our findings suggest that while double equivariance is necessary for meta-learning across knowledge graphs from different domains, it is not sufficient. There remains a fundamental gap between double permutation-equivariant models and the concept of foundation models designed to learn patterns across all domains.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2302.01313")
get_code_for_paper("2302.01313")
have("2302.01313")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2302.01313.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2302.01313)
Connect an agent — have() is free.