{"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/avg-pool","entry":"avg_pool","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":3,"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":8,"n_samples_ran":3,"n_samples_fingerprinted":1,"n_places":8,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":1,"ran":2,"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":"2502.15805","paper":"/paper/fragfm-efficient-fragment-based-molecular","title":"FragFM: Hierarchical Framework for Efficient Molecule Generation via Fragment-Level Discrete Flow Matching","date":"2025-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wengong-jin/icml18-jtnn","path":"fast_jtnn/nnutils.py","file_url":"https://github.com/wengong-jin/icml18-jtnn/blob/HEAD/fast_jtnn/nnutils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ae8276a108a62271","mcp_get_code":{"code_sha256":"ae8276a108a62271"}},{"arxiv_id":"2311.01111","paper":"/paper/h-next-the-next-step-towards-roto-translation","title":"H-NeXt: The next step towards roto-translation invariant networks","date":"2023-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"karellat/h-next","path":"h-next/hnets/hnet_ops.py","file_url":"https://github.com/karellat/h-next/blob/HEAD/h-next/hnets/hnet_ops.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"9cda4f2765f752c3","mcp_get_code":{"code_sha256":"9cda4f2765f752c3"}},{"arxiv_id":"2111.12139","paper":"/paper/cheblienet-invariant-spectral-graph-nns","title":"ChebLieNet: Invariant Spectral Graph NNs Turned Equivariant by Riemannian Geometry on Lie Groups","date":"2021-11-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haguettaz/cheblienet","path":"cheblienet/nn/models/chebnets.py","file_url":"https://github.com/haguettaz/cheblienet/blob/HEAD/cheblienet/nn/models/chebnets.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"45b0c7710b8150de","mcp_get_code":{"code_sha256":"45b0c7710b8150de"}},{"arxiv_id":"2012.13078","paper":"/paper/rotation-equivariant-siamese-networks-for","title":"Rotation Equivariant Siamese Networks for Tracking","date":"2020-12-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"debjani-bhowmick/harmonic-net-pytorch","path":"hnet_ops.py","file_url":"https://github.com/debjani-bhowmick/harmonic-net-pytorch/blob/HEAD/hnet_ops.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"fb9990354d289b60","mcp_get_code":{"code_sha256":"fb9990354d289b60"}},{"arxiv_id":"2002.04720","paper":"/paper/improving-molecular-design-by-stochastic","title":"Improving Molecular Design by Stochastic Iterative Target Augmentation","date":"2020-02-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cbilodeau2/g2g_optimization","path":"g2g_optimization/hgraph/nnutils.py","file_url":"https://github.com/cbilodeau2/g2g_optimization/blob/HEAD/g2g_optimization/hgraph/nnutils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"703ab4f978cdd28f","mcp_get_code":{"code_sha256":"703ab4f978cdd28f"}},{"arxiv_id":"1906.01444","paper":"/paper/heterogeneous-gaussian-mechanism-preserving","title":"Heterogeneous Gaussian Mechanism: Preserving Differential Privacy in Deep Learning with Provable Robustness","date":"2019-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haiphanNJIT/StoBatch","path":"StoBatchCIFAR10/StoBatch_cifar10.py","file_url":"https://github.com/haiphanNJIT/StoBatch/blob/HEAD/StoBatchCIFAR10/StoBatch_cifar10.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"67a83a4977e5900b","mcp_get_code":{"code_sha256":"67a83a4977e5900b"}},{"arxiv_id":"1904.07482","paper":"/paper/object-oriented-dynamics-learning-through","title":"Object-Oriented Dynamics Learning through Multi-Level Abstraction","date":"2019-04-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mig-zh/OODP","path":"tflib/mmdminmax2.py","file_url":"https://github.com/mig-zh/OODP/blob/HEAD/tflib/mmdminmax2.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"289b3ed57b2ccc58","mcp_get_code":{"code_sha256":"289b3ed57b2ccc58"}},{"arxiv_id":"1512.00567","paper":"/paper/rethinking-the-inception-architecture-for","title":"Rethinking the Inception Architecture for Computer Vision","date":"2015-12-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"matthias-wright/jax-fid","path":"jax_fid/inception.py","file_url":"https://github.com/matthias-wright/jax-fid/blob/HEAD/jax_fid/inception.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":"9163602355a43f00","mcp_get_code":{"code_sha256":"9163602355a43f00"}}]}