{"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":"/method/flip/papers/ran/1","list_of":"/method/flip","method":"FLIP","archive":{"snapshot":"2025-07-28"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not isolate this method inside it.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,23],"of":23,"counts":{"archive_papers_tagged":237,"with_a_code_link":82,"where_syntology_ran_a_sample":23,"not_listed_spam_title":0,"listed":237,"listed_where_code_ran":23,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":20,"every_run_a_failure_of_syntologys_instrument":3,"listed_with_a_run_with_no_instrument_failure":20,"listed_every_run_a_failure_of_syntologys_instrument":3,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/method/flip/papers/ran/1","prev":null,"next":null,"papers":[{"paper":"/paper/the-ideation-execution-gap-execution-outcomes","slug":"the-ideation-execution-gap-execution-outcomes","title":"The Ideation-Execution Gap: Execution Outcomes of LLM-Generated versus Human Research Ideas","date":"2025-06-25","arxiv_id":"2506.20803","n_code_links":1,"syntology":{"ran":4,"of":5,"n_ran_checked":4,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["NoviScl/AI-Researcher"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/busting-the-paper-ballot-voting-meets","slug":"busting-the-paper-ballot-voting-meets","title":"Busting the Paper Ballot: Voting Meets Adversarial Machine Learning","date":"2025-06-17","arxiv_id":"2506.14582","n_code_links":1,"syntology":{"ran":4,"of":4,"n_ran_checked":0,"n_instrument":4,"unverified":0,"pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","official":{"repos":["votercenter/busting-the-ballot"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/diffstega-towards-universal-training-free","slug":"diffstega-towards-universal-training-free","title":"DiffStega: Towards Universal Training-Free Coverless Image Steganography with Diffusion Models","date":"2024-07-15","arxiv_id":"2407.10459","n_code_links":1,"syntology":{"ran":3,"of":3,"n_ran_checked":2,"n_instrument":1,"unverified":0,"pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["evtricks/diffstega"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/connecting-the-dots-llms-can-infer-and","slug":"connecting-the-dots-llms-can-infer-and","title":"Connecting the Dots: LLMs can Infer and Verbalize Latent Structure from Disparate Training Data","date":"2024-06-20","arxiv_id":"2406.14546","n_code_links":1,"syntology":{"ran":5,"of":9,"n_ran_checked":5,"n_instrument":0,"unverified":4,"pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","official":{"repos":["choidami/inductive-oocr"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":4,"ran_from_kinds":["official"]}}},{"paper":"/paper/efficient-vision-language-pre-training-by","slug":"efficient-vision-language-pre-training-by","title":"Efficient Vision-Language Pre-training by Cluster Masking","date":"2024-05-14","arxiv_id":"2405.08815","n_code_links":1,"syntology":{"ran":11,"of":17,"n_ran_checked":11,"n_instrument":0,"unverified":6,"pointer_only":17,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 3 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","official":{"repos":["zi-hao-wei/efficient-vision-language-pre-training-by-cluster-masking"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":6,"ran_from_kinds":["official"]}}},{"paper":"/paper/llms-for-generating-and-evaluating","slug":"llms-for-generating-and-evaluating","title":"LLMs for Generating and Evaluating Counterfactuals: A Comprehensive Study","date":"2024-04-26","arxiv_id":"2405.00722","n_code_links":1,"syntology":{"ran":7,"of":11,"n_ran_checked":7,"n_instrument":0,"unverified":4,"pointer_only":11,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","official":{"repos":["aix-group/llms-for-cfs"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":4,"ran_from_kinds":["official"]}}},{"paper":"/paper/escape-sky-high-cost-early-stopping-self","slug":"escape-sky-high-cost-early-stopping-self","title":"Escape Sky-high Cost: Early-stopping Self-Consistency for Multi-step Reasoning","date":"2024-01-19","arxiv_id":"2401.10480","n_code_links":1,"syntology":{"ran":7,"of":8,"n_ran_checked":6,"n_instrument":1,"unverified":1,"pointer_only":8,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","official":{"repos":["yiwei98/esc"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/people-make-better-edits-measuring-the","slug":"people-make-better-edits-measuring-the","title":"People Make Better Edits: Measuring the Efficacy of LLM-Generated Counterfactually Augmented Data for Harmful Language Detection","date":"2023-11-02","arxiv_id":"2311.01270","n_code_links":1,"syntology":{"ran":1,"of":2,"n_ran_checked":1,"n_instrument":0,"unverified":1,"pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["indiiigo/automatedcad"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/label-poisoning-is-all-you-need","slug":"label-poisoning-is-all-you-need","title":"Label Poisoning is All You Need","date":"2023-10-29","arxiv_id":"2310.18933","n_code_links":1,"syntology":{"ran":6,"of":10,"n_ran_checked":5,"n_instrument":1,"unverified":4,"pointer_only":1,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","official":{"repos":["SewoongLab/FLIP"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":4,"ran_from_kinds":["official"]}}},{"paper":"/paper/one-bit-flip-is-all-you-need-when-bit-flip","slug":"one-bit-flip-is-all-you-need-when-bit-flip","title":"One-bit Flip is All You Need: When Bit-flip Attack Meets Model Training","date":"2023-08-12","arxiv_id":"2308.07934","n_code_links":1,"syntology":{"ran":5,"of":19,"n_ran_checked":5,"n_instrument":0,"unverified":14,"pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 14 unverified","official":{"repos":["jianshuod/tba"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":14,"ran_from_kinds":["official"]}}},{"paper":"/paper/circumventing-concept-erasure-methods-for","slug":"circumventing-concept-erasure-methods-for","title":"Circumventing Concept Erasure Methods For Text-to-Image Generative Models","date":"2023-08-03","arxiv_id":"2308.01508","n_code_links":1,"syntology":{"ran":1,"of":2,"n_ran_checked":1,"n_instrument":0,"unverified":1,"pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["nyu-dice-lab/circumventing-concept-erasure"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/how-many-and-which-training-points-would-need","slug":"how-many-and-which-training-points-would-need","title":"How Many and Which Training Points Would Need to be Removed to Flip this Prediction?","date":"2023-02-04","arxiv_id":"2302.02169","n_code_links":1,"syntology":{"ran":4,"of":6,"n_ran_checked":1,"n_instrument":3,"unverified":2,"pointer_only":6,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","official":{"repos":["ecielyang/smallest_set"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/reinforced-clarification-question-generation","slug":"reinforced-clarification-question-generation","title":"ClarifyDelphi: Reinforced Clarification Questions with Defeasibility Rewards for Social and Moral Situations","date":"2022-12-20","arxiv_id":"2212.10409","n_code_links":2,"syntology":{"ran":5,"of":7,"n_ran_checked":3,"n_instrument":2,"unverified":2,"pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","official":{"repos":["allenai/clarifydelphi","valentinapy/clarifyd"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/scaling-language-image-pre-training-via","slug":"scaling-language-image-pre-training-via","title":"Scaling Language-Image Pre-training via Masking","date":"2022-12-01","arxiv_id":"2212.00794","n_code_links":6,"syntology":{"ran":12,"of":14,"n_ran_checked":9,"n_instrument":3,"unverified":2,"pointer_only":4,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 2 honoured, 5 violated, 2 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","official":{"repos":["facebookresearch/flip"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":"/paper/characterizing-datapoints-via-second-split","slug":"characterizing-datapoints-via-second-split","title":"Characterizing Datapoints via Second-Split Forgetting","date":"2022-10-26","arxiv_id":"2210.15031","n_code_links":1,"syntology":{"ran":2,"of":4,"n_ran_checked":1,"n_instrument":1,"unverified":2,"pointer_only":4,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","official":{"repos":["pratyushmaini/ssft"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/scaling-adversarial-training-to-large","slug":"scaling-adversarial-training-to-large","title":"Scaling Adversarial Training to Large Perturbation Bounds","date":"2022-10-18","arxiv_id":"2210.09852","n_code_links":1,"syntology":{"ran":7,"of":8,"n_ran_checked":6,"n_instrument":1,"unverified":1,"pointer_only":4,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","official":{"repos":["val-iisc/oaat"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/oversquashing-in-gnns-through-the-lens-of","slug":"oversquashing-in-gnns-through-the-lens-of","title":"Oversquashing in GNNs through the lens of information contraction and graph expansion","date":"2022-08-06","arxiv_id":"2208.03471","n_code_links":1,"syntology":{"ran":3,"of":3,"n_ran_checked":3,"n_instrument":0,"unverified":0,"pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["kedar2/oversquashing"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/robust-counterfactual-explanations-for-random","slug":"robust-counterfactual-explanations-for-random","title":"Don't Explain Noise: Robust Counterfactuals for Randomized Ensembles","date":"2022-05-27","arxiv_id":"2205.14116","n_code_links":1,"syntology":{"ran":7,"of":7,"n_ran_checked":7,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["alexforel/robustcf4rf"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/rethinking-efficient-lane-detection-via-curve","slug":"rethinking-efficient-lane-detection-via-curve","title":"Rethinking Efficient Lane Detection via Curve Modeling","date":"2022-03-04","arxiv_id":"2203.02431","n_code_links":2,"syntology":{"ran":12,"of":12,"n_ran_checked":12,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["voldemortX/pytorch-auto-drive"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/an-investigation-of-the-in-effectiveness-of","slug":"an-investigation-of-the-in-effectiveness-of","title":"An Investigation of the (In)effectiveness of Counterfactually Augmented Data","date":"2021-07-01","arxiv_id":"2107.00753","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":1,"n_instrument":1,"unverified":0,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["joshinh/investigation-cad"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/a-bop-and-beyond-a-second-order-optimizer-for","slug":"a-bop-and-beyond-a-second-order-optimizer-for","title":"A Bop and Beyond: A Second Order Optimizer for Binarized Neural Networks","date":"2021-04-11","arxiv_id":"2104.05124","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":2,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["CuauSuarez/Bop2ndOrder"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/on-using-classification-datasets-to-evaluate","slug":"on-using-classification-datasets-to-evaluate","title":"On Using Classification Datasets to Evaluate Graph-Level Outlier Detection: Peculiar Observations and New Insights","date":"2020-12-23","arxiv_id":"2012.12931","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["LingxiaoShawn/GLOD-Issues"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/finding-friends-and-flipping-frenemies","slug":"finding-friends-and-flipping-frenemies","title":"Finding Friends and Flipping Frenemies: Automatic Paraphrase Dataset Augmentation Using Graph Theory","date":"2020-11-03","arxiv_id":"2011.01856","n_code_links":1,"syntology":{"ran":3,"of":4,"n_ran_checked":0,"n_instrument":3,"unverified":1,"pointer_only":4,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","official":{"repos":["hannahxchen/automatic-paraphrase-dataset-augmentation"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}}],"record_sha256":"8c71e3b4ba0f2ffc8fc3ef4b7b98eeabac0e59ceb53f33e083605faf0272d7d6","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}