{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/get-cost-matrix","entry":"get_cost_matrix","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":6,"n_papers_ran":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":6,"n_samples_ran":3,"n_samples_fingerprinted":2,"n_places":6,"n_places_pointer_only":1,"by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":0,"unverified":3},"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":"2409.14747","paper":"/paper/distribution-level-feature-distancing-for","title":"Distribution-Level Feature Distancing for Machine Unlearning: Towards a Better Trade-off Between Model Utility and Forgetting","date":"2024-09-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Dasol-Choi/DLFD","path":"unlearn/dlfd.py","file_url":"https://github.com/Dasol-Choi/DLFD/blob/HEAD/unlearn/dlfd.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"4213b87b66625b04","mcp_get_code":{"code_sha256":"4213b87b66625b04"}},{"arxiv_id":"2302.03857","paper":"/paper/efficient-adversarial-contrastive-learning-1","title":"Efficient Adversarial Contrastive Learning via Robustness-Aware Coreset Selection","date":"2023-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"godxuxilie/efficient_acl_via_rcs","path":"ACL_RCS/ImageNet_32/RCS.py","file_url":"https://github.com/godxuxilie/efficient_acl_via_rcs/blob/HEAD/ACL_RCS/ImageNet_32/RCS.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4a362ab42a0fc3d1","mcp_get_code":{"code_sha256":"4a362ab42a0fc3d1"}},{"arxiv_id":"2212.07328","paper":"/paper/modeling-multimodal-aleatoric-uncertainty-in","title":"Modeling Multimodal Aleatoric Uncertainty in Segmentation with Mixture of Stochastic Experts","date":"2022-12-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gaozhitong/mose-auseg","path":"models/MoSE.py","file_url":"https://github.com/gaozhitong/mose-auseg/blob/HEAD/models/MoSE.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"9c5ac86b50c73a3f","mcp_get_code":{"code_sha256":"9c5ac86b50c73a3f"}},{"arxiv_id":"2105.13353","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"aa702c976b3ba525","mcp_get_code":{"code_sha256":"aa702c976b3ba525"}},{"arxiv_id":"2008.10312","paper":"/paper/self-supervised-learning-for-large-scale","title":"Self-Supervised Learning for Large-Scale Unsupervised Image Clustering","date":"2020-08-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"randl/kmeans_selfsuper","path":"cluster.py","file_url":"https://github.com/randl/kmeans_selfsuper/blob/HEAD/cluster.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"53437473e6a66a64","mcp_get_code":{"code_sha256":"53437473e6a66a64"}},{"arxiv_id":"2002.02913","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"48dcc6f6881517b3","mcp_get_code":{"code_sha256":"48dcc6f6881517b3"}}]}