{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/multiclasscrossentropy","entry":"MultiClassCrossEntropy","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":6,"n_papers_ran":1,"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":2,"n_samples_ran":1,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":4,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":1,"ran":0,"unverified":1},"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":"2602.08036","paper":"/paper/arxiv-2602-08036","title":"TAAM:Inductive Graph-Class Incremental Learning with Task-Aware Adaptive Modulation","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"1iuJT/TAAM_AAMAS2026","path":"Baselines/lwf_model.py","file_url":"https://github.com/1iuJT/TAAM_AAMAS2026/blob/HEAD/Baselines/lwf_model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"78ee86b31e2503da","mcp_get_code":{"code_sha256":"78ee86b31e2503da"}},{"arxiv_id":"2410.10341","paper":"/paper/replay-and-forget-free-graph-class","title":"Replay-and-Forget-Free Graph Class-Incremental Learning: A Task Profiling and Prompting Approach","date":"2024-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mala-lab/TPP","path":"Baselines/lwf_model.py","file_url":"https://github.com/mala-lab/TPP/blob/HEAD/Baselines/lwf_model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"78ee86b31e2503da","mcp_get_code":{"code_sha256":"78ee86b31e2503da"}},{"arxiv_id":"2401.13200","paper":"/paper/topology-aware-embedding-memory-for-learning","title":"Topology-aware Embedding Memory for Continual Learning on Expanding Networks","date":"2024-01-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"imzhangxikun/pdgnns","path":"source/Baselines/New_NCGL_model.py","file_url":"https://github.com/imzhangxikun/pdgnns/blob/HEAD/source/Baselines/New_NCGL_model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"78ee86b31e2503da","mcp_get_code":{"code_sha256":"78ee86b31e2503da"}},{"arxiv_id":"2312.14439","paper":"/paper/puma-efficient-continual-graph-learning-with","title":"PUMA: Efficient Continual Graph Learning for Node Classification with Graph Condensation","date":"2023-12-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"superallen13/puma","path":"methods/lwf.py","file_url":"https://github.com/superallen13/puma/blob/HEAD/methods/lwf.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"78ee86b31e2503da","mcp_get_code":{"code_sha256":"78ee86b31e2503da"}},{"arxiv_id":"2309.09455","paper":"/paper/cat-balanced-continual-graph-learning-with","title":"CaT: Balanced Continual Graph Learning with Graph Condensation","date":"2023-09-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"superallen13/CaT-CGL","path":"methods/lwf.py","file_url":"https://github.com/superallen13/CaT-CGL/blob/HEAD/methods/lwf.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"78ee86b31e2503da","mcp_get_code":{"code_sha256":"78ee86b31e2503da"}},{"arxiv_id":"1606.09282","paper":"/paper/learning-without-forgetting","title":"Learning without Forgetting","date":"2016-06-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ngailapdi/LWF","path":"model.py","file_url":"https://github.com/ngailapdi/LWF/blob/HEAD/model.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"b43737d7d32870ed","mcp_get_code":{"code_sha256":"b43737d7d32870ed"}}]}