Home › Code › make_one_hot

make_one_hot

Syntologyentry name in harvested code

Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record.

make_one_hot appears in the code Syntology harvested for 15 papers, as 13 distinct code bodies found in 15 places (a place is one code body under one paper). Of the 15 papers, 12 with a sample that ran: 7 with a run with no instrument failure, 5 where every run was a failure of Syntology's instrument. 1 of the code bodies carries a behaviour fingerprint.

What this page is not. Routines are grouped here by the exact string of their function or class name. Nothing asserts that two samples named make_one_hot do the same thing, share code, or are comparable; the name is a string, not an identity. Behaviour outputs (what a fingerprinted sample returned on the shared battery) are not in this export and are not shown here; get_code(code_sha256="…") returns this sample's fingerprint on the shared battery, with the battery's shuffled null and lift; not shown on this site (how to connect). "Ran" means executed on a synthesized fixture, not that the code is correct or reproduces a paper.

Samples Syntology

The 13 distinct code bodies named make_one_hot: 10 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 4 where Syntology's instrument failed) · 3 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. One tile per status, in the site's fixed vocabulary, each code body counted once:

0ran · honoured contract
0ran · violated contract
2ran · our draft was wrong
2ran; the contract check could not run
6ran
3unverified
1fingerprinted

Licence is a property of each copy, so it is counted per place: 3 of the 15 places are pointer only (Syntology does not serve that copy's text). This site shows no code text for any sample; every row below links to the file in its repository where the record names one.

“Ran” means the sample executed on a synthesized input; it does not mean the output is correct. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “the contract check could not run” (RAISES, DEP_MISSING or TIMEOUT; hover a row's label for which) are failures of Syntology's instrument, not of the code, and those samples did run. The ran count above is every status except unverified, the same rule as each paper page; “with no instrument failure” is honoured, violated and ran with no contract checked. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Papers

15 papers shown of 15, newest first; 15 places in the table. A paper with no recorded date is placed by the month its arXiv id encodes, shown in the Date column as YYYY-MM (from id). One row per place: a paper whose repository defines the name more than once appears more than once, and the same code body held for several papers appears once under each, with the same status. Titles and dates are the archive's archive 2025-07-28 for papers in the archive; 1 papers have no page here and are shown by their id only (arXiv: for an arXiv id; an id from another venue, such as ACL Anthology or AAAI, is named as that venue's id, never as an arXiv id). Status and fingerprint are Syntology's record of each code body; licence is recorded for each place. The File cell ends with the code body's code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

PaperDateFileStatus SyntologyLicence
TASeg: Temporal Aggregation Network for LiDAR Semantic Segmentation 13 Jul 2024 LittlePey/TASeg/pcseg/loss/dice_loss_v0.py b91852dd7528b877 ran; the contract check could not run (RAISES) Apache-2.0 (permissive)
OpenESS: Event-based Semantic Scene Understanding with Open Vocabularies 8 May 2024 ldkong1205/openess/utils/loss_functions.py 61ad15ec41cc9c81 ran; the contract check could not run (RAISES) no licence file found · pointer only
UniSeg: A Unified Multi-Modal LiDAR Segmentation Network and the OpenPCSeg Codebase 11 Sep 2023 PJLab-ADG/PCSeg/pcseg/loss/dice_loss_v0.py b91852dd7528b877 ran; the contract check could not run (RAISES) no licence file found · pointer only
Rectifying Noisy Labels with Sequential Prior: Multi-Scale Temporal Feature Affinity Learning for Robust Video Segmentation 12 Jul 2023 beileicui/ms-tfal/utils/losses.py a65ee7a1b88921d5 ran MIT (permissive)
Str2Str: A Score-based Framework for Zero-shot Protein Conformation Sampling 5 Jun 2023 lujiarui/Str2Str/src/common/data_transforms.py 68d0ff89dbb1e05b ran MIT (permissive)
Handwritten Text Generation from Visual Archetypes 27 Mar 2023 aimagelab/VATr/models/model.py 39075c27b258d2c3 ran · our draft was wrong MIT (permissive)
Deep Bidirectional Language-Knowledge Graph Pretraining 17 Oct 2022 michiyasunaga/dragon/modeling/modeling_gnn.py 440036c58abd9ccc ran Apache-2.0 (permissive)
All you need are a few pixels: semantic segmentation with PixelPick 13 Apr 2021 yazdaniamir38/madbal/utils/losses.py 3d38fe989e7b40c1 ran MIT (permissive)
QA-GNN: Reasoning with Language Models and Knowledge Graphs for Question Answering 13 Apr 2021 michiyasunaga/qagnn/modeling/modeling_qagnn.py df5e0b02401bf941 unverified MIT (permissive)
Vision Transformers for Dense Prediction 24 Mar 2021 mszpc/3d_dense/3d_densenet/src/common.py dfa1857602c6456f unverified Apache-2.0 (permissive)
Towards Effective Context for Meta-Reinforcement Learning: an Approach based on Contrastive Learning 29 Sep 2020 TJU-DRL-LAB/self-supervised-rl/RL_with_Environment_Representation/PAnDR/env_utils.py 94587585389ef56a ran fingerprinted Apache-2.0 (permissive)
PanNuke Dataset Extension, Insights and Baselines 24 Mar 2020 kaiseem/pointnu-net/losses/dice_loss.py f93cd0d2bb2e4795 ran MIT (permissive)
U-Net: Convolutional Networks for Biomedical Image Segmentation 18 May 2015 shanglianlm0525/CvPytorch/src/models/unet.py 870d606b4c6e72da unverified MIT (permissive)
Conditional Generative Adversarial Nets 6 Nov 2014 adldotori/CGAN/model.py 66433ac88d15d35d ran · our draft was wrong no licence file found · pointer only
ACL Anthology id 2022.findings-naacl.131 RUCAIBox/SAFE/modeling/modeling_qagnn.py 440036c58abd9ccc ran MIT (permissive)

This site shows no code text; each File cell links to the file on GitHub at the repository's current default branch, which may have changed since the harvest. "Pointer only" means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is under a permissive licence, but the stored copy of the same code that Syntology serves is not cleared for its text. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence cell for the reason. Per-sample records for a paper are on its paper page under "Code Syntology ran".

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections