{"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/wasserstein-distance","entry":"wasserstein_distance","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":11,"n_papers_ran":10,"n_papers_ran_no_instrument_failure":7,"n_papers_ran_instrument_only":3,"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":9,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":5,"n_places":11,"n_places_pointer_only":6,"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":1,"ran_fixture":0,"ran":7,"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":"2602.02072","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-02072","title":"Calibrating Adaptive Smoothing Methods for Freeway Traffic Reconstruction","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"trafficwaves/ASMx","path":"calibration/train_day_to_day.py","file_url":"https://github.com/trafficwaves/ASMx/blob/HEAD/calibration/train_day_to_day.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":"35413fedd41072d8","code_sha256_prefix":"35413fedd41072d8","mcp_get_code":{"code_sha256":"35413fedd41072d8"}},{"arxiv_id":"2505.16985","arxiv_id_is_arxiv":true,"paper":"/paper/extremely-simple-multimodal-outlier-synthesis","title":"Extremely Simple Multimodal Outlier Synthesis for Out-of-Distribution Detection and Segmentation","date":"2025-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"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":"5710019a55c8a04e","code_sha256_prefix":"5710019a55c8a04e","mcp_get_code":{"code_sha256":"5710019a55c8a04e"}},{"arxiv_id":"2411.08227","arxiv_id_is_arxiv":true,"paper":"/paper/dpu-dynamic-prototype-updating-for-multimodal","title":"DPU: Dynamic Prototype Updating for Multimodal Out-of-Distribution Detection","date":"2024-11-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"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":"5710019a55c8a04e","code_sha256_prefix":"5710019a55c8a04e","mcp_get_code":{"code_sha256":"5710019a55c8a04e"}},{"arxiv_id":"2407.12707","arxiv_id_is_arxiv":true,"paper":"/paper/ttsds-text-to-speech-distribution-score","title":"TTSDS -- Text-to-Speech Distribution Score","date":"2024-07-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ttsds/ttsds","path":"src/ttsds/util/distances.py","file_url":"https://github.com/ttsds/ttsds/blob/HEAD/src/ttsds/util/distances.py","status":"ran","verification_level":1,"contract_check":null,"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, ttsds/ttsds when it was checked","code_sha256":"54f57814da820cb0","code_sha256_prefix":"54f57814da820cb0","mcp_get_code":{"code_sha256":"54f57814da820cb0"}},{"arxiv_id":"2405.17419","arxiv_id_is_arxiv":true,"paper":"/paper/multiood-scaling-out-of-distribution","title":"MultiOOD: Scaling Out-of-Distribution Detection for Multiple Modalities","date":"2024-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"donghao51/multiood","path":"HMDB-rgb-flow/train_video_flow.py","file_url":"https://github.com/donghao51/multiood/blob/HEAD/HMDB-rgb-flow/train_video_flow.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, donghao51/multiood when it was checked","code_sha256":"5710019a55c8a04e","code_sha256_prefix":"5710019a55c8a04e","mcp_get_code":{"code_sha256":"5710019a55c8a04e"}},{"arxiv_id":"2405.15054","arxiv_id_is_arxiv":true,"paper":"/paper/controlling-behavioral-diversity-in-multi","title":"Controlling Behavioral Diversity in Multi-Agent Reinforcement Learning","date":"2024-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"proroklab/controllingbehavioraldiversity","path":"het_control/snd.py","file_url":"https://github.com/proroklab/controllingbehavioraldiversity/blob/HEAD/het_control/snd.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, proroklab/controllingbehavioraldiversity when it was checked","code_sha256":"e8e7dcc653fbdf51","code_sha256_prefix":"e8e7dcc653fbdf51","mcp_get_code":{"code_sha256":"e8e7dcc653fbdf51"}},{"arxiv_id":"2405.14780","arxiv_id_is_arxiv":true,"paper":"/paper/metric-flow-matching-for-smooth","title":"Metric Flow Matching for Smooth Interpolations on the Data Manifold","date":"2024-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kksniak/metric-flow-matching","path":"mfm/utils.py","file_url":"https://github.com/kksniak/metric-flow-matching/blob/HEAD/mfm/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":"286ffee4e5452ed2","code_sha256_prefix":"286ffee4e5452ed2","mcp_get_code":{"code_sha256":"286ffee4e5452ed2"}},{"arxiv_id":"2402.16346","arxiv_id_is_arxiv":true,"paper":"/paper/boosting-graph-pooling-with-persistent","title":"Boosting Graph Pooling with Persistent Homology","date":"2024-02-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LOGO-CUHKSZ/TIP","path":"distance.py","file_url":"https://github.com/LOGO-CUHKSZ/TIP/blob/HEAD/distance.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, LOGO-CUHKSZ/TIP when it was checked","code_sha256":"f3e500537071b00e","code_sha256_prefix":"f3e500537071b00e","mcp_get_code":{"code_sha256":"f3e500537071b00e"}},{"arxiv_id":"2310.03032","arxiv_id_is_arxiv":true,"paper":"/paper/graph-enhanced-optimizers-for-structure-aware","title":"Graph-enhanced Optimizers for Structure-aware Recommendation Embedding Evolution","date":"2023-09-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MTandHJ/SEvo","path":"STOSA/modules.py","file_url":"https://github.com/MTandHJ/SEvo/blob/HEAD/STOSA/modules.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":"39adf3ba3ae177bc","code_sha256_prefix":"39adf3ba3ae177bc","mcp_get_code":{"code_sha256":"39adf3ba3ae177bc"}},{"arxiv_id":"2002.02913","arxiv_id_is_arxiv":true,"paper":"/paper/learning-autoencoders-with-relational","title":"Learning Autoencoders with Relational Regularization","date":"2020-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"luxusg1/metabu","path":"metabu/utils.py","file_url":"https://github.com/luxusg1/metabu/blob/HEAD/metabu/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0e1a29100c6a7e2c","code_sha256_prefix":"0e1a29100c6a7e2c","mcp_get_code":{"code_sha256":"0e1a29100c6a7e2c"}},{"arxiv_id":"2022.findings-naacl.196","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2022.findings-naacl.196","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"KindRoach/NAACL-ZEOP","path":"model/base_model.py","file_url":"https://github.com/KindRoach/NAACL-ZEOP/blob/HEAD/model/base_model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"29f66f1aae731e03","code_sha256_prefix":"29f66f1aae731e03","mcp_get_code":{"code_sha256":"29f66f1aae731e03"}}],"record_sha256":"f3144d3d8c5f26183b31a1c4eb7549fdfdf9ff7940da608b449e681995a16b3c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}