{"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/distributed-sinkhorn","entry":"distributed_sinkhorn","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":17,"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":14,"n_samples_ran":10,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":6,"n_samples_unverified":4,"n_samples_fingerprinted":2,"n_places":18,"n_places_pointer_only":10,"n_places_pointer_only_link_open":2,"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":5,"ran_fixture":1,"ran":4,"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":"2605.19289","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-19289","title":"What Makes Synthetic Data Effective in Image Segmentation","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"zhang0jhon/SENSE","path":"sense_dpt.py","file_url":"https://github.com/zhang0jhon/SENSE/blob/HEAD/sense_dpt.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zhang0jhon/SENSE when it was checked","code_sha256":"c7953025c1e3b82c","code_sha256_prefix":"c7953025c1e3b82c","mcp_get_code":{"code_sha256":"c7953025c1e3b82c"}},{"arxiv_id":"2508.11265","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2508-11265","title":"Domain-aware Category-level Geometry Learning Segmentation for 3D Point Clouds","date":null,"month_inferred_from_arxiv_id":"2025-08","title_source":"syntology","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"be669c7787c0a93c","code_sha256_prefix":"be669c7787c0a93c","mcp_get_code":{"code_sha256":"be669c7787c0a93c"}},{"arxiv_id":"2505.24693","arxiv_id_is_arxiv":true,"paper":"/paper/conformal-prediction-for-zero-shot-models","title":"Conformal Prediction for Zero-Shot Models","date":"2025-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jusiro/CLIP-Conformal","path":"solvers/transductive/confot.py","file_url":"https://github.com/jusiro/CLIP-Conformal/blob/HEAD/solvers/transductive/confot.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, jusiro/CLIP-Conformal when it was checked","code_sha256":"774cb5ff0c9b4941","code_sha256_prefix":"774cb5ff0c9b4941","mcp_get_code":{"code_sha256":"774cb5ff0c9b4941"}},{"arxiv_id":"2502.06501","arxiv_id_is_arxiv":true,"paper":"/paper/learning-clustering-based-prototypes-for","title":"Learning Clustering-based Prototypes for Compositional Zero-shot Learning","date":"2025-02-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"quhongyu/cluspro","path":"cluspro.py","file_url":"https://github.com/quhongyu/cluspro/blob/HEAD/cluspro.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, quhongyu/cluspro when it was checked","code_sha256":"be669c7787c0a93c","code_sha256_prefix":"be669c7787c0a93c","mcp_get_code":{"code_sha256":"be669c7787c0a93c"}},{"arxiv_id":"2501.05635","arxiv_id_is_arxiv":true,"paper":"/paper/enhancing-unsupervised-graph-few-shot","title":"Enhancing Unsupervised Graph Few-shot Learning via Set Functions and Optimal Transport","date":"2025-01-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"keaml-jlu/star","path":"validation_concatenation.py","file_url":"https://github.com/keaml-jlu/star/blob/HEAD/validation_concatenation.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":"7a2650bf070523dd","code_sha256_prefix":"7a2650bf070523dd","mcp_get_code":{"code_sha256":"7a2650bf070523dd"}},{"arxiv_id":"2501.05635","arxiv_id_is_arxiv":true,"paper":"/paper/enhancing-unsupervised-graph-few-shot","title":"Enhancing Unsupervised Graph Few-shot Learning via Set Functions and Optimal Transport","date":"2025-01-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"keaml-jlu/star","path":"data_split.py","file_url":"https://github.com/keaml-jlu/star/blob/HEAD/data_split.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":"9ad49972980faced","code_sha256_prefix":"9ad49972980faced","mcp_get_code":{"code_sha256":"9ad49972980faced"}},{"arxiv_id":"2407.05862","arxiv_id_is_arxiv":true,"paper":"/paper/bringing-masked-autoencoders-explicit","title":"Bringing Masked Autoencoders Explicit Contrastive Properties for Point Cloud Self-Supervised Learning","date":"2024-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amazingren/point-cmae","path":"utils/loss_msn.py","file_url":"https://github.com/amazingren/point-cmae/blob/HEAD/utils/loss_msn.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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 facebookresearch/msn, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"7478f8e64cee8964","code_sha256_prefix":"7478f8e64cee8964","mcp_get_code":{"code_sha256":"7478f8e64cee8964"}},{"arxiv_id":"2306.07483","arxiv_id_is_arxiv":true,"paper":"/paper/semi-supervised-learning-made-simple-with-1","title":"Semi-supervised learning made simple with self-supervised clustering","date":"2023-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pietroastolfi/suave-daino","path":"suave/main_suave.py","file_url":"https://github.com/pietroastolfi/suave-daino/blob/HEAD/suave/main_suave.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, pietroastolfi/suave-daino (NOASSERTION)","code_sha256":"e886904d62004eb3","code_sha256_prefix":"e886904d62004eb3","mcp_get_code":{"code_sha256":"e886904d62004eb3"}},{"arxiv_id":"2302.10586","arxiv_id_is_arxiv":true,"paper":"/paper/diffusion-models-and-semi-supervised-learners-1","title":"Diffusion Models and Semi-Supervised Learners Benefit Mutually with Few Labels","date":"2023-02-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ML-GSAI/DPT","path":"src/losses.py","file_url":"https://github.com/ML-GSAI/DPT/blob/HEAD/src/losses.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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 facebookresearch/msn, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"7478f8e64cee8964","code_sha256_prefix":"7478f8e64cee8964","mcp_get_code":{"code_sha256":"7478f8e64cee8964"}},{"arxiv_id":"2210.01784","arxiv_id_is_arxiv":true,"paper":"/paper/coarse3d-class-prototypes-for-contrastive","title":"COARSE3D: Class-Prototypes for Contrastive Learning in Weakly-Supervised 3D Point Cloud Segmentation","date":"2022-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cv-rits/coarse3d","path":"pc_processor/models/sinkhorn.py","file_url":"https://github.com/cv-rits/coarse3d/blob/HEAD/pc_processor/models/sinkhorn.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":"c64374ec52225f59","code_sha256_prefix":"c64374ec52225f59","mcp_get_code":{"code_sha256":"c64374ec52225f59"}},{"arxiv_id":"2209.07383","arxiv_id_is_arxiv":true,"paper":"/paper/visual-recognition-with-deep-nearest","title":"Visual Recognition with Deep Nearest Centroids","date":"2022-09-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chenghan111/dnc","path":"DNC_classification/mmcls/models/heads/SubCentroids_head_Formal.py","file_url":"https://github.com/chenghan111/dnc/blob/HEAD/DNC_classification/mmcls/models/heads/SubCentroids_head_Formal.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a9f32f28a6eb26c1","code_sha256_prefix":"a9f32f28a6eb26c1","mcp_get_code":{"code_sha256":"a9f32f28a6eb26c1"}},{"arxiv_id":"2112.08132","arxiv_id_is_arxiv":true,"paper":"/paper/improving-self-supervised-learning-with-2","title":"Improving Self-supervised Learning with Automated Unsupervised Outlier Arbitration","date":"2021-12-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ssl-codelab/uota","path":"main_uota.py","file_url":"https://github.com/ssl-codelab/uota/blob/HEAD/main_uota.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, ssl-codelab/uota when it was checked","code_sha256":"5f8b63dcbe021398","code_sha256_prefix":"5f8b63dcbe021398","mcp_get_code":{"code_sha256":"5f8b63dcbe021398"}},{"arxiv_id":"2106.09645","arxiv_id_is_arxiv":true,"paper":"/paper/prototypical-graph-contrastive-learning","title":"Prototypical Graph Contrastive Learning","date":"2021-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ha-lins/pgcl","path":"unsupervised_TU/pgcl_main.py","file_url":"https://github.com/ha-lins/pgcl/blob/HEAD/unsupervised_TU/pgcl_main.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":"a5ce8d6b2c6af43f","code_sha256_prefix":"a5ce8d6b2c6af43f","mcp_get_code":{"code_sha256":"a5ce8d6b2c6af43f"}},{"arxiv_id":"2105.13353","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-activity-segmentation-by-joint","title":"Unsupervised Action Segmentation by Joint Representation Learning and Online Clustering","date":"2021-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"trquhuytin/TOT-CVPR22","path":"ute/models/training_embed.py","file_url":"https://github.com/trquhuytin/TOT-CVPR22/blob/HEAD/ute/models/training_embed.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":"2afdf62a2f77e421","code_sha256_prefix":"2afdf62a2f77e421","mcp_get_code":{"code_sha256":"2afdf62a2f77e421"}},{"arxiv_id":"2105.01289","arxiv_id_is_arxiv":true,"paper":"/paper/representation-learning-for-clustering-via","title":"Representation Learning for Clustering via Building Consensus","date":"2021-05-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JayanthRR/ConCURL_NCE","path":"losses.py","file_url":"https://github.com/JayanthRR/ConCURL_NCE/blob/HEAD/losses.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":"2afdf62a2f77e421","code_sha256_prefix":"2afdf62a2f77e421","mcp_get_code":{"code_sha256":"2afdf62a2f77e421"}},{"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/msn","path":"src/losses.py","file_url":"https://github.com/facebookresearch/msn/blob/HEAD/src/losses.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","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, facebookresearch/msn (NOASSERTION)","code_sha256":"7478f8e64cee8964","code_sha256_prefix":"7478f8e64cee8964","mcp_get_code":{"code_sha256":"7478f8e64cee8964"}},{"arxiv_id":"1911.05371","arxiv_id_is_arxiv":true,"paper":"/paper/self-labelling-via-simultaneous-clustering-1","title":"Self-labelling via simultaneous clustering and representation learning","date":"2019-11-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hsfzxjy/swavx","path":"main_swav.py","file_url":"https://github.com/hsfzxjy/swavx/blob/HEAD/main_swav.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, hsfzxjy/swavx (NOASSERTION)","code_sha256":"103cb98c938400f1","code_sha256_prefix":"103cb98c938400f1","mcp_get_code":{"code_sha256":"103cb98c938400f1"}},{"arxiv_id":"2024.acl-long.502","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2024.acl-long.502","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"GJZhang2866/HMPEAE","path":"sinkhorn.py","file_url":"https://github.com/GJZhang2866/HMPEAE/blob/HEAD/sinkhorn.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":"f4e1ca92be031891","code_sha256_prefix":"f4e1ca92be031891","mcp_get_code":{"code_sha256":"f4e1ca92be031891"}}],"record_sha256":"a309b3aa1d1152370c688724e5ef66fa4d3c47e4974fc7f6cf3fed4d85ae5c07","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}