{"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/random-mask","entry":"random_mask","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":13,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":7,"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":13,"n_samples_ran":9,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":2,"n_samples_unverified":4,"n_samples_fingerprinted":3,"n_places":14,"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":1,"ran_draft_wrong":0,"ran_fixture":2,"ran":6,"unverified":4},"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":"2412.09328","arxiv_id_is_arxiv":true,"paper":"/paper/auto-regressive-moving-diffusion-models-for","title":"Auto-Regressive Moving Diffusion Models for Time Series Forecasting","date":"2024-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"daxin007/armd","path":"Utils/imputation_utils.py","file_url":"https://github.com/daxin007/armd/blob/HEAD/Utils/imputation_utils.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":"495e06d1db831486","code_sha256_prefix":"495e06d1db831486","mcp_get_code":{"code_sha256":"495e06d1db831486"}},{"arxiv_id":"2411.07506","arxiv_id_is_arxiv":true,"paper":"/paper/fm-ts-flow-matching-for-time-series","title":"FM-TS: Flow Matching for Time Series Generation","date":"2024-11-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"unites-lab/fmts","path":"FMTS/Utils/imputation_utils.py","file_url":"https://github.com/unites-lab/fmts/blob/HEAD/FMTS/Utils/imputation_utils.py","status":"ran","verification_level":1,"contract_check":null,"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, unites-lab/fmts when it was checked","code_sha256":"495e06d1db831486","code_sha256_prefix":"495e06d1db831486","mcp_get_code":{"code_sha256":"495e06d1db831486"}},{"arxiv_id":"2406.16148","arxiv_id_is_arxiv":true,"paper":"/paper/towards-open-respiratory-acoustic-foundation","title":"Towards Open Respiratory Acoustic Foundation Models: Pretraining and Benchmarking","date":"2024-06-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"evelyn0414/opera","path":"src/util.py","file_url":"https://github.com/evelyn0414/opera/blob/HEAD/src/util.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8ceb445ccf7af790","code_sha256_prefix":"8ceb445ccf7af790","mcp_get_code":{"code_sha256":"8ceb445ccf7af790"}},{"arxiv_id":"2406.09870","arxiv_id_is_arxiv":true,"paper":"/paper/igl-bench-establishing-the-comprehensive","title":"IGL-Bench: Establishing the Comprehensive Benchmark for Imbalanced Graph Learning","date":"2024-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RingBDStack/IGL-Bench","path":"IGL_Bench/algorithm/COLDBREW/utils.py","file_url":"https://github.com/RingBDStack/IGL-Bench/blob/HEAD/IGL_Bench/algorithm/COLDBREW/utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4d6df03aa2af1f80","code_sha256_prefix":"4d6df03aa2af1f80","mcp_get_code":{"code_sha256":"4d6df03aa2af1f80"}},{"arxiv_id":"2406.07547","arxiv_id_is_arxiv":true,"paper":"/paper/zero-shot-image-editing-with-reference","title":"Zero-shot Image Editing with Reference Imitation","date":"2024-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ali-vilab/MimicBrush","path":"dataset/data_utils.py","file_url":"https://github.com/ali-vilab/MimicBrush/blob/HEAD/dataset/data_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ba8f22021dec0132","code_sha256_prefix":"ba8f22021dec0132","mcp_get_code":{"code_sha256":"ba8f22021dec0132"}},{"arxiv_id":"2402.02518","arxiv_id_is_arxiv":true,"paper":"/paper/latent-graph-diffusion-a-unified-framework","title":"Unifying Generation and Prediction on Graphs with Latent Graph Diffusion","date":"2024-02-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhouc20/latentgraphdiffusion","path":"utils.py","file_url":"https://github.com/zhouc20/latentgraphdiffusion/blob/HEAD/utils.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":"a7aa470daf7aba0e","code_sha256_prefix":"a7aa470daf7aba0e","mcp_get_code":{"code_sha256":"a7aa470daf7aba0e"}},{"arxiv_id":"2310.02553","arxiv_id_is_arxiv":true,"paper":"/paper/full-atom-protein-pocket-design-via-iterative","title":"Full-Atom Protein Pocket Design via Iterative Refinement","date":"2023-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zaixizhang/FAIR","path":"models/PD.py","file_url":"https://github.com/zaixizhang/FAIR/blob/HEAD/models/PD.py","status":"unverified","verification_level":0,"contract_check":null,"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, zaixizhang/FAIR when it was checked","code_sha256":"e55ae4b7e12cd470","code_sha256_prefix":"e55ae4b7e12cd470","mcp_get_code":{"code_sha256":"e55ae4b7e12cd470"}},{"arxiv_id":"2307.16605","arxiv_id_is_arxiv":true,"paper":"/paper/vpp-efficient-conditional-3d-generation-via-1","title":"VPP: Efficient Conditional 3D Generation via Voxel-Point Progressive Representation","date":"2023-07-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qizekun/vpp","path":"models/VPP.py","file_url":"https://github.com/qizekun/vpp/blob/HEAD/models/VPP.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d915b3c1e7c70815","code_sha256_prefix":"d915b3c1e7c70815","mcp_get_code":{"code_sha256":"d915b3c1e7c70815"}},{"arxiv_id":"2305.00673","arxiv_id_is_arxiv":true,"paper":"/paper/bidirectional-copy-paste-for-semi-supervised","title":"Bidirectional Copy-Paste for Semi-Supervised Medical Image Segmentation","date":"2023-05-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deepmed-lab-ecnu/bcp","path":"code/utils/BCP_utils.py","file_url":"https://github.com/deepmed-lab-ecnu/bcp/blob/HEAD/code/utils/BCP_utils.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":"ce1c2f509485040b","code_sha256_prefix":"ce1c2f509485040b","mcp_get_code":{"code_sha256":"ce1c2f509485040b"}},{"arxiv_id":"2303.12364","arxiv_id_is_arxiv":true,"paper":"/paper/exbehrt-extended-transformer-for-electronic","title":"ExBEHRT: Extended Transformer for Electronic Health Records to Predict Disease Subtypes & Progressions","date":"2023-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deepmedicine/BEHRT","path":"dataLoader/utils.py","file_url":"https://github.com/deepmedicine/BEHRT/blob/HEAD/dataLoader/utils.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":"d35ee78e76ea22cc","code_sha256_prefix":"d35ee78e76ea22cc","mcp_get_code":{"code_sha256":"d35ee78e76ea22cc"}},{"arxiv_id":"2106.00786","arxiv_id_is_arxiv":true,"paper":"/paper/search-methods-for-sufficient-socially","title":"The Out-of-Distribution Problem in Explainability and Search Methods for Feature Importance Explanations","date":"2021-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"peterbhase/explanationsearch","path":"OOD_analysis/compute_counterfactual.py","file_url":"https://github.com/peterbhase/explanationsearch/blob/HEAD/OOD_analysis/compute_counterfactual.py","status":"unverified","verification_level":0,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4f898c3ab836a9b9","code_sha256_prefix":"4f898c3ab836a9b9","mcp_get_code":{"code_sha256":"4f898c3ab836a9b9"}},{"arxiv_id":"2010.09750","arxiv_id_is_arxiv":true,"paper":"/paper/investigating-and-simplifying-masking-based-1","title":"Investigating and Simplifying Masking-based Saliency Methods for Model Interpretability","date":"2020-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zphang/saliency_investigation","path":"casme/ext/pconv_keras.py","file_url":"https://github.com/zphang/saliency_investigation/blob/HEAD/casme/ext/pconv_keras.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ab33a7e0d32b0259","code_sha256_prefix":"ab33a7e0d32b0259","mcp_get_code":{"code_sha256":"ab33a7e0d32b0259"}},{"arxiv_id":"1804.07723","arxiv_id_is_arxiv":true,"paper":"/paper/image-inpainting-for-irregular-holes-using","title":"Image Inpainting for Irregular Holes Using Partial Convolutions","date":"2018-04-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"King-HAW/CT_inpainting","path":"libs/util.py","file_url":"https://github.com/King-HAW/CT_inpainting/blob/HEAD/libs/util.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":"b40728d4612d7b4a","code_sha256_prefix":"b40728d4612d7b4a","mcp_get_code":{"code_sha256":"b40728d4612d7b4a"}},{"arxiv_id":"1804.07723","arxiv_id_is_arxiv":true,"paper":"/paper/image-inpainting-for-irregular-holes-using","title":"Image Inpainting for Irregular Holes Using Partial Convolutions","date":"2018-04-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TrinhQuocNguyen/Edited_PConv-Keras","path":"libs/util.py","file_url":"https://github.com/TrinhQuocNguyen/Edited_PConv-Keras/blob/HEAD/libs/util.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":"256be19ab72d51a4","code_sha256_prefix":"256be19ab72d51a4","mcp_get_code":{"code_sha256":"256be19ab72d51a4"}}],"record_sha256":"546e392660204b25102d712cdfb86d1d7d9201a54fe6bd72b72353ad62dee494","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}