{"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/random-swap","entry":"random_swap","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":5,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":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_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":2,"n_places":5,"n_places_pointer_only":5,"n_places_pointer_only_link_open":1,"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":2,"ran_fixture":0,"ran":0,"unverified":0},"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":"2406.17975","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, computationalprivacy/mia_llms_benchmark when it was checked","code_sha256":"85f4d7cd22f3b8de","code_sha256_prefix":"85f4d7cd22f3b8de","mcp_get_code":{"code_sha256":"85f4d7cd22f3b8de"}},{"arxiv_id":"2405.11930","arxiv_id_is_arxiv":true,"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":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 vano1205/efficientcl, and GitHub detected no licence in that repository when it was checked","code_sha256":"85f4d7cd22f3b8de","code_sha256_prefix":"85f4d7cd22f3b8de","mcp_get_code":{"code_sha256":"85f4d7cd22f3b8de"}},{"arxiv_id":"2402.05591","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, c-juhwan/softeda when it was checked","code_sha256":"5db9c6d796298c60","code_sha256_prefix":"5db9c6d796298c60","mcp_get_code":{"code_sha256":"5db9c6d796298c60"}},{"arxiv_id":"2310.14577","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, HenryPengZou/DeCrisisMB when it was checked","code_sha256":"85f4d7cd22f3b8de","code_sha256_prefix":"85f4d7cd22f3b8de","mcp_get_code":{"code_sha256":"85f4d7cd22f3b8de"}},{"arxiv_id":"2109.05941","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, vano1205/efficientcl when it was checked","code_sha256":"85f4d7cd22f3b8de","code_sha256_prefix":"85f4d7cd22f3b8de","mcp_get_code":{"code_sha256":"85f4d7cd22f3b8de"}}],"record_sha256":"b77295166c5c3fa094f204d5f28b70f34b65dd5c38d0db16f7c147ff29f90bc8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}