{"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/allgather","entry":"AllGather","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":13,"n_papers_ran":11,"n_papers_ran_no_instrument_failure":11,"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":13,"n_samples_ran":11,"n_samples_constructed":10,"n_samples_ran_checked":11,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":2,"n_places":13,"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":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":11,"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":"2605.19374","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-19374","title":"Concept-Guided Noisy Negative Suppression for Zero-Shot Classification and Grounding of Chest X-Ray Findings","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"DopamineLcy/conns","path":"conns/loss.py","file_url":"https://github.com/DopamineLcy/conns/blob/HEAD/conns/loss.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, DopamineLcy/conns when it was checked","code_sha256":"2e136285a741a20a","code_sha256_prefix":"2e136285a741a20a","mcp_get_code":{"code_sha256":"2e136285a741a20a"}},{"arxiv_id":"2601.18190","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-18190","title":"Multi-Perspective Subimage CLIP with Keyword Guidance for Remote Sensing Image-Text Retrieval","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"Lcrucial1f/MPS-CLIP","path":"models/mpsclip.py","file_url":"https://github.com/Lcrucial1f/MPS-CLIP/blob/HEAD/models/mpsclip.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":"ca8a9f13e020ca92","code_sha256_prefix":"ca8a9f13e020ca92","mcp_get_code":{"code_sha256":"ca8a9f13e020ca92"}},{"arxiv_id":"2502.11401","arxiv_id_is_arxiv":true,"paper":"/paper/following-the-autoregressive-nature-of-llm","title":"Following the Autoregressive Nature of LLM Embeddings via Compression and Alignment","date":"2025-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TrustedLLM/AutoRegEmbed","path":"src/modeling/modeling_autoregembed.py","file_url":"https://github.com/TrustedLLM/AutoRegEmbed/blob/HEAD/src/modeling/modeling_autoregembed.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, TrustedLLM/AutoRegEmbed when it was checked","code_sha256":"953781d84ef8e8ee","code_sha256_prefix":"953781d84ef8e8ee","mcp_get_code":{"code_sha256":"953781d84ef8e8ee"}},{"arxiv_id":"2410.00263","arxiv_id_is_arxiv":true,"paper":"/paper/procedure-aware-surgical-video-language","title":"Procedure-Aware Surgical Video-language Pretraining with Hierarchical Knowledge Augmentation","date":"2024-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"camma-public/peskavlp","path":"codes/engines/engine_phase_video_hierarchy.py","file_url":"https://github.com/camma-public/peskavlp/blob/HEAD/codes/engines/engine_phase_video_hierarchy.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, camma-public/peskavlp when it was checked","code_sha256":"8ca1275e7e3d3105","code_sha256_prefix":"8ca1275e7e3d3105","mcp_get_code":{"code_sha256":"8ca1275e7e3d3105"}},{"arxiv_id":"2404.18253","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-remote-sensing-with-harmonized","title":"Efficient Remote Sensing with Harmonized Transfer Learning and Modality Alignment","date":"2024-04-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"seekerhuang/harma","path":"models/model_retrieval.py","file_url":"https://github.com/seekerhuang/harma/blob/HEAD/models/model_retrieval.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":"3d8d0c7edd3e4998","code_sha256_prefix":"3d8d0c7edd3e4998","mcp_get_code":{"code_sha256":"3d8d0c7edd3e4998"}},{"arxiv_id":"2310.14652","arxiv_id_is_arxiv":true,"paper":"/paper/invariant-feature-regularization-for-fair-1","title":"Invariant Feature Regularization for Fair Face Recognition","date":"2023-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"panasonicconnect/invreg","path":"utils/utils_invreg.py","file_url":"https://github.com/panasonicconnect/invreg/blob/HEAD/utils/utils_invreg.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":"1736503522b025e1","code_sha256_prefix":"1736503522b025e1","mcp_get_code":{"code_sha256":"1736503522b025e1"}},{"arxiv_id":"2310.12692","arxiv_id_is_arxiv":true,"paper":"/paper/representation-learning-via-consistent-2","title":"Representation Learning via Consistent Assignment of Views over Random Partitions","date":"2023-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sthalles/carp","path":"modules/carp_loss.py","file_url":"https://github.com/sthalles/carp/blob/HEAD/modules/carp_loss.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, sthalles/carp when it was checked","code_sha256":"b72b086ec0bbd4c5","code_sha256_prefix":"b72b086ec0bbd4c5","mcp_get_code":{"code_sha256":"b72b086ec0bbd4c5"}},{"arxiv_id":"2308.00951","arxiv_id_is_arxiv":true,"paper":"/paper/from-sparse-to-soft-mixtures-of-experts","title":"From Sparse to Soft Mixtures of Experts","date":"2023-08-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucidrains/soft-moe-pytorch","path":"soft_moe_pytorch/soft_moe.py","file_url":"https://github.com/lucidrains/soft-moe-pytorch/blob/HEAD/soft_moe_pytorch/soft_moe.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":"f86d2cc1b619c3a7","code_sha256_prefix":"f86d2cc1b619c3a7","mcp_get_code":{"code_sha256":"f86d2cc1b619c3a7"}},{"arxiv_id":"2305.17530","arxiv_id_is_arxiv":true,"paper":"/paper/pumer-pruning-and-merging-tokens-for","title":"PuMer: Pruning and Merging Tokens for Efficient Vision Language Models","date":"2023-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"csarron/pumer","path":"src/pumer/model/pruner.py","file_url":"https://github.com/csarron/pumer/blob/HEAD/src/pumer/model/pruner.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":"01294f03cdd7b3b4","code_sha256_prefix":"01294f03cdd7b3b4","mcp_get_code":{"code_sha256":"01294f03cdd7b3b4"}},{"arxiv_id":"2303.14865","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-multimodal-representation-in","title":"Revisiting Multimodal Representation in Contrastive Learning: From Patch and Token Embeddings to Finite Discrete Tokens","date":"2023-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuxiaochen1103/fdt","path":"prototype/model/clip_fdt.py","file_url":"https://github.com/yuxiaochen1103/fdt/blob/HEAD/prototype/model/clip_fdt.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":"c64326f5874bc072","code_sha256_prefix":"c64326f5874bc072","mcp_get_code":{"code_sha256":"c64326f5874bc072"}},{"arxiv_id":"2303.14369","arxiv_id_is_arxiv":true,"paper":"/paper/video-text-as-game-players-hierarchical","title":"Video-Text as Game Players: Hierarchical Banzhaf Interaction for Cross-Modal Representation Learning","date":"2023-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jpthu17/dicosa","path":"tvr/models/modeling.py","file_url":"https://github.com/jpthu17/dicosa/blob/HEAD/tvr/models/modeling.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":"72bb773921596f80","code_sha256_prefix":"72bb773921596f80","mcp_get_code":{"code_sha256":"72bb773921596f80"}},{"arxiv_id":"2204.02311","arxiv_id_is_arxiv":true,"paper":"/paper/palm-scaling-language-modeling-with-pathways-1","title":"PaLM: Scaling Language Modeling with Pathways","date":"2022-04-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucidrains/CoCa-pytorch","path":"coca_pytorch/coca_pytorch.py","file_url":"https://github.com/lucidrains/CoCa-pytorch/blob/HEAD/coca_pytorch/coca_pytorch.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":"54e85922a73fb785","code_sha256_prefix":"54e85922a73fb785","mcp_get_code":{"code_sha256":"54e85922a73fb785"}},{"arxiv_id":"2104.13963","arxiv_id_is_arxiv":true,"paper":"/paper/semi-supervised-learning-of-visual-features","title":"Semi-Supervised Learning of Visual Features by Non-Parametrically Predicting View Assignments with Support Samples","date":"2021-04-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/suncet","path":"src/losses.py","file_url":"https://github.com/facebookresearch/suncet/blob/HEAD/src/losses.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":"f68fac75925a8996","code_sha256_prefix":"f68fac75925a8996","mcp_get_code":{"code_sha256":"f68fac75925a8996"}}],"record_sha256":"c9731bbd33ea267188ad26cb8ea867b51f0c2a31b4e2fb9d3746d329eac492e0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}