{"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/conv-output-shape","entry":"conv_output_shape","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":5,"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":6,"n_samples_ran":3,"n_samples_fingerprinted":2,"n_places":8,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":1,"ran_draft_wrong":1,"ran_fixture":0,"ran":1,"unverified":3},"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":"2410.10132","paper":"/paper/stable-hadamard-memory-revitalizing-memory","title":"Stable Hadamard Memory: Revitalizing Memory-Augmented Agents for Reinforcement Learning","date":"2024-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thaihungle/SHM","path":"pomdp-baselines/torchkit/networks.py","file_url":"https://github.com/thaihungle/SHM/blob/HEAD/pomdp-baselines/torchkit/networks.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"3b144ecc95867dbc","mcp_get_code":{"code_sha256":"3b144ecc95867dbc"}},{"arxiv_id":"2402.18002","paper":"/paper/symmetry-aware-reinforcement-learning-for","title":"Symmetry-aware Reinforcement Learning for Robotic Assembly under Partial Observability with a Soft Wrist","date":"2024-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"omron-sinicx/symmetry-aware-pomdp","path":"torchkit/networks.py","file_url":"https://github.com/omron-sinicx/symmetry-aware-pomdp/blob/HEAD/torchkit/networks.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3b144ecc95867dbc","mcp_get_code":{"code_sha256":"3b144ecc95867dbc"}},{"arxiv_id":"2307.03864","paper":"/paper/when-do-transformers-shine-in-rl-decoupling-1","title":"When Do Transformers Shine in RL? Decoupling Memory from Credit Assignment","date":"2023-07-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"twni2016/memory-rl","path":"torchkit/networks.py","file_url":"https://github.com/twni2016/memory-rl/blob/HEAD/torchkit/networks.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3b144ecc95867dbc","mcp_get_code":{"code_sha256":"3b144ecc95867dbc"}},{"arxiv_id":"2209.08725","paper":"/paper/neural-wavelet-domain-diffusion-for-3d-shape","title":"Neural Wavelet-domain Diffusion for 3D Shape Generation","date":"2022-09-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"edward1997104/Wavelet-Generation","path":"models/network.py","file_url":"https://github.com/edward1997104/Wavelet-Generation/blob/HEAD/models/network.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"bba207bd5fbad473","mcp_get_code":{"code_sha256":"bba207bd5fbad473"}},{"arxiv_id":"2011.01089","paper":"/paper/instance-based-generalization-in","title":"Instance based Generalization in Reinforcement Learning","date":"2020-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MartinBertran/InstanceAgnosticPolicyEnsembles","path":"iape/iape/backend/core.py","file_url":"https://github.com/MartinBertran/InstanceAgnosticPolicyEnsembles/blob/HEAD/iape/iape/backend/core.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"c2f750d2cc520160","mcp_get_code":{"code_sha256":"c2f750d2cc520160"}},{"arxiv_id":"1909.01492","paper":"/paper/achieving-verified-robustness-to-symbol","title":"Achieving Verified Robustness to Symbol Substitutions via Interval Bound Propagation","date":"2019-09-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deepmind/interval-bound-propagation","path":"interval_bound_propagation/src/layer_utils.py","file_url":"https://github.com/deepmind/interval-bound-propagation/blob/HEAD/interval_bound_propagation/src/layer_utils.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":"d22d23d5d83cc957","mcp_get_code":{"code_sha256":"d22d23d5d83cc957"}},{"arxiv_id":"1906.06818","paper":"/paper/stacked-capsule-autoencoders","title":"Stacked Capsule Autoencoders","date":"2019-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KohavTal/SCAE_Project","path":"torch_scae/nn_utils.py","file_url":"https://github.com/KohavTal/SCAE_Project/blob/HEAD/torch_scae/nn_utils.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":"46a280d5631eb673","mcp_get_code":{"code_sha256":"46a280d5631eb673"}},{"arxiv_id":"1810.12894","paper":"/paper/exploration-by-random-network-distillation","title":"Exploration by Random Network Distillation","date":"2018-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DuaneNielsen/rnd","path":"novelty_policy.py","file_url":"https://github.com/DuaneNielsen/rnd/blob/HEAD/novelty_policy.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"3212247a9c7830c7","mcp_get_code":{"code_sha256":"3212247a9c7830c7"}}]}