{"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/test-accuracy","entry":"test_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":6,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":0,"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":5,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":4,"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":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":4,"unverified":1},"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":"2407.11902","arxiv_id_is_arxiv":true,"paper":"/paper/encapsulating-knowledge-in-one-prompt","title":"Encapsulating Knowledge in One Prompt","date":"2024-07-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liqiiiii/encapsulating-knowledge-in-one-prompt","path":"KiOP_B.py","file_url":"https://github.com/liqiiiii/encapsulating-knowledge-in-one-prompt/blob/HEAD/KiOP_B.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, liqiiiii/encapsulating-knowledge-in-one-prompt when it was checked","code_sha256":"0de81cc8edb9a495","code_sha256_prefix":"0de81cc8edb9a495","mcp_get_code":{"code_sha256":"0de81cc8edb9a495"}},{"arxiv_id":"2404.12699","arxiv_id_is_arxiv":true,"paper":"/paper/sophon-non-fine-tunable-learning-to-restrain","title":"SOPHON: Non-Fine-Tunable Learning to Restrain Task Transferability For Pre-trained Models","date":"2024-04-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chiange/sophon","path":"classification/utils.py","file_url":"https://github.com/chiange/sophon/blob/HEAD/classification/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, chiange/sophon when it was checked","code_sha256":"30e09076ea1f6a73","code_sha256_prefix":"30e09076ea1f6a73","mcp_get_code":{"code_sha256":"30e09076ea1f6a73"}},{"arxiv_id":"2403.07134","arxiv_id_is_arxiv":true,"paper":"/paper/comq-a-backpropagation-free-algorithm-for","title":"COMQ: A Backpropagation-Free Algorithm for Post-Training Quantization","date":"2024-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aozhongzhang/comq","path":"quantize_main.py","file_url":"https://github.com/aozhongzhang/comq/blob/HEAD/quantize_main.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, aozhongzhang/comq when it was checked","code_sha256":"c416ed2477b56285","code_sha256_prefix":"c416ed2477b56285","mcp_get_code":{"code_sha256":"c416ed2477b56285"}},{"arxiv_id":"2402.01887","arxiv_id_is_arxiv":true,"paper":"/paper/on-f-divergence-principled-domain-adaptation","title":"On $f$-Divergence Principled Domain Adaptation: An Improved Framework","date":"2024-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nv-tlabs/fdal","path":"demos/demo_mnist_usps.py","file_url":"https://github.com/nv-tlabs/fdal/blob/HEAD/demos/demo_mnist_usps.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, nv-tlabs/fdal (NOASSERTION)","code_sha256":"02a979a0b77b81bf","code_sha256_prefix":"02a979a0b77b81bf","mcp_get_code":{"code_sha256":"02a979a0b77b81bf"}},{"arxiv_id":"2310.00542","arxiv_id_is_arxiv":true,"paper":"/paper/horizontal-class-backdoor-to-deep-learning","title":"Watch Out! Simple Horizontal Class Backdoor Can Trivially Evade Defense","date":"2023-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shihe98/HCB","path":"GTSRB/Model/utils_model_outsourcing.py","file_url":"https://github.com/shihe98/HCB/blob/HEAD/GTSRB/Model/utils_model_outsourcing.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"39f23426bccb25cd","code_sha256_prefix":"39f23426bccb25cd","mcp_get_code":{"code_sha256":"39f23426bccb25cd"}},{"arxiv_id":"2210.14026","arxiv_id_is_arxiv":true,"paper":"/paper/swift-rapid-decentralized-federated-learning","title":"SWIFT: Rapid Decentralized Federated Learning via Wait-Free Model Communication","date":"2022-10-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"umd-huang-lab/SWIFT","path":"Utils/Misc.py","file_url":"https://github.com/umd-huang-lab/SWIFT/blob/HEAD/Utils/Misc.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ecd6a124da711f0b","code_sha256_prefix":"ecd6a124da711f0b","mcp_get_code":{"code_sha256":"ecd6a124da711f0b"}}],"record_sha256":"3cf90296c56a2e094f2c477054b158a73433e828b29a294f8641510dbd45cc81","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}