{"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/classifier-2","entry":"classifier","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":9,"n_papers_ran":3,"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":11,"n_samples_ran":3,"n_samples_fingerprinted":0,"n_places":11,"n_places_pointer_only":5,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":3,"unverified":8},"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":"2607.08013","paper":"/paper/arxiv-2607-08013","title":"Collate: Collaborative Neural Network Learning for Latency-Critical Edge Systems","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"ntuliuteam/Collate","path":"tensorflow_support/trans_alexnet.py","file_url":"https://github.com/ntuliuteam/Collate/blob/HEAD/tensorflow_support/trans_alexnet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"af880b413db5a323","mcp_get_code":{"code_sha256":"af880b413db5a323"}},{"arxiv_id":"2607.08013","paper":"/paper/arxiv-2607-08013","title":"Collate: Collaborative Neural Network Learning for Latency-Critical Edge Systems","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"ntuliuteam/Collate","path":"tensorflow_support/trans_lenet.py","file_url":"https://github.com/ntuliuteam/Collate/blob/HEAD/tensorflow_support/trans_lenet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"695ffda34ed5cdbc","mcp_get_code":{"code_sha256":"695ffda34ed5cdbc"}},{"arxiv_id":"2607.08013","paper":"/paper/arxiv-2607-08013","title":"Collate: Collaborative Neural Network Learning for Latency-Critical Edge Systems","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"ntuliuteam/Collate","path":"tensorflow_support/trans_har.py","file_url":"https://github.com/ntuliuteam/Collate/blob/HEAD/tensorflow_support/trans_har.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"78325ce26920c7b5","mcp_get_code":{"code_sha256":"78325ce26920c7b5"}},{"arxiv_id":"2606.00656","paper":"/paper/arxiv-2606-00656","title":"Demystifying the Optimal Fair Classifier in Multi-Class Classification","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"liizhang/OptFair-Multi-Class-Fairness","path":"optimalfair/algorithm/infair.py","file_url":"https://github.com/liizhang/OptFair-Multi-Class-Fairness/blob/HEAD/optimalfair/algorithm/infair.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"14a3167b34141eaf","mcp_get_code":{"code_sha256":"14a3167b34141eaf"}},{"arxiv_id":"2503.02174","paper":"/paper/adversarial-tokenization","title":"Adversarial Tokenization","date":"2025-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RenatoGeh/advtok","path":"advtok/evaluate.py","file_url":"https://github.com/RenatoGeh/advtok/blob/HEAD/advtok/evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6691a6d2078a8b7c","mcp_get_code":{"code_sha256":"6691a6d2078a8b7c"}},{"arxiv_id":"2303.11921","paper":"/paper/context-de-confounded-emotion-recognition","title":"Context De-confounded Emotion Recognition","date":"2023-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ydk122024/ccim","path":"CCIM.py","file_url":"https://github.com/ydk122024/ccim/blob/HEAD/CCIM.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3dd048e9824c806b","mcp_get_code":{"code_sha256":"3dd048e9824c806b"}},{"arxiv_id":"2303.01904","paper":"/paper/ecotta-memory-efficient-continual-test-time","title":"EcoTTA: Memory-Efficient Continual Test-time Adaptation via Self-distilled Regularization","date":"2023-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Lily-Le/EcoTTA","path":"ecotta_models/resnet50.py","file_url":"https://github.com/Lily-Le/EcoTTA/blob/HEAD/ecotta_models/resnet50.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4b8966f2669154db","mcp_get_code":{"code_sha256":"4b8966f2669154db"}},{"arxiv_id":"2210.12651","paper":"/paper/unsupervised-non-transferable-text","title":"Unsupervised Non-transferable Text Classification","date":"2022-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chaoscodes/untl","path":"UNTL.py","file_url":"https://github.com/chaoscodes/untl/blob/HEAD/UNTL.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7133cff201b1ffad","mcp_get_code":{"code_sha256":"7133cff201b1ffad"}},{"arxiv_id":"2210.00912","paper":"/paper/federated-domain-generalization-for-image","title":"Federated Domain Generalization for Image Recognition via Cross-Client Style Transfer","date":"2022-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JeremyCJM/CCST","path":"utils/rsc_utils_densenet.py","file_url":"https://github.com/JeremyCJM/CCST/blob/HEAD/utils/rsc_utils_densenet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"CC0-1.0","inline_ok":true,"code_sha256_prefix":"f6256149c0715845","mcp_get_code":{"code_sha256":"f6256149c0715845"}},{"arxiv_id":"1908.05932","paper":"/paper/fsgan-subject-agnostic-face-swapping-and","title":"FSGAN: Subject Agnostic Face Swapping and Reenactment","date":"2019-08-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YuvalNirkin/fsgan","path":"fsgan/models/classifier1d.py","file_url":"https://github.com/YuvalNirkin/fsgan/blob/HEAD/fsgan/models/classifier1d.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"CC0-1.0","inline_ok":true,"code_sha256_prefix":"23e9af48e6ed570b","mcp_get_code":{"code_sha256":"23e9af48e6ed570b"}},{"arxiv_id":"1905.04405","paper":"/paper/language-conditioned-graph-networks-for","title":"Language-Conditioned Graph Networks for Relational Reasoning","date":"2019-05-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ronghanghu/lcgn","path":"models_clevr/output_unit.py","file_url":"https://github.com/ronghanghu/lcgn/blob/HEAD/models_clevr/output_unit.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"code_sha256_prefix":"148715c7eef6f9ca","mcp_get_code":{"code_sha256":"148715c7eef6f9ca"}}]}