{"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/elu-feature-map","entry":"elu_feature_map","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":14,"n_papers_ran":14,"n_papers_ran_no_instrument_failure":14,"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":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":4,"n_places":16,"n_places_pointer_only":4,"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":1,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":1,"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":"2501.09688","arxiv_id_is_arxiv":true,"paper":"/paper/fine-grained-image-text-correspondence-with","title":"Fine-Grained Image-Text Correspondence with Cost Aggregation for Open-Vocabulary Part Segmentation","date":"2025-01-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kaist-cvml/part-catseg","path":"baselines/modeling/transformer/obj_part_cat_seg_model.py","file_url":"https://github.com/kaist-cvml/part-catseg/blob/HEAD/baselines/modeling/transformer/obj_part_cat_seg_model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0d5505bd782b4a89","code_sha256_prefix":"0d5505bd782b4a89","mcp_get_code":{"code_sha256":"0d5505bd782b4a89"}},{"arxiv_id":"2409.19720","arxiv_id_is_arxiv":true,"paper":"/paper/fast-a-dual-tier-few-shot-learning-paradigm","title":"FAST: A Dual-tier Few-Shot Learning Paradigm for Whole Slide Image Classification","date":"2024-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fukexue/FAST","path":"models/linear_attention.py","file_url":"https://github.com/fukexue/FAST/blob/HEAD/models/linear_attention.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, fukexue/FAST when it was checked","code_sha256":"0d5505bd782b4a89","code_sha256_prefix":"0d5505bd782b4a89","mcp_get_code":{"code_sha256":"0d5505bd782b4a89"}},{"arxiv_id":"2409.19720","arxiv_id_is_arxiv":true,"paper":"/paper/fast-a-dual-tier-few-shot-learning-paradigm","title":"FAST: A Dual-tier Few-Shot Learning Paradigm for Whole Slide Image Classification","date":"2024-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fukexue/FAST","path":"FAST_CAMELYON_CLIP_Train.py","file_url":"https://github.com/fukexue/FAST/blob/HEAD/FAST_CAMELYON_CLIP_Train.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, fukexue/FAST when it was checked","code_sha256":"da63f97238fd433d","code_sha256_prefix":"da63f97238fd433d","mcp_get_code":{"code_sha256":"da63f97238fd433d"}},{"arxiv_id":"2409.19720","arxiv_id_is_arxiv":true,"paper":"/paper/fast-a-dual-tier-few-shot-learning-paradigm","title":"FAST: A Dual-tier Few-Shot Learning Paradigm for Whole Slide Image Classification","date":"2024-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fukexue/FAST","path":"FAST_TCGA_RENAL_CLIP_Train.py","file_url":"https://github.com/fukexue/FAST/blob/HEAD/FAST_TCGA_RENAL_CLIP_Train.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, fukexue/FAST when it was checked","code_sha256":"660bb1c1cfb15688","code_sha256_prefix":"660bb1c1cfb15688","mcp_get_code":{"code_sha256":"660bb1c1cfb15688"}},{"arxiv_id":"2403.00592","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-few-shot-3d-point-cloud-semantic","title":"Rethinking Few-shot 3D Point Cloud Semantic Segmentation","date":"2024-03-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZhaochongAn/COSeg","path":"model/common.py","file_url":"https://github.com/ZhaochongAn/COSeg/blob/HEAD/model/common.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, ZhaochongAn/COSeg when it was checked","code_sha256":"0d5505bd782b4a89","code_sha256_prefix":"0d5505bd782b4a89","mcp_get_code":{"code_sha256":"0d5505bd782b4a89"}},{"arxiv_id":"2311.15537","arxiv_id_is_arxiv":true,"paper":"/paper/sed-a-simple-encoder-decoder-for-open","title":"SED: A Simple Encoder-Decoder for Open-Vocabulary Semantic Segmentation","date":"2023-11-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xb534/sed","path":"sed/modeling/transformer/model.py","file_url":"https://github.com/xb534/sed/blob/HEAD/sed/modeling/transformer/model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0d5505bd782b4a89","code_sha256_prefix":"0d5505bd782b4a89","mcp_get_code":{"code_sha256":"0d5505bd782b4a89"}},{"arxiv_id":"2303.11797","arxiv_id_is_arxiv":true,"paper":"/paper/cat-seg-cost-aggregation-for-open-vocabulary","title":"CAT-Seg: Cost Aggregation for Open-Vocabulary Semantic Segmentation","date":"2023-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KU-CVLAB/CAT-Seg","path":"cat_seg/modeling/transformer/model.py","file_url":"https://github.com/KU-CVLAB/CAT-Seg/blob/HEAD/cat_seg/modeling/transformer/model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0d5505bd782b4a89","code_sha256_prefix":"0d5505bd782b4a89","mcp_get_code":{"code_sha256":"0d5505bd782b4a89"}},{"arxiv_id":"2204.10144","arxiv_id_is_arxiv":true,"paper":"/paper/a-case-for-using-rotation-invariant-features","title":"A case for using rotation invariant features in state of the art feature matchers","date":"2022-04-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"georg-bn/se2-loftr","path":"src/loftr/loftr_module/linear_attention.py","file_url":"https://github.com/georg-bn/se2-loftr/blob/HEAD/src/loftr/loftr_module/linear_attention.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0d5505bd782b4a89","code_sha256_prefix":"0d5505bd782b4a89","mcp_get_code":{"code_sha256":"0d5505bd782b4a89"}},{"arxiv_id":"2203.10981","arxiv_id_is_arxiv":true,"paper":"/paper/monodtr-monocular-3d-object-detection-with","title":"MonoDTR: Monocular 3D Object Detection with Depth-Aware Transformer","date":"2022-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kuanchihhuang/monodtr","path":"visualDet3D/networks/detectors/dtr.py","file_url":"https://github.com/kuanchihhuang/monodtr/blob/HEAD/visualDet3D/networks/detectors/dtr.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0d5505bd782b4a89","code_sha256_prefix":"0d5505bd782b4a89","mcp_get_code":{"code_sha256":"0d5505bd782b4a89"}},{"arxiv_id":"2203.09645","arxiv_id_is_arxiv":true,"paper":"/paper/matchformer-interleaving-attention-in","title":"MatchFormer: Interleaving Attention in Transformers for Feature Matching","date":"2022-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jamycheung/matchformer","path":"model/backbone/match_LA_large.py","file_url":"https://github.com/jamycheung/matchformer/blob/HEAD/model/backbone/match_LA_large.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0d5505bd782b4a89","code_sha256_prefix":"0d5505bd782b4a89","mcp_get_code":{"code_sha256":"0d5505bd782b4a89"}},{"arxiv_id":"2104.00680","arxiv_id_is_arxiv":true,"paper":"/paper/loftr-detector-free-local-feature-matching","title":"LoFTR: Detector-Free Local Feature Matching with Transformers","date":"2021-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kolkir/coarse_loftr_trt","path":"loftr/loftr.py","file_url":"https://github.com/kolkir/coarse_loftr_trt/blob/HEAD/loftr/loftr.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0d5505bd782b4a89","code_sha256_prefix":"0d5505bd782b4a89","mcp_get_code":{"code_sha256":"0d5505bd782b4a89"}},{"arxiv_id":"aaai_25158","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_25158","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"transvcl/TransVCL","path":"transvcl/models/linear_attention.py","file_url":"https://github.com/transvcl/TransVCL/blob/HEAD/transvcl/models/linear_attention.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0d5505bd782b4a89","code_sha256_prefix":"0d5505bd782b4a89","mcp_get_code":{"code_sha256":"0d5505bd782b4a89"}},{"arxiv_id":"Zhu_SkySense-O_Towards_Open-World_Remote_Sensing_Interpretation_with_Vision-Centric_Visual-Language_Modeling_CVPR_2025_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Zhu_SkySense-O_Towards_Open-World_Remote_Sensing_Interpretation_with_Vision-Centric_Visual-Language_Modeling_CVPR_2025_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"zqcrafts/SkySense-O","path":"skysense_o/modeling/heads/visual_decoder.py","file_url":"https://github.com/zqcrafts/SkySense-O/blob/HEAD/skysense_o/modeling/heads/visual_decoder.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0d5505bd782b4a89","code_sha256_prefix":"0d5505bd782b4a89","mcp_get_code":{"code_sha256":"0d5505bd782b4a89"}},{"arxiv_id":"Zhang_DeMatch_Deep_Decomposition_of_Motion_Field_for_Two-View_Correspondence_Learning_CVPR_2024_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Zhang_DeMatch_Deep_Decomposition_of_Motion_Field_for_Two-View_Correspondence_Learning_CVPR_2024_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"SuhZhang/DeMatch","path":"core/dematch.py","file_url":"https://github.com/SuhZhang/DeMatch/blob/HEAD/core/dematch.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":"2b010ac2650d7557","code_sha256_prefix":"2b010ac2650d7557","mcp_get_code":{"code_sha256":"2b010ac2650d7557"}},{"arxiv_id":"Xie_SED_A_Simple_Encoder-Decoder_for_Open-Vocabulary_Semantic_Segmentation_CVPR_2024_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Xie_SED_A_Simple_Encoder-Decoder_for_Open-Vocabulary_Semantic_Segmentation_CVPR_2024_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"xb534/SED","path":"sed/modeling/transformer/model.py","file_url":"https://github.com/xb534/SED/blob/HEAD/sed/modeling/transformer/model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0d5505bd782b4a89","code_sha256_prefix":"0d5505bd782b4a89","mcp_get_code":{"code_sha256":"0d5505bd782b4a89"}},{"arxiv_id":"Ren_VolRecon_Volume_Rendering_of_Signed_Ray_Distance_Functions_for_Generalizable_CVPR_2023_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Ren_VolRecon_Volume_Rendering_of_Signed_Ray_Distance_Functions_for_Generalizable_CVPR_2023_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"IVRL/VolRecon","path":"code/attention/linear_attention.py","file_url":"https://github.com/IVRL/VolRecon/blob/HEAD/code/attention/linear_attention.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0d5505bd782b4a89","code_sha256_prefix":"0d5505bd782b4a89","mcp_get_code":{"code_sha256":"0d5505bd782b4a89"}}],"record_sha256":"b5fd9c06d9dca1b8bd8aa3a62203834db9edd5fca19346ab3f32df388adb9827","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}