{"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/translayer","entry":"TransLayer","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":8,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":5,"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":9,"n_samples_ran":5,"n_samples_constructed":4,"n_samples_ran_checked":5,"n_samples_instrument":0,"n_samples_unverified":4,"n_samples_fingerprinted":0,"n_places":9,"n_places_pointer_only":7,"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":5,"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":"2603.15774","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-15774","title":"Domain Adaptation Without the Compute Burden for Efficient Whole Slide Image Analysis","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"umarikkar/eWSI","path":"models/wsi_models.py","file_url":"https://github.com/umarikkar/eWSI/blob/HEAD/models/wsi_models.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, umarikkar/eWSI when it was checked","code_sha256":"941997963f9903ca","code_sha256_prefix":"941997963f9903ca","mcp_get_code":{"code_sha256":"941997963f9903ca"}},{"arxiv_id":"2407.03575","arxiv_id_is_arxiv":true,"paper":"/paper/dgr-mil-exploring-diverse-global","title":"DGR-MIL: Exploring Diverse Global Representation in Multiple Instance Learning for Whole Slide Image Classification","date":"2024-07-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ChongQingNoSubway/DGR-MIL","path":"models/dgrmil.py","file_url":"https://github.com/ChongQingNoSubway/DGR-MIL/blob/HEAD/models/dgrmil.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":"ba179bd06c67a0e3","code_sha256_prefix":"ba179bd06c67a0e3","mcp_get_code":{"code_sha256":"ba179bd06c67a0e3"}},{"arxiv_id":"2402.17228","arxiv_id_is_arxiv":true,"paper":"/paper/feature-re-embedding-towards-foundation-model","title":"Feature Re-Embedding: Towards Foundation Model-Level Performance in Computational Pathology","date":"2024-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DearCaat/RRT-MIL","path":"modules/rrt.py","file_url":"https://github.com/DearCaat/RRT-MIL/blob/HEAD/modules/rrt.py","status":"ran","verification_level":1,"contract_check":null,"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, DearCaat/RRT-MIL when it was checked","code_sha256":"3466debae668556f","code_sha256_prefix":"3466debae668556f","mcp_get_code":{"code_sha256":"3466debae668556f"}},{"arxiv_id":"2402.17228","arxiv_id_is_arxiv":true,"paper":"/paper/feature-re-embedding-towards-foundation-model","title":"Feature Re-Embedding: Towards Foundation Model-Level Performance in Computational Pathology","date":"2024-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dearcaat/mhim-mil","path":"modules/rrt.py","file_url":"https://github.com/dearcaat/mhim-mil/blob/HEAD/modules/rrt.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, dearcaat/mhim-mil when it was checked","code_sha256":"d1ab57dc28edeb86","code_sha256_prefix":"d1ab57dc28edeb86","mcp_get_code":{"code_sha256":"d1ab57dc28edeb86"}},{"arxiv_id":"2309.12855","arxiv_id_is_arxiv":true,"paper":"/paper/cross-modal-translation-and-alignment-for","title":"Cross-Modal Translation and Alignment for Survival Analysis","date":"2023-09-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ft-zhou-zzz/cmta","path":"models/cmta/network.py","file_url":"https://github.com/ft-zhou-zzz/cmta/blob/HEAD/models/cmta/network.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, ft-zhou-zzz/cmta when it was checked","code_sha256":"5ba794edf709fd58","code_sha256_prefix":"5ba794edf709fd58","mcp_get_code":{"code_sha256":"5ba794edf709fd58"}},{"arxiv_id":"2307.15254","arxiv_id_is_arxiv":true,"paper":"/paper/multiple-instance-learning-framework-with","title":"Multiple Instance Learning Framework with Masked Hard Instance Mining for Whole Slide Image Classification","date":"2023-07-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DearCaat/MHIM-MIL","path":"modules/mhim.py","file_url":"https://github.com/DearCaat/MHIM-MIL/blob/HEAD/modules/mhim.py","status":"ran","verification_level":1,"contract_check":null,"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, DearCaat/MHIM-MIL when it was checked","code_sha256":"ffd680dc515cfebb","code_sha256_prefix":"ffd680dc515cfebb","mcp_get_code":{"code_sha256":"ffd680dc515cfebb"}},{"arxiv_id":"2306.08330","arxiv_id_is_arxiv":true,"paper":"/paper/multimodal-optimal-transport-based-co","title":"Multimodal Optimal Transport-based Co-Attention Transformer with Global Structure Consistency for Survival Prediction","date":"2023-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JJ-ZHOU-Code/RobustMultiModel","path":"models/model_coattn.py","file_url":"https://github.com/JJ-ZHOU-Code/RobustMultiModel/blob/HEAD/models/model_coattn.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, JJ-ZHOU-Code/RobustMultiModel when it was checked","code_sha256":"22eac946d1b47bb1","code_sha256_prefix":"22eac946d1b47bb1","mcp_get_code":{"code_sha256":"22eac946d1b47bb1"}},{"arxiv_id":"2203.02688","arxiv_id_is_arxiv":true,"paper":"/paper/zoom-in-and-out-a-mixed-scale-triplet-network","title":"Zoom In and Out: A Mixed-scale Triplet Network for Camouflaged Object Detection","date":"2022-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lartpang/ZoomNet","path":"methods/zoomnet/zoomnet.py","file_url":"https://github.com/lartpang/ZoomNet/blob/HEAD/methods/zoomnet/zoomnet.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":"0fa380f44af066ff","code_sha256_prefix":"0fa380f44af066ff","mcp_get_code":{"code_sha256":"0fa380f44af066ff"}},{"arxiv_id":"1612.00593","arxiv_id_is_arxiv":true,"paper":"/paper/pointnet-deep-learning-on-point-sets-for-3d","title":"PointNet: Deep Learning on Point Sets for 3D Classification and Segmentation","date":"2016-12-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yanxp/PointNet","path":"model/pointnet.py","file_url":"https://github.com/yanxp/PointNet/blob/HEAD/model/pointnet.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, yanxp/PointNet when it was checked","code_sha256":"d22507edb8c91af0","code_sha256_prefix":"d22507edb8c91af0","mcp_get_code":{"code_sha256":"d22507edb8c91af0"}}],"record_sha256":"3222ae8e1fb41f89010069be88f9984470501dc8ea7f263ccfd9ad3beb981153","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}