{"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/sinkhorn-2","entry":"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":5,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":2,"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":3,"n_samples_constructed":1,"n_samples_ran_checked":2,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":3,"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":1,"ran":2,"unverified":1},"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":"2310.13397","arxiv_id_is_arxiv":true,"paper":"/paper/equivariant-deep-weight-space-alignment","title":"Equivariant Deep Weight Space Alignment","date":"2023-10-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AvivNavon/deep-align","path":"deepalign/sinkhorn.py","file_url":"https://github.com/AvivNavon/deep-align/blob/HEAD/deepalign/sinkhorn.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":"25782a75daea5300","code_sha256_prefix":"25782a75daea5300","mcp_get_code":{"code_sha256":"25782a75daea5300"}},{"arxiv_id":"2210.01253","arxiv_id_is_arxiv":true,"paper":"/paper/prompt-learning-with-optimal-transport-for","title":"PLOT: Prompt Learning with Optimal Transport for Vision-Language Models","date":"2022-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CHENGY12/PLOT","path":"plot-adapter/utils.py","file_url":"https://github.com/CHENGY12/PLOT/blob/HEAD/plot-adapter/utils.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":"9ba2e45e5b1df7f4","code_sha256_prefix":"9ba2e45e5b1df7f4","mcp_get_code":{"code_sha256":"9ba2e45e5b1df7f4"}},{"arxiv_id":"2205.06688","arxiv_id_is_arxiv":true,"paper":"/paper/a-unified-framework-for-implicit-sinkhorn","title":"A Unified Framework for Implicit Sinkhorn Differentiation","date":"2022-05-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"marvin-eisenberger/implicit-sinkhorn","path":"sinkhorn/sinkhorn.py","file_url":"https://github.com/marvin-eisenberger/implicit-sinkhorn/blob/HEAD/sinkhorn/sinkhorn.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, marvin-eisenberger/implicit-sinkhorn when it was checked","code_sha256":"c481a27d6492ca1e","code_sha256_prefix":"c481a27d6492ca1e","mcp_get_code":{"code_sha256":"c481a27d6492ca1e"}},{"arxiv_id":"2112.04016","arxiv_id_is_arxiv":true,"paper":"/paper/deepface-emd-re-ranking-using-patch-wise","title":"DeepFace-EMD: Re-ranking Using Patch-wise Earth Mover's Distance Improves Out-Of-Distribution Face Identification","date":"2021-12-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anguyen8/deepface-emd","path":"utils/emd.py","file_url":"https://github.com/anguyen8/deepface-emd/blob/HEAD/utils/emd.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, anguyen8/deepface-emd when it was checked","code_sha256":"6e35f0f82a513888","code_sha256_prefix":"6e35f0f82a513888","mcp_get_code":{"code_sha256":"6e35f0f82a513888"}},{"arxiv_id":"2108.05889","arxiv_id_is_arxiv":true,"paper":"/paper/towards-interpretable-deep-metric-learning","title":"Towards Interpretable Deep Metric Learning with Structural Matching","date":"2021-08-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wl-zhao/diml","path":"utilities/diml.py","file_url":"https://github.com/wl-zhao/diml/blob/HEAD/utilities/diml.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, wl-zhao/diml when it was checked","code_sha256":"6e35f0f82a513888","code_sha256_prefix":"6e35f0f82a513888","mcp_get_code":{"code_sha256":"6e35f0f82a513888"}}],"record_sha256":"3c2d0da27219ce4006244c9a1cb3d285cc16f0401841708cf189eb86ac3a6ee4","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}