{"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/convolve","entry":"convolve","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":5,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":2,"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":6,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":2,"n_samples_unverified":2,"n_samples_fingerprinted":1,"n_places":6,"n_places_pointer_only":3,"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":1,"ran_fixture":1,"ran":2,"unverified":2},"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":"2202.09153","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, cg-tuwien/gaussian-mixture-convolution-networks when it was checked","code_sha256":"c190920c27fc0fb1","code_sha256_prefix":"c190920c27fc0fb1","mcp_get_code":{"code_sha256":"c190920c27fc0fb1"}},{"arxiv_id":"2010.00712","arxiv_id_is_arxiv":true,"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_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, jayzhang0727/Faster-Binary-Embeddings-for-Preserving-Euclidean-Distances when it was checked","code_sha256":"fb3b17dd2381266d","code_sha256_prefix":"fb3b17dd2381266d","mcp_get_code":{"code_sha256":"fb3b17dd2381266d"}},{"arxiv_id":"1907.12353","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, w19787/Recursive-Cascaded-Networks-TF2.0, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"236795484e1d97f3","code_sha256_prefix":"236795484e1d97f3","mcp_get_code":{"code_sha256":"236795484e1d97f3"}},{"arxiv_id":"1906.06698","arxiv_id_is_arxiv":true,"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":"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":"6cf89909831f0fe2","code_sha256_prefix":"6cf89909831f0fe2","mcp_get_code":{"code_sha256":"6cf89909831f0fe2"}},{"arxiv_id":"1802.10157","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f64f9f315400a3ed","code_sha256_prefix":"f64f9f315400a3ed","mcp_get_code":{"code_sha256":"f64f9f315400a3ed"}},{"arxiv_id":"1802.10157","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e6458fe124e7e5ee","code_sha256_prefix":"e6458fe124e7e5ee","mcp_get_code":{"code_sha256":"e6458fe124e7e5ee"}}],"record_sha256":"a42a9164b771759b26de2509068287eaa01b8696a34660597bf559751e4dfd91","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}