{"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/classificationhead","entry":"ClassificationHead","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":12,"n_papers_ran":11,"n_papers_ran_no_instrument_failure":11,"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":13,"n_samples_ran":12,"n_samples_constructed":11,"n_samples_ran_checked":12,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":1,"n_places":13,"n_places_pointer_only":3,"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":12,"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":"2604.19368","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-19368","title":"Mind2Drive: Predicting Driver Intentions from EEG in Real-world On-Road Driving","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"galosaimi/Mind2Drive","path":"models/eegconformer.py","file_url":"https://github.com/galosaimi/Mind2Drive/blob/HEAD/models/eegconformer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6f8d98f2158e2878","code_sha256_prefix":"6f8d98f2158e2878","mcp_get_code":{"code_sha256":"6f8d98f2158e2878"}},{"arxiv_id":"2601.08500","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-08500","title":"It's All About the Confidence: An Unsupervised Approach for Multilingual Historical Entity Linking using Large Language Models","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"sntcristian/MHEL-LLAMO","path":"bela/task/joint_el_task.py","file_url":"https://github.com/sntcristian/MHEL-LLAMO/blob/HEAD/bela/task/joint_el_task.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":"65b59192e3d66b26","code_sha256_prefix":"65b59192e3d66b26","mcp_get_code":{"code_sha256":"65b59192e3d66b26"}},{"arxiv_id":"2506.10351","arxiv_id_is_arxiv":true,"paper":"/paper/physiowave-a-multi-scale-wavelet-transformer","title":"PhysioWave: A Multi-Scale Wavelet-Transformer for Physiological Signal Representation","date":"2025-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ForeverBlue816/PhysioWave","path":"model.py","file_url":"https://github.com/ForeverBlue816/PhysioWave/blob/HEAD/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"df8a054ee2900019","code_sha256_prefix":"df8a054ee2900019","mcp_get_code":{"code_sha256":"df8a054ee2900019"}},{"arxiv_id":"2411.19451","arxiv_id_is_arxiv":true,"paper":"/paper/learning-visual-abstract-reasoning-through","title":"Learning Visual Abstract Reasoning through Dual-Stream Networks","date":"2024-11-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VecchioID/DRNet","path":"src/model.py","file_url":"https://github.com/VecchioID/DRNet/blob/HEAD/src/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4db15df59f1d4a53","code_sha256_prefix":"4db15df59f1d4a53","mcp_get_code":{"code_sha256":"4db15df59f1d4a53"}},{"arxiv_id":"2410.20964","arxiv_id_is_arxiv":true,"paper":"/paper/detective-detecting-ai-generated-text-via","title":"DeTeCtive: Detecting AI-generated Text via Multi-Level Contrastive Learning","date":"2024-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"heyongxin233/detective","path":"src/simclr.py","file_url":"https://github.com/heyongxin233/detective/blob/HEAD/src/simclr.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, heyongxin233/detective when it was checked","code_sha256":"fad5c93335cdab5b","code_sha256_prefix":"fad5c93335cdab5b","mcp_get_code":{"code_sha256":"fad5c93335cdab5b"}},{"arxiv_id":"2404.12467","arxiv_id_is_arxiv":true,"paper":"/paper/towards-multi-modal-transformers-in-federated","title":"Towards Multi-modal Transformers in Federated Learning","date":"2024-04-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"imguangyu/FedCola","path":"src/models/mome.py","file_url":"https://github.com/imguangyu/FedCola/blob/HEAD/src/models/mome.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":"665d7fe1dc9696b6","code_sha256_prefix":"665d7fe1dc9696b6","mcp_get_code":{"code_sha256":"665d7fe1dc9696b6"}},{"arxiv_id":"2402.03885","arxiv_id_is_arxiv":true,"paper":"/paper/moment-a-family-of-open-time-series","title":"MOMENT: A Family of Open Time-series Foundation Models","date":"2024-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"moment-timeseries-foundation-model/moment-research","path":"moment/models/moment.py","file_url":"https://github.com/moment-timeseries-foundation-model/moment-research/blob/HEAD/moment/models/moment.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c1c9437626597115","code_sha256_prefix":"c1c9437626597115","mcp_get_code":{"code_sha256":"c1c9437626597115"}},{"arxiv_id":"2402.03885","arxiv_id_is_arxiv":true,"paper":"/paper/moment-a-family-of-open-time-series","title":"MOMENT: A Family of Open Time-series Foundation Models","date":"2024-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"moment-timeseries-foundation-model/moment","path":"momentfm/models/moment.py","file_url":"https://github.com/moment-timeseries-foundation-model/moment/blob/HEAD/momentfm/models/moment.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":"8ef9dc7505c942b4","code_sha256_prefix":"8ef9dc7505c942b4","mcp_get_code":{"code_sha256":"8ef9dc7505c942b4"}},{"arxiv_id":"2303.12400","arxiv_id_is_arxiv":true,"paper":"/paper/umc-a-unified-bandwidth-efficient-and-multi","title":"UMC: A Unified Bandwidth-efficient and Multi-resolution based Collaborative Perception Framework","date":"2023-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ispc-lab/umc","path":"utils/CoDetModel.py","file_url":"https://github.com/ispc-lab/umc/blob/HEAD/utils/CoDetModel.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":"4891ac0025599128","code_sha256_prefix":"4891ac0025599128","mcp_get_code":{"code_sha256":"4891ac0025599128"}},{"arxiv_id":"2111.00643","arxiv_id_is_arxiv":true,"paper":"/paper/learning-distilled-collaboration-graph-for","title":"Learning Distilled Collaboration Graph for Multi-Agent Perception","date":"2021-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"coperception/coperception","path":"coperception/models/det/DiscoNet.py","file_url":"https://github.com/coperception/coperception/blob/HEAD/coperception/models/det/DiscoNet.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":"2eefc49e3fbd30e1","code_sha256_prefix":"2eefc49e3fbd30e1","mcp_get_code":{"code_sha256":"2eefc49e3fbd30e1"}},{"arxiv_id":"2106.12900","arxiv_id_is_arxiv":true,"paper":"/paper/long-term-cross-adversarial-training-a-robust","title":"Long-term Cross Adversarial Training: A Robust Meta-learning Method for Few-shot Classification Tasks","date":"2021-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Gnomeek/Long-term-Cross-Adversarial-Training","path":"models/classification_heads.py","file_url":"https://github.com/Gnomeek/Long-term-Cross-Adversarial-Training/blob/HEAD/models/classification_heads.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":"f91e7aca05358b42","code_sha256_prefix":"f91e7aca05358b42","mcp_get_code":{"code_sha256":"f91e7aca05358b42"}},{"arxiv_id":"2010.11929","arxiv_id_is_arxiv":true,"paper":"/paper/an-image-is-worth-16x16-words-transformers-1","title":"An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale","date":"2020-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"drumpt/ViT","path":"model.py","file_url":"https://github.com/drumpt/ViT/blob/HEAD/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, drumpt/ViT when it was checked","code_sha256":"2bfce24bf8846119","code_sha256_prefix":"2bfce24bf8846119","mcp_get_code":{"code_sha256":"2bfce24bf8846119"}},{"arxiv_id":"1907.11692","arxiv_id_is_arxiv":true,"paper":"/paper/roberta-a-robustly-optimized-bert-pretraining","title":"RoBERTa: A Robustly Optimized BERT Pretraining Approach","date":"2019-07-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"abdumaa/hiqualprop","path":"full/custom_sequence_classification.py","file_url":"https://github.com/abdumaa/hiqualprop/blob/HEAD/full/custom_sequence_classification.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, abdumaa/hiqualprop when it was checked","code_sha256":"7b8d60647337c2b1","code_sha256_prefix":"7b8d60647337c2b1","mcp_get_code":{"code_sha256":"7b8d60647337c2b1"}}],"record_sha256":"66614741ee1116af4884aa97905e701c384ecd0e749860f2a3c74ce64e5844dc","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}