{"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/onehot-encode","entry":"onehot_encode","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":5,"n_papers_ran":1,"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":5,"n_samples_ran":1,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":4},"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":"2602.08067","paper":"/paper/arxiv-2602-08067","title":"Enhancing Bandit Algorithms with LLMs for Time-varying User Preferences in Streaming Recommendations","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"Starrylay/HyperBandit","path":"hypernet.py","file_url":"https://github.com/Starrylay/HyperBandit/blob/HEAD/hypernet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"dd7a7d0adaad28f6","mcp_get_code":{"code_sha256":"dd7a7d0adaad28f6"}},{"arxiv_id":"2405.10994","paper":"/paper/what-do-you-want-from-theory-alone","title":"\"What do you want from theory alone?\" Experimenting with Tight Auditing of Differentially Private Synthetic Data Generation","date":null,"month_inferred_from_arxiv_id":"2024-05","title_source":"archive","repo":"spalabucr/synth-audit","path":"attacks/utils.py","file_url":"https://github.com/spalabucr/synth-audit/blob/HEAD/attacks/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e6c6e690307bd59d","mcp_get_code":{"code_sha256":"e6c6e690307bd59d"}},{"arxiv_id":"2104.13963","paper":"/paper/semi-supervised-learning-of-visual-features","title":"Semi-Supervised Learning of Visual Features by Non-Parametrically Predicting View Assignments with Support Samples","date":"2021-04-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sayakpaul/PAWS-TF","path":"utils/labeled_loader.py","file_url":"https://github.com/sayakpaul/PAWS-TF/blob/HEAD/utils/labeled_loader.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"fe3cc1bc7312b8a0","mcp_get_code":{"code_sha256":"fe3cc1bc7312b8a0"}},{"arxiv_id":"1911.09189","paper":"/paper/information-in-infinite-ensembles-of","title":"Information in Infinite Ensembles of Infinitely-Wide Neural Networks","date":"2019-11-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ravidziv/info_ntk","path":"info_ntk/datasets.py","file_url":"https://github.com/ravidziv/info_ntk/blob/HEAD/info_ntk/datasets.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5769dceb172581d7","mcp_get_code":{"code_sha256":"5769dceb172581d7"}},{"arxiv_id":"1904.09546","paper":"/paper/deepcaps-going-deeper-with-capsule-networks","title":"DeepCaps: Going Deeper with Capsule Networks","date":"2019-04-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Ugenteraan/Deep-CapsNet","path":"helpers.py","file_url":"https://github.com/Ugenteraan/Deep-CapsNet/blob/HEAD/helpers.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"077a8a0fd50b76e8","mcp_get_code":{"code_sha256":"077a8a0fd50b76e8"}}]}