{"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/flat-accuracy","entry":"flat_accuracy","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":1,"n_samples_ran":1,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":5,"n_places_pointer_only":1,"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":0,"ran_fixture":1,"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":"2505.11586","arxiv_id_is_arxiv":true,"paper":"/paper/the-ripple-effect-on-unforeseen-complications","title":"The Ripple Effect: On Unforeseen Complications of Backdoor Attacks","date":"2025-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhangrui4041/backdoor_complications","path":"complication_reduction_train.py","file_url":"https://github.com/zhangrui4041/backdoor_complications/blob/HEAD/complication_reduction_train.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f3e68336634b8642","code_sha256_prefix":"f3e68336634b8642","mcp_get_code":{"code_sha256":"f3e68336634b8642"}},{"arxiv_id":"2405.06459","arxiv_id_is_arxiv":true,"paper":"/paper/are-eeg-to-text-models-working","title":"Are EEG-to-Text Models Working?","date":"2024-05-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mikewangwzhl/eeg-to-text","path":"eval_sentiment.py","file_url":"https://github.com/mikewangwzhl/eeg-to-text/blob/HEAD/eval_sentiment.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, mikewangwzhl/eeg-to-text when it was checked","code_sha256":"f3e68336634b8642","code_sha256_prefix":"f3e68336634b8642","mcp_get_code":{"code_sha256":"f3e68336634b8642"}},{"arxiv_id":"2109.05897","arxiv_id_is_arxiv":true,"paper":"/paper/question-answering-over-electronic-devices-a","title":"Question Answering over Electronic Devices: A New Benchmark Dataset and a Multi-Task Learning based QA Framework","date":"2021-09-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"abhi1nandy2/emnlp-2021-findings","path":"fine_tuning_variants_scripts/AR_sentence_wise.py","file_url":"https://github.com/abhi1nandy2/emnlp-2021-findings/blob/HEAD/fine_tuning_variants_scripts/AR_sentence_wise.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f3e68336634b8642","code_sha256_prefix":"f3e68336634b8642","mcp_get_code":{"code_sha256":"f3e68336634b8642"}},{"arxiv_id":"2002.10361","arxiv_id_is_arxiv":true,"paper":"/paper/multilingual-twitter-corpus-and-baselines-for","title":"Multilingual Twitter Corpus and Baselines for Evaluating Demographic Bias in Hate Speech Recognition","date":"2020-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xiaoleihuang/Multilingual_Fairness_LREC","path":"bert.py","file_url":"https://github.com/xiaoleihuang/Multilingual_Fairness_LREC/blob/HEAD/bert.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f3e68336634b8642","code_sha256_prefix":"f3e68336634b8642","mcp_get_code":{"code_sha256":"f3e68336634b8642"}},{"arxiv_id":"1810.04805","arxiv_id_is_arxiv":true,"paper":"/paper/bert-pre-training-of-deep-bidirectional","title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","date":"2018-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aws-samples/amazon-sagemaker-bert-pytorch","path":"code/train_deploy.py","file_url":"https://github.com/aws-samples/amazon-sagemaker-bert-pytorch/blob/HEAD/code/train_deploy.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT-0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f3e68336634b8642","code_sha256_prefix":"f3e68336634b8642","mcp_get_code":{"code_sha256":"f3e68336634b8642"}}],"record_sha256":"0a6e1f6f5ddbdfb81e72d5e6fcf0b793634b5cc2585319caa7e5a2b416f1e8d3","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}