{"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/random-swap","entry":"random_swap","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":5,"n_papers_ran":5,"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":2,"n_samples_ran":2,"n_samples_fingerprinted":2,"n_places":5,"n_places_pointer_only":4,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":0,"unverified":0},"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":"2406.17975","paper":"/paper/inherent-challenges-of-post-hoc-membership","title":"SoK: Membership Inference Attacks on LLMs are Rushing Nowhere (and How to Fix It)","date":"2024-06-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"computationalprivacy/mia_llms_benchmark","path":"attacks/pac.py","file_url":"https://github.com/computationalprivacy/mia_llms_benchmark/blob/HEAD/attacks/pac.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"85f4d7cd22f3b8de","mcp_get_code":{"code_sha256":"85f4d7cd22f3b8de"}},{"arxiv_id":"2405.11930","paper":"/paper/data-contamination-calibration-for-black-box","title":"Data Contamination Calibration for Black-box LLMs","date":"2024-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yyy01/pac","path":"src/eda.py","file_url":"https://github.com/yyy01/pac/blob/HEAD/src/eda.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"85f4d7cd22f3b8de","mcp_get_code":{"code_sha256":"85f4d7cd22f3b8de"}},{"arxiv_id":"2402.05591","paper":"/paper/softeda-rethinking-rule-based-data","title":"SoftEDA: Rethinking Rule-Based Data Augmentation with Soft Labels","date":"2024-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"c-juhwan/softeda","path":"task/classification/augmentation.py","file_url":"https://github.com/c-juhwan/softeda/blob/HEAD/task/classification/augmentation.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5db9c6d796298c60","mcp_get_code":{"code_sha256":"5db9c6d796298c60"}},{"arxiv_id":"2310.14577","paper":"/paper/decrisismb-debiased-semi-supervised-learning","title":"DeCrisisMB: Debiased Semi-Supervised Learning for Crisis Tweet Classification via Memory Bank","date":"2023-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HenryPengZou/DeCrisisMB","path":"utils/aug.py","file_url":"https://github.com/HenryPengZou/DeCrisisMB/blob/HEAD/utils/aug.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"85f4d7cd22f3b8de","mcp_get_code":{"code_sha256":"85f4d7cd22f3b8de"}},{"arxiv_id":"2109.05941","paper":"/paper/efficient-contrastive-learning-via-novel-data","title":"Efficient Contrastive Learning via Novel Data Augmentation and Curriculum Learning","date":"2021-09-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vano1205/efficientcl","path":"efficientcl/common/augmentation.py","file_url":"https://github.com/vano1205/efficientcl/blob/HEAD/efficientcl/common/augmentation.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"85f4d7cd22f3b8de","mcp_get_code":{"code_sha256":"85f4d7cd22f3b8de"}}]}