{"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/to-onehot","entry":"to_onehot","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":9,"n_papers_ran":4,"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":9,"n_samples_ran":4,"n_samples_fingerprinted":2,"n_places":9,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":1,"ran":1,"unverified":5},"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":"2308.10445","paper":"/paper/when-prompt-based-incremental-learning-does","title":"When Prompt-based Incremental Learning Does Not Meet Strong Pretraining","date":"2023-08-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TOM-tym/APG","path":"inclearn/lib/utils.py","file_url":"https://github.com/TOM-tym/APG/blob/HEAD/inclearn/lib/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"78296d162a14a673","mcp_get_code":{"code_sha256":"78296d162a14a673"}},{"arxiv_id":"2304.03431","paper":"/paper/domain-generalization-in-robust-invariant","title":"Domain Generalization In Robust Invariant Representation","date":"2023-04-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GauriGupta19/Domain-Generalisation-in-Invariance","path":"src/functions.py","file_url":"https://github.com/GauriGupta19/Domain-Generalisation-in-Invariance/blob/HEAD/src/functions.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"512643e9de295e91","mcp_get_code":{"code_sha256":"512643e9de295e91"}},{"arxiv_id":"2205.01316","paper":"/paper/hl-net-heterophily-learning-network-for-scene","title":"HL-Net: Heterophily Learning Network for Scene Graph Generation","date":"2022-05-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"siml3/HL-Net","path":"maskrcnn_benchmark/modeling/roi_heads/relation_head/model_mp.py","file_url":"https://github.com/siml3/HL-Net/blob/HEAD/maskrcnn_benchmark/modeling/roi_heads/relation_head/model_mp.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0cbeff1b7f9a25e0","mcp_get_code":{"code_sha256":"0cbeff1b7f9a25e0"}},{"arxiv_id":"2203.03535","paper":"/paper/influencing-long-term-behavior-in-multiagent","title":"Influencing Long-Term Behavior in Multiagent Reinforcement Learning","date":"2022-03-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dkkim93/further","path":"algorithm/further/agent.py","file_url":"https://github.com/dkkim93/further/blob/HEAD/algorithm/further/agent.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"818ef30cb3e0a466","mcp_get_code":{"code_sha256":"818ef30cb3e0a466"}},{"arxiv_id":"2110.05422","paper":"/paper/calibrate-your-listeners-robust-communication","title":"Calibrate your listeners! Robust communication-based training for pragmatic speakers","date":"2021-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rosewang2008/calibrate_your_listeners","path":"calibrate_your_listeners/src/models/speaker.py","file_url":"https://github.com/rosewang2008/calibrate_your_listeners/blob/HEAD/calibrate_your_listeners/src/models/speaker.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e68f3fa02c6de0e8","mcp_get_code":{"code_sha256":"e68f3fa02c6de0e8"}},{"arxiv_id":"1906.07413","paper":"/paper/learning-imbalanced-datasets-with-label","title":"Learning Imbalanced Datasets with Label-Distribution-Aware Margin Loss","date":"2019-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ihaeyong/maximum-margin-ldam","path":"utils.py","file_url":"https://github.com/ihaeyong/maximum-margin-ldam/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"83b8128b16e83cfc","mcp_get_code":{"code_sha256":"83b8128b16e83cfc"}},{"arxiv_id":"1904.00314","paper":"/paper/molecular-geometry-prediction-using-a-deep","title":"Molecular geometry prediction using a deep generative graph neural network","date":"2019-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nyu-dl/dl4chem-geometry","path":"COD_featurize.py","file_url":"https://github.com/nyu-dl/dl4chem-geometry/blob/HEAD/COD_featurize.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"2f7860077df961f4","mcp_get_code":{"code_sha256":"2f7860077df961f4"}},{"arxiv_id":"1607.03250","paper":"/paper/network-trimming-a-data-driven-neuron-pruning","title":"Network Trimming: A Data-Driven Neuron Pruning Approach towards Efficient Deep Architectures","date":"2016-07-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BenWhetton/keras-surgeon","path":"src/kerassurgeon/examples/lenet_mnist.py","file_url":"https://github.com/BenWhetton/keras-surgeon/blob/HEAD/src/kerassurgeon/examples/lenet_mnist.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"b678e77541a85834","mcp_get_code":{"code_sha256":"b678e77541a85834"}},{"arxiv_id":"1509.00519","paper":"/paper/importance-weighted-autoencoders","title":"Importance Weighted Autoencoders","date":"2015-09-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jurgisp/pydreamer","path":"pydreamer/preprocessing.py","file_url":"https://github.com/jurgisp/pydreamer/blob/HEAD/pydreamer/preprocessing.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5f3793a255e72f19","mcp_get_code":{"code_sha256":"5f3793a255e72f19"}}]}