{"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/str-to-class","entry":"str_to_class","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":2,"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":3,"n_samples_ran":1,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"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":"2404.10728","paper":"/paper/randomized-exploration-in-cooperative-multi","title":"Randomized Exploration in Cooperative Multi-Agent Reinforcement Learning","date":"2024-04-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"panxulab/MARL-CoopTS","path":"Utils/helper.py","file_url":"https://github.com/panxulab/MARL-CoopTS/blob/HEAD/Utils/helper.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a6a00df86213599f","mcp_get_code":{"code_sha256":"a6a00df86213599f"}},{"arxiv_id":"2303.11525","paper":"/paper/sift-sparse-iso-flop-transformations-for","title":"Sparse-IFT: Sparse Iso-FLOP Transformations for Maximizing Training Efficiency","date":"2023-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cerebrasresearch/sift","path":"ComputerVision/CIFAR/models/cifar_resnet18.py","file_url":"https://github.com/cerebrasresearch/sift/blob/HEAD/ComputerVision/CIFAR/models/cifar_resnet18.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":"24f161565d6a4013","mcp_get_code":{"code_sha256":"24f161565d6a4013"}},{"arxiv_id":"2206.05377","paper":"/paper/fast-building-segmentation-from-satellite","title":"Fast building segmentation from satellite imagery and few local labels","date":"2022-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fuzailpalnak/building-footprint-segmentation","path":"building_footprint_segmentation/helpers/schedular.py","file_url":"https://github.com/fuzailpalnak/building-footprint-segmentation/blob/HEAD/building_footprint_segmentation/helpers/schedular.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":"fa11de4317211633","mcp_get_code":{"code_sha256":"fa11de4317211633"}},{"arxiv_id":"2205.10868","paper":"/paper/memory-efficient-reinforcement-learning-with","title":"Memory-efficient Reinforcement Learning with Value-based Knowledge Consolidation","date":"2022-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qlan3/MeDQN","path":"utils/helper.py","file_url":"https://github.com/qlan3/MeDQN/blob/HEAD/utils/helper.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a6a00df86213599f","mcp_get_code":{"code_sha256":"a6a00df86213599f"}},{"arxiv_id":"2010.13581","paper":"/paper/simplifying-hamiltonian-and-lagrangian-neural","title":"Simplifying Hamiltonian and Lagrangian Neural Networks via Explicit Constraints","date":"2020-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mfinzi/constrained-hamiltonian-neural-networks","path":"pl_trainer.py","file_url":"https://github.com/mfinzi/constrained-hamiltonian-neural-networks/blob/HEAD/pl_trainer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"24f161565d6a4013","mcp_get_code":{"code_sha256":"24f161565d6a4013"}}]}