{"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/l1norm","entry":"l1norm","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":5,"n_papers_ran_instrument_only":9,"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":10,"n_samples_ran":10,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":7,"n_samples_unverified":0,"n_samples_fingerprinted":10,"n_places":17,"n_places_pointer_only":8,"n_places_pointer_only_link_open":4,"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":6,"ran_fixture":1,"ran":3,"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":"2503.10616","arxiv_id_is_arxiv":true,"paper":"/paper/ovtr-end-to-end-open-vocabulary-multiple","title":"OVTR: End-to-End Open-Vocabulary Multiple Object Tracking with Transformer","date":"2025-03-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jinyanglii/OVTR","path":"ovtr/models/fuse_modules.py","file_url":"https://github.com/jinyanglii/OVTR/blob/HEAD/ovtr/models/fuse_modules.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from Paranioar/SGRAF, and GitHub detected no licence in that repository when it was checked","code_sha256":"b943467457f9825d","code_sha256_prefix":"b943467457f9825d","mcp_get_code":{"code_sha256":"b943467457f9825d"}},{"arxiv_id":"2502.19128","arxiv_id_is_arxiv":true,"paper":"/paper/sca3d-enhancing-cross-modal-3d-retrieval-via","title":"SCA3D: Enhancing Cross-modal 3D Retrieval via 3D Shape and Caption Paired Data Augmentation","date":"2025-02-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"3dagentworld/sca3d","path":"SCA3D/models/model.py","file_url":"https://github.com/3dagentworld/sca3d/blob/HEAD/SCA3D/models/model.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":"a1e099b0f700be6a","code_sha256_prefix":"a1e099b0f700be6a","mcp_get_code":{"code_sha256":"a1e099b0f700be6a"}},{"arxiv_id":"2404.17273","arxiv_id_is_arxiv":true,"paper":"/paper/3shnet-boosting-image-sentence-retrieval-via","title":"3SHNet: Boosting Image-Sentence Retrieval via Visual Semantic-Spatial Self-Highlighting","date":"2024-04-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xurige1995/3shnet","path":"lib/Crossmodal_Fusion4_sm.py","file_url":"https://github.com/xurige1995/3shnet/blob/HEAD/lib/Crossmodal_Fusion4_sm.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from qinyang79/crcl, and GitHub detected no licence in that repository when it was checked","code_sha256":"9bf455ab09372ab4","code_sha256_prefix":"9bf455ab09372ab4","mcp_get_code":{"code_sha256":"9bf455ab09372ab4"}},{"arxiv_id":"2401.14159","arxiv_id_is_arxiv":true,"paper":"/paper/grounded-sam-assembling-open-world-models-for","title":"Grounded SAM: Assembling Open-World Models for Diverse Visual Tasks","date":"2024-01-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"idea-research/groundingdino","path":"groundingdino/models/GroundingDINO/fuse_modules.py","file_url":"https://github.com/idea-research/groundingdino/blob/HEAD/groundingdino/models/GroundingDINO/fuse_modules.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from Paranioar/SGRAF, and GitHub detected no licence in that repository when it was checked","code_sha256":"b943467457f9825d","code_sha256_prefix":"b943467457f9825d","mcp_get_code":{"code_sha256":"b943467457f9825d"}},{"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/SGRAF.py","file_url":"https://github.com/QinYang79/CRCL/blob/HEAD/CRCL_NeurIPS23/model/SGRAF.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, QinYang79/CRCL when it was checked","code_sha256":"b943467457f9825d","code_sha256_prefix":"b943467457f9825d","mcp_get_code":{"code_sha256":"b943467457f9825d"}},{"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_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, qinyang79/crcl when it was checked","code_sha256":"9bf455ab09372ab4","code_sha256_prefix":"9bf455ab09372ab4","mcp_get_code":{"code_sha256":"9bf455ab09372ab4"}},{"arxiv_id":"2310.08530","arxiv_id_is_arxiv":true,"paper":"/paper/unipose-detecting-any-keypoints","title":"X-Pose: Detecting Any Keypoints","date":"2023-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IDEA-Research/UniPose","path":"models/UniPose/fuse_modules.py","file_url":"https://github.com/IDEA-Research/UniPose/blob/HEAD/models/UniPose/fuse_modules.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, IDEA-Research/UniPose (NOASSERTION)","code_sha256":"a940274705e77acb","code_sha256_prefix":"a940274705e77acb","mcp_get_code":{"code_sha256":"a940274705e77acb"}},{"arxiv_id":"2308.07026","arxiv_id_is_arxiv":true,"paper":"/paper/advclip-downstream-agnostic-adversarial","title":"AdvCLIP: Downstream-agnostic Adversarial Examples in Multimodal Contrastive Learning","date":"2023-08-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cgcl-codes/advclip","path":"utils/model.py","file_url":"https://github.com/cgcl-codes/advclip/blob/HEAD/utils/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from qinyang79/crcl, and GitHub detected no licence in that repository when it was checked","code_sha256":"9bf455ab09372ab4","code_sha256_prefix":"9bf455ab09372ab4","mcp_get_code":{"code_sha256":"9bf455ab09372ab4"}},{"arxiv_id":"2110.00218","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-importance-of-gradients-for-detecting","title":"On the Importance of Gradients for Detecting Distributional Shifts in the Wild","date":"2021-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucidrains/gradnorm-pytorch","path":"gradnorm_pytorch/gradnorm_pytorch.py","file_url":"https://github.com/lucidrains/gradnorm-pytorch/blob/HEAD/gradnorm_pytorch/gradnorm_pytorch.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4f7e2211ea4ab0b6","code_sha256_prefix":"4f7e2211ea4ab0b6","mcp_get_code":{"code_sha256":"4f7e2211ea4ab0b6"}},{"arxiv_id":"2103.03206","arxiv_id_is_arxiv":true,"paper":"/paper/perceiver-general-perception-with-iterative","title":"Perceiver: General Perception with Iterative Attention","date":"2021-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucidrains/perceiver-pytorch","path":"perceiver_pytorch/perceiver_pytorch.py","file_url":"https://github.com/lucidrains/perceiver-pytorch/blob/HEAD/perceiver_pytorch/perceiver_pytorch.py","status":"ran_fixture","verification_level":1,"contract_check":"DEP_MISSING","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f1ef7aeee4ed2d74","code_sha256_prefix":"f1ef7aeee4ed2d74","mcp_get_code":{"code_sha256":"f1ef7aeee4ed2d74"}},{"arxiv_id":"2103.03206","arxiv_id_is_arxiv":true,"paper":"/paper/perceiver-general-perception-with-iterative","title":"Perceiver: General Perception with Iterative Attention","date":"2021-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucidrains/perceiver-pytorch","path":"perceiver_pytorch/perceiver_pytorch.py","file_url":"https://github.com/lucidrains/perceiver-pytorch/blob/HEAD/perceiver_pytorch/perceiver_pytorch.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"52649c5bdcbe1d0a","code_sha256_prefix":"52649c5bdcbe1d0a","mcp_get_code":{"code_sha256":"52649c5bdcbe1d0a"}},{"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_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, Paranioar/SGRAF when it was checked","code_sha256":"b943467457f9825d","code_sha256_prefix":"b943467457f9825d","mcp_get_code":{"code_sha256":"b943467457f9825d"}},{"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":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a1e099b0f700be6a","code_sha256_prefix":"a1e099b0f700be6a","mcp_get_code":{"code_sha256":"a1e099b0f700be6a"}},{"arxiv_id":"2006.15055","arxiv_id_is_arxiv":true,"paper":"/paper/object-centric-learning-with-slot-attention","title":"Object-Centric Learning with Slot Attention","date":"2020-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucidrains/slot-attention","path":"slot_attention/slot_attention.py","file_url":"https://github.com/lucidrains/slot-attention/blob/HEAD/slot_attention/slot_attention.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fdf3401cb2b8d73a","code_sha256_prefix":"fdf3401cb2b8d73a","mcp_get_code":{"code_sha256":"fdf3401cb2b8d73a"}},{"arxiv_id":"2006.15055","arxiv_id_is_arxiv":true,"paper":"/paper/object-centric-learning-with-slot-attention","title":"Object-Centric Learning with Slot Attention","date":"2020-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucidrains/slot-attention","path":"slot_attention/slot_attention.py","file_url":"https://github.com/lucidrains/slot-attention/blob/HEAD/slot_attention/slot_attention.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":"f3e9841706a261f0","code_sha256_prefix":"f3e9841706a261f0","mcp_get_code":{"code_sha256":"f3e9841706a261f0"}},{"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":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a1e099b0f700be6a","code_sha256_prefix":"a1e099b0f700be6a","mcp_get_code":{"code_sha256":"a1e099b0f700be6a"}},{"arxiv_id":"Diao_UniPT_Universal_Parallel_Tuning_for_Transfer_Learning_with_Efficient_Parameter_CVPR_2024_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Diao_UniPT_Universal_Parallel_Tuning_for_Transfer_Learning_with_Efficient_Parameter_CVPR_2024_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Paranioar/UniPT","path":"CLIP4Clip/modules/module_adapter.py","file_url":"https://github.com/Paranioar/UniPT/blob/HEAD/CLIP4Clip/modules/module_adapter.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6b05a61eb0c40e29","code_sha256_prefix":"6b05a61eb0c40e29","mcp_get_code":{"code_sha256":"6b05a61eb0c40e29"}}],"record_sha256":"680cbe71a43e1c1a0313e03026905c3c7ae0d5257f62809e52fdc64f224590ff","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}