{"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/maskedconv2d","entry":"MaskedConv2d","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":7,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":7,"n_papers_ran_instrument_only":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":8,"n_samples_ran":8,"n_samples_constructed":4,"n_samples_ran_checked":8,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":7,"n_places":8,"n_places_pointer_only":4,"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":0,"ran":8,"unverified":0},"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":"2503.08918","arxiv_id_is_arxiv":true,"paper":"/paper/multilevel-generative-samplers-for","title":"Multilevel Generative Samplers for Investigating Critical Phenomena","date":"2025-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mlneuralsampler/multilevel","path":"van_code/nn.py","file_url":"https://github.com/mlneuralsampler/multilevel/blob/HEAD/van_code/nn.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":"d81b67e6163414d2","code_sha256_prefix":"d81b67e6163414d2","mcp_get_code":{"code_sha256":"d81b67e6163414d2"}},{"arxiv_id":"2406.07083","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-mixture-learning-in-black-box","title":"Efficient Mixture Learning in Black-Box Variational Inference","date":"2024-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"okviman/efficient-mixtures","path":"models/misvae.py","file_url":"https://github.com/okviman/efficient-mixtures/blob/HEAD/models/misvae.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, okviman/efficient-mixtures when it was checked","code_sha256":"1e7fccef55322b25","code_sha256_prefix":"1e7fccef55322b25","mcp_get_code":{"code_sha256":"1e7fccef55322b25"}},{"arxiv_id":"2109.15047","arxiv_id_is_arxiv":true,"paper":"/paper/deep-contextual-video-compression","title":"Deep Contextual Video Compression","date":"2021-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DeepMC-DCVC/DCVC","path":"src/models/DCVC_net.py","file_url":"https://github.com/DeepMC-DCVC/DCVC/blob/HEAD/src/models/DCVC_net.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2e84e4d2265d5ef3","code_sha256_prefix":"2e84e4d2265d5ef3","mcp_get_code":{"code_sha256":"2e84e4d2265d5ef3"}},{"arxiv_id":"2105.05650","arxiv_id_is_arxiv":true,"paper":"/paper/unbiased-monte-carlo-cluster-updates-with","title":"Unbiased Monte Carlo Cluster Updates with Autoregressive Neural Networks","date":"2021-05-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wdphy16/neural-cluster-update","path":"net.py","file_url":"https://github.com/wdphy16/neural-cluster-update/blob/HEAD/net.py","status":"ran","verification_level":1,"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":"24a001e0b6b5fa2b","code_sha256_prefix":"24a001e0b6b5fa2b","mcp_get_code":{"code_sha256":"24a001e0b6b5fa2b"}},{"arxiv_id":"2007.03898","arxiv_id_is_arxiv":true,"paper":"/paper/nvae-a-deep-hierarchical-variational","title":"NVAE: A Deep Hierarchical Variational Autoencoder","date":"2020-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SerezD/NVAE-from-scratch","path":"src/model.py","file_url":"https://github.com/SerezD/NVAE-from-scratch/blob/HEAD/src/model.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":"ea5de3e39f202a06","code_sha256_prefix":"ea5de3e39f202a06","mcp_get_code":{"code_sha256":"ea5de3e39f202a06"}},{"arxiv_id":"1601.06759","arxiv_id_is_arxiv":true,"paper":"/paper/pixel-recurrent-neural-networks","title":"Pixel Recurrent Neural Networks","date":"2016-01-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anordertoreclaim/PixelCNN","path":"pixelcnn/model.py","file_url":"https://github.com/anordertoreclaim/PixelCNN/blob/HEAD/pixelcnn/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, anordertoreclaim/PixelCNN when it was checked","code_sha256":"f3742ce708e8768a","code_sha256_prefix":"f3742ce708e8768a","mcp_get_code":{"code_sha256":"f3742ce708e8768a"}},{"arxiv_id":"1601.06759","arxiv_id_is_arxiv":true,"paper":"/paper/pixel-recurrent-neural-networks","title":"Pixel Recurrent Neural Networks","date":"2016-01-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kamenbliznashki/pixel_models","path":"pixelcnn.py","file_url":"https://github.com/kamenbliznashki/pixel_models/blob/HEAD/pixelcnn.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, kamenbliznashki/pixel_models when it was checked","code_sha256":"4b84e15d943e0dd1","code_sha256_prefix":"4b84e15d943e0dd1","mcp_get_code":{"code_sha256":"4b84e15d943e0dd1"}},{"arxiv_id":"1509.00519","arxiv_id_is_arxiv":true,"paper":"/paper/importance-weighted-autoencoders","title":"Importance Weighted Autoencoders","date":"2015-09-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"harvardnlp/sa-vae","path":"models_img.py","file_url":"https://github.com/harvardnlp/sa-vae/blob/HEAD/models_img.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, harvardnlp/sa-vae when it was checked","code_sha256":"0df0f85652bb400e","code_sha256_prefix":"0df0f85652bb400e","mcp_get_code":{"code_sha256":"0df0f85652bb400e"}}],"record_sha256":"ce5768936f7488f286d91471e53c5ccc0dfe53c5a903a0ea903fe26da4b21ec8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}