{"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/build-act","entry":"build_act","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":0,"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":0,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":0,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"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":"2601.22904","paper":"/paper/arxiv-2601-22904","title":"Hyperspherical Autoencoder for High-Fidelity Image Reconstruction and Generation","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"wkdgnsgo/HAE","path":"src/model.py","file_url":"https://github.com/wkdgnsgo/HAE/blob/HEAD/src/model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"dd8d58aad9206d22","mcp_get_code":{"code_sha256":"dd8d58aad9206d22"}},{"arxiv_id":"2410.10733","paper":"/paper/deep-compression-autoencoder-for-efficient","title":"Deep Compression Autoencoder for Efficient High-Resolution Diffusion Models","date":"2024-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mit-han-lab/efficientvit","path":"efficientvit/models/efficientvit/dc_ae.py","file_url":"https://github.com/mit-han-lab/efficientvit/blob/HEAD/efficientvit/models/efficientvit/dc_ae.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":"63bb3de89867ea9d","mcp_get_code":{"code_sha256":"63bb3de89867ea9d"}},{"arxiv_id":"2007.11622","paper":"/paper/tiny-transfer-learning-towards-memory","title":"TinyTL: Reduce Activations, Not Trainable Parameters for Efficient On-Device Learning","date":"2020-07-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mit-han-lab/tinyML","path":"netaug/models/base/layers.py","file_url":"https://github.com/mit-han-lab/tinyML/blob/HEAD/netaug/models/base/layers.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2f3a2114fb7ba02f","mcp_get_code":{"code_sha256":"2f3a2114fb7ba02f"}},{"arxiv_id":"1803.00933","paper":"/paper/distributed-prioritized-experience-replay","title":"Distributed Prioritized Experience Replay","date":"2018-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uber-research/ape-x","path":"apex.py","file_url":"https://github.com/uber-research/ape-x/blob/HEAD/apex.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":"e580a410194b1778","mcp_get_code":{"code_sha256":"e580a410194b1778"}},{"arxiv_id":"1509.06461","paper":"/paper/deep-reinforcement-learning-with-double-q","title":"Deep Reinforcement Learning with Double Q-learning","date":"2015-09-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hill-a/stable-baselines","path":"stable_baselines/deepq/build_graph.py","file_url":"https://github.com/hill-a/stable-baselines/blob/HEAD/stable_baselines/deepq/build_graph.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ca48ef0e750004ab","mcp_get_code":{"code_sha256":"ca48ef0e750004ab"}}]}