{"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/undo-preprocess","entry":"undo_preprocess","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":5,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":3,"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":2,"n_places":5,"n_places_pointer_only":0,"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":"2605.02167","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-02167","title":"Manifold-Aligned Guided Integrated Gradients for Reliable Feature Attribution","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"leekwoon/ma-gig","path":"cleanig/utils.py","file_url":"https://github.com/leekwoon/ma-gig/blob/HEAD/cleanig/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bb3251b543cfa179","code_sha256_prefix":"bb3251b543cfa179","mcp_get_code":{"code_sha256":"bb3251b543cfa179"}},{"arxiv_id":"2503.01087","arxiv_id_is_arxiv":true,"paper":"/paper/rashomon-sets-for-prototypical-part-networks","title":"Rashomon Sets for Prototypical-Part Networks: Editing Interpretable Models in Real-Time","date":"2025-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jdonnelly36/proto-rset","path":"protopnet/preprocess.py","file_url":"https://github.com/jdonnelly36/proto-rset/blob/HEAD/protopnet/preprocess.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":"cd83e2e18adb6519","code_sha256_prefix":"cd83e2e18adb6519","mcp_get_code":{"code_sha256":"cd83e2e18adb6519"}},{"arxiv_id":"2410.20722","arxiv_id_is_arxiv":true,"paper":"/paper/interpretable-image-classification-with-1","title":"Interpretable Image Classification with Adaptive Prototype-based Vision Transformers","date":"2024-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Henrymachiyu/ProtoViT","path":"preprocess.py","file_url":"https://github.com/Henrymachiyu/ProtoViT/blob/HEAD/preprocess.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"efb86a8611f14f72","code_sha256_prefix":"efb86a8611f14f72","mcp_get_code":{"code_sha256":"efb86a8611f14f72"}},{"arxiv_id":"1906.10651","arxiv_id_is_arxiv":true,"paper":"/paper/interpretable-image-recognition-with","title":"Interpretable Image Recognition with Hierarchical Prototypes","date":"2019-06-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"peterbhase/interpretable-image","path":"HPnet/preprocess.py","file_url":"https://github.com/peterbhase/interpretable-image/blob/HEAD/HPnet/preprocess.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":"21c841f94efb412b","code_sha256_prefix":"21c841f94efb412b","mcp_get_code":{"code_sha256":"21c841f94efb412b"}},{"arxiv_id":"1606.00915","arxiv_id_is_arxiv":true,"paper":"/paper/deeplab-semantic-image-segmentation-with-deep","title":"DeepLab: Semantic Image Segmentation with Deep Convolutional Nets, Atrous Convolution, and Fully Connected CRFs","date":"2016-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eceo-epfl/scaleprotoseg","path":"preprocess.py","file_url":"https://github.com/eceo-epfl/scaleprotoseg/blob/HEAD/preprocess.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"efb86a8611f14f72","code_sha256_prefix":"efb86a8611f14f72","mcp_get_code":{"code_sha256":"efb86a8611f14f72"}}],"record_sha256":"c3312ab51c0ac9ddda0eed3bb77fe515bc1c9a631951cbec00317240e1296c70","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}