{"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/extract-mask","entry":"extract_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":6,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":4,"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":4,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":1,"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":2,"ran_fixture":0,"ran":2,"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":"2407.02068","arxiv_id_is_arxiv":true,"paper":"/paper/lpvit-low-power-semi-structured-pruning-for","title":"LPViT: Low-Power Semi-structured Pruning for Vision Transformers","date":"2024-07-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Akimoto-Cris/LPViT","path":"pruning_utils.py","file_url":"https://github.com/Akimoto-Cris/LPViT/blob/HEAD/pruning_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Akimoto-Cris/LPViT when it was checked","code_sha256":"cccbdd267d4f7850","code_sha256_prefix":"cccbdd267d4f7850","mcp_get_code":{"code_sha256":"cccbdd267d4f7850"}},{"arxiv_id":"2310.18443","arxiv_id_is_arxiv":true,"paper":"/paper/towards-a-fuller-understanding-of-neurons-1","title":"Towards a fuller understanding of neurons with Clustered Compositional Explanations","date":"2023-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KRLGroup/Clustered-Compositional-Explanations","path":"src/mask_utils.py","file_url":"https://github.com/KRLGroup/Clustered-Compositional-Explanations/blob/HEAD/src/mask_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":"d9cbb5def766dac8","code_sha256_prefix":"d9cbb5def766dac8","mcp_get_code":{"code_sha256":"d9cbb5def766dac8"}},{"arxiv_id":"2206.04762","arxiv_id_is_arxiv":true,"paper":"/paper/data-efficient-double-win-lottery-tickets","title":"Data-Efficient Double-Win Lottery Tickets from Robust Pre-training","date":"2022-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vita-group/double-win-lth","path":"utils_pruning.py","file_url":"https://github.com/vita-group/double-win-lth/blob/HEAD/utils_pruning.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cccbdd267d4f7850","code_sha256_prefix":"cccbdd267d4f7850","mcp_get_code":{"code_sha256":"cccbdd267d4f7850"}},{"arxiv_id":"2111.00162","arxiv_id_is_arxiv":true,"paper":"/paper/you-are-caught-stealing-my-winning-lottery","title":"You are caught stealing my winning lottery ticket! Making a lottery ticket claim its ownership","date":"2021-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vita-group/no-stealing-lth","path":"embed_res20s_cifar10.py","file_url":"https://github.com/vita-group/no-stealing-lth/blob/HEAD/embed_res20s_cifar10.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0be9ebde5fff585f","code_sha256_prefix":"0be9ebde5fff585f","mcp_get_code":{"code_sha256":"0be9ebde5fff585f"}},{"arxiv_id":"2106.03225","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-lottery-ticket-finding-less-data-is","title":"Efficient Lottery Ticket Finding: Less Data is More","date":"2021-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VITA-Group/PrAC-LTH","path":"utils/pruner.py","file_url":"https://github.com/VITA-Group/PrAC-LTH/blob/HEAD/utils/pruner.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cccbdd267d4f7850","code_sha256_prefix":"cccbdd267d4f7850","mcp_get_code":{"code_sha256":"cccbdd267d4f7850"}},{"arxiv_id":"2007.05201","arxiv_id_is_arxiv":true,"paper":"/paper/rose-a-retinal-oct-angiography-vessel","title":"ROSE: A Retinal OCT-Angiography Vessel Segmentation Dataset and New Model","date":"2020-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"iMED-Lab/OCTA-Net-OCTA-Vessel-Segmentation-Network","path":"code/OCTA-Net/evaluation.py","file_url":"https://github.com/iMED-Lab/OCTA-Net-OCTA-Vessel-Segmentation-Network/blob/HEAD/code/OCTA-Net/evaluation.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":"32bab0b40aa74387","code_sha256_prefix":"32bab0b40aa74387","mcp_get_code":{"code_sha256":"32bab0b40aa74387"}}],"record_sha256":"9206136e4ca6752447b70b87586a3a1af09ffd66dbfd14d21551147f97eb511f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}