{"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/mask-2","entry":"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":10,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":1,"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":10,"n_samples_ran":7,"n_samples_constructed":5,"n_samples_ran_checked":6,"n_samples_instrument":1,"n_samples_unverified":3,"n_samples_fingerprinted":3,"n_places":10,"n_places_pointer_only":5,"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":1,"ran":6,"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":"2510.26268","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-26268","title":"Revisiting Generative Infrared and Visible Image Fusion Based on Human Cognitive Laws","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"lxq-jnu/HCLFuse","path":"models/ddm.py","file_url":"https://github.com/lxq-jnu/HCLFuse/blob/HEAD/models/ddm.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, lxq-jnu/HCLFuse when it was checked","code_sha256":"5e896fe6abf89525","code_sha256_prefix":"5e896fe6abf89525","mcp_get_code":{"code_sha256":"5e896fe6abf89525"}},{"arxiv_id":"2506.02612","arxiv_id_is_arxiv":true,"paper":"/paper/simple-good-fast-self-supervised-world-models","title":"Simple, Good, Fast: Self-Supervised World Models Free of Baggage","date":"2025-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jrobine/sgf","path":"src/wm.py","file_url":"https://github.com/jrobine/sgf/blob/HEAD/src/wm.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":"81c4e3c85779a38b","code_sha256_prefix":"81c4e3c85779a38b","mcp_get_code":{"code_sha256":"81c4e3c85779a38b"}},{"arxiv_id":"2505.23195","arxiv_id_is_arxiv":true,"paper":"/paper/less-is-more-unlocking-specialization-of-time","title":"Less is More: Unlocking Specialization of Time Series Foundation Models via Structured Pruning","date":"2025-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SJTU-DMTai/Prune-then-Finetune","path":"src/tsfm/layers/prune_mask.py","file_url":"https://github.com/SJTU-DMTai/Prune-then-Finetune/blob/HEAD/src/tsfm/layers/prune_mask.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"92baea6ddfe32892","code_sha256_prefix":"92baea6ddfe32892","mcp_get_code":{"code_sha256":"92baea6ddfe32892"}},{"arxiv_id":"2408.10614","arxiv_id_is_arxiv":true,"paper":"/paper/generalizable-facial-expression-recognition","title":"Generalizable Facial Expression Recognition","date":"2024-08-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zyh-uaiaaaa/Generalizable-FER","path":"code/ours_CAFE.py","file_url":"https://github.com/zyh-uaiaaaa/Generalizable-FER/blob/HEAD/code/ours_CAFE.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, zyh-uaiaaaa/Generalizable-FER when it was checked","code_sha256":"65aa1ef3d28f018c","code_sha256_prefix":"65aa1ef3d28f018c","mcp_get_code":{"code_sha256":"65aa1ef3d28f018c"}},{"arxiv_id":"2204.09656","arxiv_id_is_arxiv":true,"paper":"/paper/a-fast-post-training-pruning-framework-for","title":"A Fast Post-Training Pruning Framework for Transformers","date":"2022-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thennal10/fisher-nodes-merging","path":"fisher_nodes.py","file_url":"https://github.com/thennal10/fisher-nodes-merging/blob/HEAD/fisher_nodes.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, thennal10/fisher-nodes-merging when it was checked","code_sha256":"066b197393a76f6f","code_sha256_prefix":"066b197393a76f6f","mcp_get_code":{"code_sha256":"066b197393a76f6f"}},{"arxiv_id":"2203.06604","arxiv_id_is_arxiv":true,"paper":"/paper/masked-autoencoders-for-point-cloud-self","title":"Masked Autoencoders for Point Cloud Self-supervised Learning","date":"2022-03-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vvrpanda/exppoint-mae","path":"modules.py","file_url":"https://github.com/vvrpanda/exppoint-mae/blob/HEAD/modules.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, vvrpanda/exppoint-mae when it was checked","code_sha256":"2cf22e1fdc72ec7f","code_sha256_prefix":"2cf22e1fdc72ec7f","mcp_get_code":{"code_sha256":"2cf22e1fdc72ec7f"}},{"arxiv_id":"2111.06377","arxiv_id_is_arxiv":true,"paper":"/paper/masked-autoencoders-are-scalable-vision","title":"Masked Autoencoders Are Scalable Vision Learners","date":"2021-11-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DarshanDeshpande/jax-models","path":"jax_models/models/masked_autoencoder.py","file_url":"https://github.com/DarshanDeshpande/jax-models/blob/HEAD/jax_models/models/masked_autoencoder.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":"9ded34638fb55197","code_sha256_prefix":"9ded34638fb55197","mcp_get_code":{"code_sha256":"9ded34638fb55197"}},{"arxiv_id":"2106.05303","arxiv_id_is_arxiv":true,"paper":"/paper/explaining-time-series-predictions-with","title":"Explaining Time Series Predictions with Dynamic Masks","date":"2021-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JonathanCrabbe/Dynamask","path":"attribution/mask.py","file_url":"https://github.com/JonathanCrabbe/Dynamask/blob/HEAD/attribution/mask.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":"3d4daafa70c3ea88","code_sha256_prefix":"3d4daafa70c3ea88","mcp_get_code":{"code_sha256":"3d4daafa70c3ea88"}},{"arxiv_id":"2002.04264","arxiv_id_is_arxiv":true,"paper":"/paper/the-devil-is-in-the-channels-mutual-channel","title":"The Devil is in the Channels: Mutual-Channel Loss for Fine-Grained Image Classification","date":"2020-02-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dongliangchang/Mutual-Channel-Loss","path":"CUB-200-2011_ResNet18.py","file_url":"https://github.com/dongliangchang/Mutual-Channel-Loss/blob/HEAD/CUB-200-2011_ResNet18.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":"80779b7a31a59036","code_sha256_prefix":"80779b7a31a59036","mcp_get_code":{"code_sha256":"80779b7a31a59036"}},{"arxiv_id":"1608.08710","arxiv_id_is_arxiv":true,"paper":"/paper/pruning-filters-for-efficient-convnets","title":"Pruning Filters for Efficient ConvNets","date":"2016-08-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"he-y/filter-pruning-geometric-median","path":"VGG_cifar/pruning_cifar_vgg.py","file_url":"https://github.com/he-y/filter-pruning-geometric-median/blob/HEAD/VGG_cifar/pruning_cifar_vgg.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, he-y/filter-pruning-geometric-median when it was checked","code_sha256":"05b9fa9dad6ede01","code_sha256_prefix":"05b9fa9dad6ede01","mcp_get_code":{"code_sha256":"05b9fa9dad6ede01"}}],"record_sha256":"b0575a1c1f957f2c5d6dec72a37d4cf4e81ca1db06258c11e16b95cca9806870","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}