{"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/encoderimage","entry":"EncoderImage","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":9,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":7,"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":8,"n_samples_ran":6,"n_samples_constructed":4,"n_samples_ran_checked":6,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":9,"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":0,"ran":6,"unverified":2},"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":"2405.16996","arxiv_id_is_arxiv":true,"paper":"/paper/mitigating-noisy-correspondence-by","title":"Mitigating Noisy Correspondence by Geometrical Structure Consistency Learning","date":"2024-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MediaBrain-SJTU/GSC","path":"GSC+/model/SGRAF.py","file_url":"https://github.com/MediaBrain-SJTU/GSC/blob/HEAD/GSC%2B/model/SGRAF.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, MediaBrain-SJTU/GSC when it was checked","code_sha256":"6367f1b6c81b200c","code_sha256_prefix":"6367f1b6c81b200c","mcp_get_code":{"code_sha256":"6367f1b6c81b200c"}},{"arxiv_id":"2310.17468","arxiv_id_is_arxiv":true,"paper":"/paper/cross-modal-active-complementary-learning-1","title":"Cross-modal Active Complementary Learning with Self-refining Correspondence","date":"2023-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qinyang79/crcl","path":"CRCL_NeurIPS23/model/CRCL.py","file_url":"https://github.com/qinyang79/crcl/blob/HEAD/CRCL_NeurIPS23/model/CRCL.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, qinyang79/crcl when it was checked","code_sha256":"4075e94c929dd49b","code_sha256_prefix":"4075e94c929dd49b","mcp_get_code":{"code_sha256":"4075e94c929dd49b"}},{"arxiv_id":"2308.15512","arxiv_id_is_arxiv":true,"paper":"/paper/shatter-and-gather-learning-referring-image","title":"Shatter and Gather: Learning Referring Image Segmentation with Text Supervision","date":"2023-08-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kdwonn/SaG","path":"model/cross_modal_attention.py","file_url":"https://github.com/kdwonn/SaG/blob/HEAD/model/cross_modal_attention.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, kdwonn/SaG when it was checked","code_sha256":"5be60a5fd6a2851d","code_sha256_prefix":"5be60a5fd6a2851d","mcp_get_code":{"code_sha256":"5be60a5fd6a2851d"}},{"arxiv_id":"2303.12419","arxiv_id_is_arxiv":true,"paper":"/paper/bicro-noisy-correspondence-rectification-for","title":"BiCro: Noisy Correspondence Rectification for Multi-modality Data via Bi-directional Cross-modal Similarity Consistency","date":"2023-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xu5zhao/BiCro","path":"model.py","file_url":"https://github.com/xu5zhao/BiCro/blob/HEAD/model.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, xu5zhao/BiCro when it was checked","code_sha256":"bf08ee741b5ed5fb","code_sha256_prefix":"bf08ee741b5ed5fb","mcp_get_code":{"code_sha256":"bf08ee741b5ed5fb"}},{"arxiv_id":"2101.01368","arxiv_id_is_arxiv":true,"paper":"/paper/similarity-reasoning-and-filtration-for-image","title":"Similarity Reasoning and Filtration for Image-Text Matching","date":"2021-01-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Paranioar/SGRAF","path":"model.py","file_url":"https://github.com/Paranioar/SGRAF/blob/HEAD/model.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, Paranioar/SGRAF when it was checked","code_sha256":"c4d232eaafd32247","code_sha256_prefix":"c4d232eaafd32247","mcp_get_code":{"code_sha256":"c4d232eaafd32247"}},{"arxiv_id":"2010.03403","arxiv_id_is_arxiv":true,"paper":"/paper/universal-weighting-metric-learning-for-cross-1","title":"Universal Weighting Metric Learning for Cross-Modal Matching","date":"2020-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wayne980/PolyLoss","path":"model.py","file_url":"https://github.com/wayne980/PolyLoss/blob/HEAD/model.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":"07c90e643974e90d","code_sha256_prefix":"07c90e643974e90d","mcp_get_code":{"code_sha256":"07c90e643974e90d"}},{"arxiv_id":"1909.05506","arxiv_id_is_arxiv":true,"paper":"/paper/camp-cross-modal-adaptive-message-passing-for","title":"CAMP: Cross-Modal Adaptive Message Passing for Text-Image Retrieval","date":"2019-09-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZihaoWang-CV/CAMP_iccv19","path":"model.py","file_url":"https://github.com/ZihaoWang-CV/CAMP_iccv19/blob/HEAD/model.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":"2773ab044520c27b","code_sha256_prefix":"2773ab044520c27b","mcp_get_code":{"code_sha256":"2773ab044520c27b"}},{"arxiv_id":"1806.10348","arxiv_id_is_arxiv":true,"paper":"/paper/learning-visually-grounded-semantics-from","title":"Learning Visually-Grounded Semantics from Contrastive Adversarial Samples","date":"2018-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ExplorerFreda/VSE-C","path":"VSE_C/model.py","file_url":"https://github.com/ExplorerFreda/VSE-C/blob/HEAD/VSE_C/model.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":"16c5b66114f6387f","code_sha256_prefix":"16c5b66114f6387f","mcp_get_code":{"code_sha256":"16c5b66114f6387f"}},{"arxiv_id":"1803.08024","arxiv_id_is_arxiv":true,"paper":"/paper/stacked-cross-attention-for-image-text","title":"Stacked Cross Attention for Image-Text Matching","date":"2018-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"idejie/SCAN","path":"model.py","file_url":"https://github.com/idejie/SCAN/blob/HEAD/model.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":"07c90e643974e90d","code_sha256_prefix":"07c90e643974e90d","mcp_get_code":{"code_sha256":"07c90e643974e90d"}}],"record_sha256":"8bceb94043ead91a1b15fb88b03997c9e4bc4d309fd5d08b6f7edfa358ecf1b2","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}