{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/code/avg-pool","entry":"avg_pool","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+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 = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":8,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":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":8,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":2,"n_samples_unverified":3,"n_samples_fingerprinted":2,"n_places":8,"n_places_pointer_only":2,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":2,"ran":3,"unverified":3},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"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","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ae8276a108a62271","code_sha256_prefix":"ae8276a108a62271","mcp_get_code":{"code_sha256":"ae8276a108a62271"}},{"arxiv_id":"2311.01111","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, karellat/h-next, is not in the permissive set Syntology serves inline","code_sha256":"9cda4f2765f752c3","code_sha256_prefix":"9cda4f2765f752c3","mcp_get_code":{"code_sha256":"9cda4f2765f752c3"}},{"arxiv_id":"2111.12139","arxiv_id_is_arxiv":true,"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_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"45b0c7710b8150de","code_sha256_prefix":"45b0c7710b8150de","mcp_get_code":{"code_sha256":"45b0c7710b8150de"}},{"arxiv_id":"2012.13078","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, debjani-bhowmick/harmonic-net-pytorch when it was checked","code_sha256":"fb9990354d289b60","code_sha256_prefix":"fb9990354d289b60","mcp_get_code":{"code_sha256":"fb9990354d289b60"}},{"arxiv_id":"2002.04720","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"703ab4f978cdd28f","code_sha256_prefix":"703ab4f978cdd28f","mcp_get_code":{"code_sha256":"703ab4f978cdd28f"}},{"arxiv_id":"1906.01444","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"67a83a4977e5900b","code_sha256_prefix":"67a83a4977e5900b","mcp_get_code":{"code_sha256":"67a83a4977e5900b"}},{"arxiv_id":"1904.07482","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"289b3ed57b2ccc58","code_sha256_prefix":"289b3ed57b2ccc58","mcp_get_code":{"code_sha256":"289b3ed57b2ccc58"}},{"arxiv_id":"1512.00567","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9163602355a43f00","code_sha256_prefix":"9163602355a43f00","mcp_get_code":{"code_sha256":"9163602355a43f00"}}],"record_sha256":"796cd3c59d97553c859ba2b96ad93866884bb73a31761aee8638d1901815ea22","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}