2 of 4 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; 2 failures 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/2311.13355.json · badge: /api/ran/2311.13355.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 |
|---|---|---|
| copy not recorded | community not in the paper's declared repositories |
2 ran · 2 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| accuracy | 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 joshr17/IFM pointer only · get_code("983576fa67f4f01e") 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. |
| reduce_mean | 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 ixilai/awfusion pointer only; the stored copy get_code serves, from ixilai/awfusion, is pointer only (licence: NONE) · get_code("fe089b539afcc496") 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. |
| adjust_learning_rate | Not yet run unverified (harvested, no recorded run) |
this paper's copy was not recorded; identical code first harvested from zhen-cheng121/cpn_ova_unified pointer only · get_code("cfe1fed3f84b7b22") 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. No invocation recorded. |
| validate | Not yet run unverified (harvested, no recorded run) |
this paper's copy was not recorded; identical code first harvested from zhen-cheng121/cpn_ova_unified pointer only · get_code("f22f9d7998eced68") 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. No invocation recorded. |
Of 4 samples lifted from this paper's linked repositories, 4 carry a function identity and 0 do not. Of the 4 distinct functions with an identity, 4 are also present in other papers whose code we hold (4 with at least one paper dated earlier, 0 the same month, 2 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 |
|---|---|---|---|
| accuracy | 17 other papers 11 dated earlier, 5 later, 1 same year, order not determinable |
1805.03438 (2018-05) Robust Classification with Convolutional Prototype Learning |
1905.11926 (2019-05) Network Deconvolution 2003.04297 (2020-03) Improved Baselines with Momentum Contrastive Learning and 14 more not named here |
| reduce_mean | 4 other papers 2 dated earlier, 2 later |
1805.03438 (2018-05) Robust Classification with Convolutional Prototype Learning |
2305.15597 (2023-05) Text-Augmented Open Knowledge Graph Completion via Pre-Trained Language Models 2402.02090 (2024-02) All-weather Multi-Modality Image Fusion: Unified Framework and 100k Benchmark and 1 more not named here |
| adjust_learning_rate | 1 other paper 1 dated earlier |
1805.03438 (2018-05) Robust Classification with Convolutional Prototype Learning |
|
| validate | 1 other paper 1 dated earlier |
1805.03438 (2018-05) Robust Classification with Convolutional Prototype Learning |
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.
Classifying patterns of known classes and rejecting ambiguous and novel (also called as out-of-distribution (OOD)) inputs are involved in open world pattern recognition. Deep neural network models usually excel in closed-set classification while performs poorly in rejecting OOD inputs. To tackle this problem, numerous methods have been designed to perform open set recognition (OSR) or OOD rejection/detection tasks. Previous methods mostly take post-training score transformation or hybrid models to ensure low scores on OOD inputs while separating known classes. In this paper, we attempt to build a unified framework for building open set classifiers for both classification and OOD rejection. We formulate the open set recognition of $ K $-known-class as a $ (K+1) $-class classification problem with model trained on known-class samples only. By decomposing the $ K $-class problem into $ K $ one-versus-all (OVA) binary classification tasks and binding some parameters, we show that combining the scores of OVA classifiers can give $ (K+1) $-class posterior probabilities, which enables classification and OOD rejection in a unified framework. To maintain the closed-set classification accuracy of the OVA trained classifier, we propose a hybrid training strategy combining OVA loss and multi-class cross-entropy loss. We implement the OVA framework and hybrid training strategy on the recently proposed convolutional prototype network and prototype classifier on vision transformer (ViT) backbone. Experiments on popular OSR and OOD detection datasets demonstrate that the proposed framework, using a single multi-class classifier, yields competitive performance in closed-set classification, OOD detection, and misclassification detection.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2311.13355")
get_code_for_paper("2311.13355")
have("2311.13355")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2311.13355.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2311.13355)
Connect an agent — have() is free.