{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/code/dense-to-one-hot","entry":"dense_to_one_hot","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":6,"n_papers_ran":3,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":4,"n_samples_ran":2,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":1,"unverified":2},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2310.11676","paper":"/paper/prem-a-simple-yet-effective-approach-for-node","title":"PREM: A Simple Yet Effective Approach for Node-Level Graph Anomaly Detection","date":"2023-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"campanulabells/prem-gad","path":"modules/utils.py","file_url":"https://github.com/campanulabells/prem-gad/blob/HEAD/modules/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e161978d5621fd5a","mcp_get_code":{"code_sha256":"e161978d5621fd5a"}},{"arxiv_id":"1906.06307","paper":"/paper/a-signal-propagation-perspective-for-pruning","title":"A Signal Propagation Perspective for Pruning Neural Networks at Initialization","date":"2019-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"namhoonlee/spp-public","path":"spp/mnist.py","file_url":"https://github.com/namhoonlee/spp-public/blob/HEAD/spp/mnist.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b757a2b89740842b","mcp_get_code":{"code_sha256":"b757a2b89740842b"}},{"arxiv_id":"1809.04157","paper":"/paper/heated-up-softmax-embedding","title":"Heated-Up Softmax Embedding","date":"2018-09-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ColumbiaDVMM/Heated_Up_Softmax_Embedding","path":"tensorflow/mnist.py","file_url":"https://github.com/ColumbiaDVMM/Heated_Up_Softmax_Embedding/blob/HEAD/tensorflow/mnist.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"code_sha256_prefix":"cd2dd7d4d3a3dff6","mcp_get_code":{"code_sha256":"cd2dd7d4d3a3dff6"}},{"arxiv_id":"1803.01500","paper":"/paper/memorization-precedes-generation-learning","title":"Memorization Precedes Generation: Learning Unsupervised GANs with Memory Networks","date":"2018-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"whyjay/memoryGAN","path":"affmnist.py","file_url":"https://github.com/whyjay/memoryGAN/blob/HEAD/affmnist.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cd2dd7d4d3a3dff6","mcp_get_code":{"code_sha256":"cd2dd7d4d3a3dff6"}},{"arxiv_id":"1801.02753","paper":"/paper/sketchygan-towards-diverse-and-realistic","title":"SketchyGAN: Towards Diverse and Realistic Sketch to Image Synthesis","date":"2018-01-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wchen342/SketchyGAN","path":"data_processing/flickr_to_tfrecord.py","file_url":"https://github.com/wchen342/SketchyGAN/blob/HEAD/data_processing/flickr_to_tfrecord.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0733c2b9edad3935","mcp_get_code":{"code_sha256":"0733c2b9edad3935"}},{"arxiv_id":"1710.09829","paper":"/paper/dynamic-routing-between-capsules","title":"Dynamic Routing Between Capsules","date":"2017-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ameliajimenez/capsule-networks-medical-data-challenges","path":"data_loader.py","file_url":"https://github.com/ameliajimenez/capsule-networks-medical-data-challenges/blob/HEAD/data_loader.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e161978d5621fd5a","mcp_get_code":{"code_sha256":"e161978d5621fd5a"}}]}