{"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/get-hms","entry":"get_hms","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":8,"n_papers_ran":8,"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":2,"n_samples_ran":2,"n_samples_fingerprinted":2,"n_places":9,"n_places_pointer_only":4,"by_status":{"ran_honours":2,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":0},"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":"2503.09411","paper":"/paper/benefits-of-learning-rate-annealing-for","title":"Benefits of Learning Rate Annealing for Tuning-Robustness in Stochastic Optimization","date":"2025-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bmsookim/wide-resnet.pytorch","path":"config.py","file_url":"https://github.com/bmsookim/wide-resnet.pytorch/blob/HEAD/config.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"bb104479d26e39c3","mcp_get_code":{"code_sha256":"bb104479d26e39c3"}},{"arxiv_id":"2410.22728","paper":"/paper/offline-behavior-distillation","title":"Offline Behavior Distillation","date":"2024-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LeavesLei/OBD","path":"utils.py","file_url":"https://github.com/LeavesLei/OBD/blob/HEAD/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"bb104479d26e39c3","mcp_get_code":{"code_sha256":"bb104479d26e39c3"}},{"arxiv_id":"2403.00329","paper":"/paper/learning-with-logical-constraints-but-without","title":"Learning with Logical Constraints but without Shortcut Satisfaction","date":"2024-03-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"softwiser-group/nesy-without-shortcuts","path":"hwf_exp/config.py","file_url":"https://github.com/softwiser-group/nesy-without-shortcuts/blob/HEAD/hwf_exp/config.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"238a5c2af722aa4b","mcp_get_code":{"code_sha256":"238a5c2af722aa4b"}},{"arxiv_id":"2403.00329","paper":"/paper/learning-with-logical-constraints-but-without","title":"Learning with Logical Constraints but without Shortcut Satisfaction","date":"2024-03-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SoftWiser-group/NeSy-without-Shortcuts","path":"hwf_exp/config.py","file_url":"https://github.com/SoftWiser-group/NeSy-without-Shortcuts/blob/HEAD/hwf_exp/config.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"bb104479d26e39c3","mcp_get_code":{"code_sha256":"bb104479d26e39c3"}},{"arxiv_id":"2204.10839","paper":"/paper/how-sampling-impacts-the-robustness-of","title":"How Sampling Impacts the Robustness of Stochastic Neural Networks","date":"2022-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"meliketoy/wide-resnet.pytorch","path":"config.py","file_url":"https://github.com/meliketoy/wide-resnet.pytorch/blob/HEAD/config.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"bb104479d26e39c3","mcp_get_code":{"code_sha256":"bb104479d26e39c3"}},{"arxiv_id":"1905.10964","paper":"/paper/combating-label-noise-in-deep-learning-using","title":"Combating Label Noise in Deep Learning Using Abstention","date":"2019-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thulas/dac-label-noise","path":"train_dac.py","file_url":"https://github.com/thulas/dac-label-noise/blob/HEAD/train_dac.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"bb104479d26e39c3","mcp_get_code":{"code_sha256":"bb104479d26e39c3"}},{"arxiv_id":"1812.05159","paper":"/paper/an-empirical-study-of-example-forgetting","title":"An Empirical Study of Example Forgetting during Deep Neural Network Learning","date":"2018-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mtoneva/example_forgetting","path":"run_mnist.py","file_url":"https://github.com/mtoneva/example_forgetting/blob/HEAD/run_mnist.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"bb104479d26e39c3","mcp_get_code":{"code_sha256":"bb104479d26e39c3"}},{"arxiv_id":"1805.08079","paper":"/paper/faster-neural-network-training-with","title":"Faster Neural Network Training with Approximate Tensor Operations","date":"2018-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"acsl-technion/approx","path":"src/pytorch/cifar_dist/config.py","file_url":"https://github.com/acsl-technion/approx/blob/HEAD/src/pytorch/cifar_dist/config.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"bb104479d26e39c3","mcp_get_code":{"code_sha256":"bb104479d26e39c3"}},{"arxiv_id":"1802.07088","paper":"/paper/i-revnet-deep-invertible-networks","title":"i-RevNet: Deep Invertible Networks","date":"2018-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jhjacobsen/pytorch-i-revnet","path":"models/utils_cifar.py","file_url":"https://github.com/jhjacobsen/pytorch-i-revnet/blob/HEAD/models/utils_cifar.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"bb104479d26e39c3","mcp_get_code":{"code_sha256":"bb104479d26e39c3"}}]}