{"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/distillation","entry":"distillation","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":7,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":6,"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":5,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":1,"n_places":7,"n_places_pointer_only":2,"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":3,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"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":"2009.08325","arxiv_id_is_arxiv":true,"paper":"/paper/noisy-concurrent-training-for-efficient","title":"Noisy Concurrent Training for Efficient Learning under Label Noise","date":"2020-09-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NeurAI-Lab/NCT","path":"utilities/losses.py","file_url":"https://github.com/NeurAI-Lab/NCT/blob/HEAD/utilities/losses.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2f8ea28418068366","code_sha256_prefix":"2f8ea28418068366","mcp_get_code":{"code_sha256":"2f8ea28418068366"}},{"arxiv_id":"2005.09394","arxiv_id_is_arxiv":true,"paper":"/paper/enhancing-monotonic-multihead-attention-for","title":"Enhancing Monotonic Multihead Attention for Streaming ASR","date":"2020-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hirofumi0810/neural_sp","path":"neural_sp/models/criterion.py","file_url":"https://github.com/hirofumi0810/neural_sp/blob/HEAD/neural_sp/models/criterion.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8cef8c0370530397","code_sha256_prefix":"8cef8c0370530397","mcp_get_code":{"code_sha256":"8cef8c0370530397"}},{"arxiv_id":"2001.02905","arxiv_id_is_arxiv":true,"paper":"/paper/fast-adaptation-to-super-resolution-networks","title":"Fast Adaptation to Super-Resolution Networks via Meta-Learning","date":"2020-01-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"parkseobin/MLSR","path":"IDN_definition.py","file_url":"https://github.com/parkseobin/MLSR/blob/HEAD/IDN_definition.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a5335593d33fc9a1","code_sha256_prefix":"a5335593d33fc9a1","mcp_get_code":{"code_sha256":"a5335593d33fc9a1"}},{"arxiv_id":"1906.04113","arxiv_id_is_arxiv":true,"paper":"/paper/blockswap-fisher-guided-block-substitution","title":"BlockSwap: Fisher-guided Block Substitution for Network Compression on a Budget","date":"2019-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BayesWatch/pytorch-blockswap","path":"utils.py","file_url":"https://github.com/BayesWatch/pytorch-blockswap/blob/HEAD/utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f6484efda3ef4ceb","code_sha256_prefix":"f6484efda3ef4ceb","mcp_get_code":{"code_sha256":"f6484efda3ef4ceb"}},{"arxiv_id":"1905.13409","arxiv_id_is_arxiv":true,"paper":"/paper/bypassing-backdoor-detection-algorithms-in","title":"Bypassing Backdoor Detection Algorithms in Deep Learning","date":"2019-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"5c6b89d763f0a8f3","code_sha256_prefix":"5c6b89d763f0a8f3","mcp_get_code":{"code_sha256":"5c6b89d763f0a8f3"}},{"arxiv_id":"1711.02613","arxiv_id_is_arxiv":true,"paper":"/paper/moonshine-distilling-with-cheap-convolutions","title":"Moonshine: Distilling with Cheap Convolutions","date":"2017-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BayesWatch/pytorch-moonshine","path":"funcs.py","file_url":"https://github.com/BayesWatch/pytorch-moonshine/blob/HEAD/funcs.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f6484efda3ef4ceb","code_sha256_prefix":"f6484efda3ef4ceb","mcp_get_code":{"code_sha256":"f6484efda3ef4ceb"}},{"arxiv_id":"1708.06733","arxiv_id_is_arxiv":true,"paper":"/paper/badnets-identifying-vulnerabilities-in-the","title":"BadNets: Identifying Vulnerabilities in the Machine Learning Model Supply Chain","date":"2017-08-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aisafety-hkust/backdoor_safety_tuning","path":"fine_tune/qra.py","file_url":"https://github.com/aisafety-hkust/backdoor_safety_tuning/blob/HEAD/fine_tune/qra.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","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, aisafety-hkust/backdoor_safety_tuning (NOASSERTION)","code_sha256":"5c6b89d763f0a8f3","code_sha256_prefix":"5c6b89d763f0a8f3","mcp_get_code":{"code_sha256":"5c6b89d763f0a8f3"}}],"record_sha256":"2849e35f24158c0cbfa11246bafff8b63be446f27b599fcd2f6b867ca049eb03","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}