{"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/loss-fn-kd","entry":"loss_fn_kd","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":9,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":4,"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":10,"n_samples_ran":10,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":5,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":10,"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":0,"ran_violates":1,"ran_draft_wrong":3,"ran_fixture":2,"ran":4,"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":"2411.11396","arxiv_id_is_arxiv":true,"paper":"/paper/stacking-brick-by-brick-aligned-feature","title":"Stacking Brick by Brick: Aligned Feature Isolation for Incremental Face Forgery Detection","date":"2024-11-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"beautyremain/sur-lid","path":"training/detectors/utils/dfil_api.py","file_url":"https://github.com/beautyremain/sur-lid/blob/HEAD/training/detectors/utils/dfil_api.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, beautyremain/sur-lid when it was checked","code_sha256":"809353fe3e0a4e5c","code_sha256_prefix":"809353fe3e0a4e5c","mcp_get_code":{"code_sha256":"809353fe3e0a4e5c"}},{"arxiv_id":"2309.09526","arxiv_id_is_arxiv":true,"paper":"/paper/dfil-deepfake-incremental-learning-by","title":"DFIL: Deepfake Incremental Learning by Exploiting Domain-invariant Forgery Clues","date":"2023-09-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deepfakeil/dfil","path":"DFIL/TaskN_KD.py","file_url":"https://github.com/deepfakeil/dfil/blob/HEAD/DFIL/TaskN_KD.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, deepfakeil/dfil when it was checked","code_sha256":"0b033a49b9717c7d","code_sha256_prefix":"0b033a49b9717c7d","mcp_get_code":{"code_sha256":"0b033a49b9717c7d"}},{"arxiv_id":"2307.06947","arxiv_id_is_arxiv":true,"paper":"/paper/video-focalnets-spatio-temporal-focal","title":"Video-FocalNets: Spatio-Temporal Focal Modulation for Video Action Recognition","date":"2023-07-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hayatkhan8660-maker/DVFL-Net","path":"classification/criterion.py","file_url":"https://github.com/hayatkhan8660-maker/DVFL-Net/blob/HEAD/classification/criterion.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":"40e37850e70297c2","code_sha256_prefix":"40e37850e70297c2","mcp_get_code":{"code_sha256":"40e37850e70297c2"}},{"arxiv_id":"2207.08224","arxiv_id_is_arxiv":true,"paper":"/paper/learning-with-recoverable-forgetting","title":"Learning with Recoverable Forgetting","date":"2022-07-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JngwenYe/LIRF","path":"train_deposit.py","file_url":"https://github.com/JngwenYe/LIRF/blob/HEAD/train_deposit.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, JngwenYe/LIRF when it was checked","code_sha256":"497a170899674f77","code_sha256_prefix":"497a170899674f77","mcp_get_code":{"code_sha256":"497a170899674f77"}},{"arxiv_id":"2106.09701","arxiv_id_is_arxiv":true,"paper":"/paper/always-be-dreaming-a-new-approach-for-data","title":"Always Be Dreaming: A New Approach for Data-Free Class-Incremental Learning","date":"2021-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GT-RIPL/AlwaysBeDreaming-DFCIL","path":"learners/datafree.py","file_url":"https://github.com/GT-RIPL/AlwaysBeDreaming-DFCIL/blob/HEAD/learners/datafree.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fa83cf1f7e65eeff","code_sha256_prefix":"fa83cf1f7e65eeff","mcp_get_code":{"code_sha256":"fa83cf1f7e65eeff"}},{"arxiv_id":"2105.07381","arxiv_id_is_arxiv":true,"paper":"/paper/undistillable-making-a-nasty-teacher-that-1","title":"Undistillable: Making A Nasty Teacher That CANNOT teach students","date":"2021-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vita-group/nasty-teacher","path":"train_kd.py","file_url":"https://github.com/vita-group/nasty-teacher/blob/HEAD/train_kd.py","status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"838b348fdb6ed05a","code_sha256_prefix":"838b348fdb6ed05a","mcp_get_code":{"code_sha256":"838b348fdb6ed05a"}},{"arxiv_id":"2003.10477","arxiv_id_is_arxiv":true,"paper":"/paper/distillating-knowledge-from-graph","title":"Distilling Knowledge from Graph Convolutional Networks","date":"2020-03-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ihollywhy/DistillGCN.PyTorch","path":"auxilary_loss.py","file_url":"https://github.com/ihollywhy/DistillGCN.PyTorch/blob/HEAD/auxilary_loss.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":"c2088eb26db4bc18","code_sha256_prefix":"c2088eb26db4bc18","mcp_get_code":{"code_sha256":"c2088eb26db4bc18"}},{"arxiv_id":"1606.09282","arxiv_id_is_arxiv":true,"paper":"/paper/learning-without-forgetting","title":"Learning without Forgetting","date":"2016-06-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GMvandeVen/continual-learning","path":"models/utils/loss_functions.py","file_url":"https://github.com/GMvandeVen/continual-learning/blob/HEAD/models/utils/loss_functions.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":"b76db52297524e52","code_sha256_prefix":"b76db52297524e52","mcp_get_code":{"code_sha256":"b76db52297524e52"}},{"arxiv_id":"1503.02531","arxiv_id_is_arxiv":true,"paper":"/paper/distilling-the-knowledge-in-a-neural-network","title":"Distilling the Knowledge in a Neural Network","date":"2015-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KellyYutongHe/Knowledge-Distillation-Net-with-Swish","path":"kd.py","file_url":"https://github.com/KellyYutongHe/Knowledge-Distillation-Net-with-Swish/blob/HEAD/kd.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, KellyYutongHe/Knowledge-Distillation-Net-with-Swish when it was checked","code_sha256":"8a5635108617215c","code_sha256_prefix":"8a5635108617215c","mcp_get_code":{"code_sha256":"8a5635108617215c"}},{"arxiv_id":"1503.02531","arxiv_id_is_arxiv":true,"paper":"/paper/distilling-the-knowledge-in-a-neural-network","title":"Distilling the Knowledge in a Neural Network","date":"2015-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"knotgrass/Knowledge-Distillation","path":"distiller/loss.py","file_url":"https://github.com/knotgrass/Knowledge-Distillation/blob/HEAD/distiller/loss.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":"240a91c16bc48dd5","code_sha256_prefix":"240a91c16bc48dd5","mcp_get_code":{"code_sha256":"240a91c16bc48dd5"}}],"record_sha256":"198d3df7d09b1a9bd545d9e4626cc92e051bc26b872b4364926c6a85a265ce37","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}