{"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/classifier-2","entry":"classifier","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":3,"n_papers_ran_no_instrument_failure":3,"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":11,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":0,"n_samples_unverified":8,"n_samples_fingerprinted":0,"n_places":11,"n_places_pointer_only":5,"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":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":3,"unverified":8},"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":"2607.08013","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, ntuliuteam/Collate (NOASSERTION)","code_sha256":"af880b413db5a323","code_sha256_prefix":"af880b413db5a323","mcp_get_code":{"code_sha256":"af880b413db5a323"}},{"arxiv_id":"2607.08013","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, ntuliuteam/Collate (NOASSERTION)","code_sha256":"695ffda34ed5cdbc","code_sha256_prefix":"695ffda34ed5cdbc","mcp_get_code":{"code_sha256":"695ffda34ed5cdbc"}},{"arxiv_id":"2607.08013","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, ntuliuteam/Collate (NOASSERTION)","code_sha256":"78325ce26920c7b5","code_sha256_prefix":"78325ce26920c7b5","mcp_get_code":{"code_sha256":"78325ce26920c7b5"}},{"arxiv_id":"2606.00656","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, liizhang/OptFair-Multi-Class-Fairness when it was checked","code_sha256":"14a3167b34141eaf","code_sha256_prefix":"14a3167b34141eaf","mcp_get_code":{"code_sha256":"14a3167b34141eaf"}},{"arxiv_id":"2503.02174","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6691a6d2078a8b7c","code_sha256_prefix":"6691a6d2078a8b7c","mcp_get_code":{"code_sha256":"6691a6d2078a8b7c"}},{"arxiv_id":"2303.11921","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3dd048e9824c806b","code_sha256_prefix":"3dd048e9824c806b","mcp_get_code":{"code_sha256":"3dd048e9824c806b"}},{"arxiv_id":"2303.01904","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Lily-Le/EcoTTA when it was checked","code_sha256":"4b8966f2669154db","code_sha256_prefix":"4b8966f2669154db","mcp_get_code":{"code_sha256":"4b8966f2669154db"}},{"arxiv_id":"2210.12651","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7133cff201b1ffad","code_sha256_prefix":"7133cff201b1ffad","mcp_get_code":{"code_sha256":"7133cff201b1ffad"}},{"arxiv_id":"2210.00912","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f6256149c0715845","code_sha256_prefix":"f6256149c0715845","mcp_get_code":{"code_sha256":"f6256149c0715845"}},{"arxiv_id":"1908.05932","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"23e9af48e6ed570b","code_sha256_prefix":"23e9af48e6ed570b","mcp_get_code":{"code_sha256":"23e9af48e6ed570b"}},{"arxiv_id":"1905.04405","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"148715c7eef6f9ca","code_sha256_prefix":"148715c7eef6f9ca","mcp_get_code":{"code_sha256":"148715c7eef6f9ca"}}],"record_sha256":"07c89426aa0816e7e2f6ffa3e0cf9b1f4bb1c799e569afb15dd1d944e10bcd72","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}