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; 0 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 3 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/2310.18562.json · badge: /api/ran/2310.18562.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 |
|---|---|---|
| Claydon-Wang/OFTTA | canonical (classifier label) classifier basis: classifier_2025 |
2 ran · 0 no recorded run |
| copy not recorded | community not in the paper's declared repositories |
1 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| find_bns | Ran ran; our contract draft was wrong, not the code |
Claydon-Wang/OFTTA/TTA/adapt_algorithm/oftta.py pointer only (licence: NONE) · get_code("11f9ed3c6f994ebe") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, Claydon-Wang/OFTTA 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. |
| forward_and_adapt | Ran ran; our contract draft was wrong, not the code |
Claydon-Wang/OFTTA/TTA/adapt_algorithm/oftta.py pointer only (licence: NONE) · get_code("0792ed73d94bcef9") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, Claydon-Wang/OFTTA 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. |
| softmax_entropy | Ran ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT) |
this paper's copy was not recorded; identical code first harvested from Feliciaxyao/ICML2024-FSTTA pointer only; the stored copy get_code serves, from Feliciaxyao/ICML2024-FSTTA, is pointer only (licence: NONE) · get_code("3078648c75e3e1e3") How it ranThe body of this sample is withheld: this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it. 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. |
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 (1 with at least one paper dated earlier, 1 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 |
|---|---|---|---|
| softmax_entropy | 22 other papers 7 dated earlier, 1 the same month, 13 later, 1 undated · 4 only as an assembly brick |
2006.10726 (2020-06) TENT: FULLY TEST-TIME ADAPTATION BY ENTROPY MINIMIZATION |
2105.08714 (2021-05) Fighting Gradients with Gradients: Dynamic Defenses against Adversarial Attacks 2110.14038 (2021-10) Robustness of Graph Neural Networks at Scale and 19 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.
Human Activity Recognition (HAR) models often suffer from performance degradation in real-world applications due to distribution shifts in activity patterns across individuals. Test-Time Adaptation (TTA) is an emerging learning paradigm that aims to utilize the test stream to adjust predictions in real-time inference, which has not been explored in HAR before. However, the high computational cost of optimization-based TTA algorithms makes it intractable to run on resource-constrained edge devices. In this paper, we propose an Optimization-Free Test-Time Adaptation (OFTTA) framework for sensor-based HAR. OFTTA adjusts the feature extractor and linear classifier simultaneously in an optimization-free manner. For the feature extractor, we propose Exponential DecayTest-time Normalization (EDTN) to replace the conventional batch normalization (CBN) layers. EDTN combines CBN and Test-time batch Normalization (TBN) to extract reliable features against domain shifts with TBN's influence decreasing exponentially in deeper layers. For the classifier, we adjust the prediction by computing the distance between the feature and the prototype, which is calculated by a maintained support set. In addition, the update of the support set is based on the pseudo label, which can benefit from reliable features extracted by EDTN. Extensive experiments on three public cross-person HAR datasets and two different TTA settings demonstrate that OFTTA outperforms the state-of-the-art TTA approaches in both classification performance and computational efficiency. Finally, we verify the superiority of our proposed OFTTA on edge devices, indicating possible deployment in real applications. Our code is available at https://github.com/Claydon-Wang/OFTTA.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2310.18562")
get_code_for_paper("2310.18562")
have("2310.18562")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2310.18562.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2310.18562)
Connect an agent — have() is free.