{"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/convolve","entry":"convolve","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":6,"n_samples_ran":2,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":1,"ran":1,"unverified":4},"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":"2202.09153","paper":"/paper/gaussian-mixture-convolution-networks-1","title":"Gaussian Mixture Convolution Networks","date":"2022-02-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cg-tuwien/gaussian-mixture-convolution-networks","path":"src/gmc/mixture.py","file_url":"https://github.com/cg-tuwien/gaussian-mixture-convolution-networks/blob/HEAD/src/gmc/mixture.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c190920c27fc0fb1","mcp_get_code":{"code_sha256":"c190920c27fc0fb1"}},{"arxiv_id":"2010.00712","paper":"/paper/faster-binary-embeddings-for-preserving","title":"Faster Binary Embeddings for Preserving Euclidean Distances","date":"2020-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jayzhang0727/Faster-Binary-Embeddings-for-Preserving-Euclidean-Distances","path":"quantizer.py","file_url":"https://github.com/jayzhang0727/Faster-Binary-Embeddings-for-Preserving-Euclidean-Distances/blob/HEAD/quantizer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"fb3b17dd2381266d","mcp_get_code":{"code_sha256":"fb3b17dd2381266d"}},{"arxiv_id":"1907.12353","paper":"/paper/recursive-cascaded-networks-for-unsupervised","title":"Recursive Cascaded Networks for Unsupervised Medical Image Registration","date":"2019-07-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"w19787/Recursive-Cascaded-Networks-TF2.0","path":"network/utils.py","file_url":"https://github.com/w19787/Recursive-Cascaded-Networks-TF2.0/blob/HEAD/network/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"236795484e1d97f3","mcp_get_code":{"code_sha256":"236795484e1d97f3"}},{"arxiv_id":"1906.06698","paper":"/paper/beyond-product-quantization-deep-progressive","title":"Beyond Product Quantization: Deep Progressive Quantization for Image Retrieval","date":"2019-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cfm-uestc/DPQ","path":"Encoder_VGG.py","file_url":"https://github.com/cfm-uestc/DPQ/blob/HEAD/Encoder_VGG.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6cf89909831f0fe2","mcp_get_code":{"code_sha256":"6cf89909831f0fe2"}},{"arxiv_id":"1802.10157","paper":"/paper/scarlet-source-separation-in-multi-band","title":"SCARLET: Source separation in multi-band images by Constrained Matrix Factorization","date":null,"month_inferred_from_arxiv_id":"2018-02","title_source":"archive","repo":"fred3m/scarlet","path":"scarlet/fft.py","file_url":"https://github.com/fred3m/scarlet/blob/HEAD/scarlet/fft.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f64f9f315400a3ed","mcp_get_code":{"code_sha256":"f64f9f315400a3ed"}},{"arxiv_id":"1802.10157","paper":"/paper/scarlet-source-separation-in-multi-band","title":"SCARLET: Source separation in multi-band images by Constrained Matrix Factorization","date":null,"month_inferred_from_arxiv_id":"2018-02","title_source":"archive","repo":"gcmshadow/scarlet","path":"scarlet/fft.py","file_url":"https://github.com/gcmshadow/scarlet/blob/HEAD/scarlet/fft.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e6458fe124e7e5ee","mcp_get_code":{"code_sha256":"e6458fe124e7e5ee"}}]}