{"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/head","entry":"Head","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":14,"n_papers_ran":14,"n_papers_ran_no_instrument_failure":14,"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":14,"n_samples_ran":14,"n_samples_constructed":11,"n_samples_ran_checked":14,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":4,"n_places":14,"n_places_pointer_only":6,"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":14,"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":"2606.30875","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-30875","title":"The Label Imitation Game: Turing Test Network for Zero-Shot Pseudo-Label Pruning","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"voxel51/ttn","path":"ttn/ttn_model.py","file_url":"https://github.com/voxel51/ttn/blob/HEAD/ttn/ttn_model.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, voxel51/ttn when it was checked","code_sha256":"e8fb33b6abc31592","code_sha256_prefix":"e8fb33b6abc31592","mcp_get_code":{"code_sha256":"e8fb33b6abc31592"}},{"arxiv_id":"2605.22898","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-22898","title":"FIRMA: FIbonacci Ring Model Aggregation for Privacy-preserving Federated Learning","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"Hedjrachid/FIRMA","path":"fibfl/fibfl.py","file_url":"https://github.com/Hedjrachid/FIRMA/blob/HEAD/fibfl/fibfl.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":"b1b224be69b0ae34","code_sha256_prefix":"b1b224be69b0ae34","mcp_get_code":{"code_sha256":"b1b224be69b0ae34"}},{"arxiv_id":"2503.07598","arxiv_id_is_arxiv":true,"paper":"/paper/vace-all-in-one-video-creation-and-editing","title":"VACE: All-in-One Video Creation and Editing","date":"2025-03-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wan-video/wan2.1","path":"wan/modules/vace_model.py","file_url":"https://github.com/wan-video/wan2.1/blob/HEAD/wan/modules/vace_model.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":"9227be90bae9b073","code_sha256_prefix":"9227be90bae9b073","mcp_get_code":{"code_sha256":"9227be90bae9b073"}},{"arxiv_id":"2503.00205","arxiv_id_is_arxiv":true,"paper":"/paper/analoggenie-a-generative-engine-for-automatic","title":"AnalogGenie: A Generative Engine for Automatic Discovery of Analog Circuit Topologies","date":"2025-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xz-group/analoggenie","path":"Models/GPT.py","file_url":"https://github.com/xz-group/analoggenie/blob/HEAD/Models/GPT.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":"5b24f9a47db65c0b","code_sha256_prefix":"5b24f9a47db65c0b","mcp_get_code":{"code_sha256":"5b24f9a47db65c0b"}},{"arxiv_id":"2406.04340","arxiv_id_is_arxiv":true,"paper":"/paper/glace-global-local-accelerated-coordinate","title":"GLACE: Global Local Accelerated Coordinate Encoding","date":"2024-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cvg/glace","path":"ace_network.py","file_url":"https://github.com/cvg/glace/blob/HEAD/ace_network.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, cvg/glace (NOASSERTION)","code_sha256":"cf368414e22b07b7","code_sha256_prefix":"cf368414e22b07b7","mcp_get_code":{"code_sha256":"cf368414e22b07b7"}},{"arxiv_id":"2402.17229","arxiv_id_is_arxiv":true,"paper":"/paper/preserving-fairness-generalization-in","title":"Preserving Fairness Generalization in Deepfake Detection","date":"2024-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Purdue-M2/Fairness-Generalization","path":"training/detectors/fair_df_detector.py","file_url":"https://github.com/Purdue-M2/Fairness-Generalization/blob/HEAD/training/detectors/fair_df_detector.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":"a961635e87f5c559","code_sha256_prefix":"a961635e87f5c559","mcp_get_code":{"code_sha256":"a961635e87f5c559"}},{"arxiv_id":"2308.12216","arxiv_id_is_arxiv":true,"paper":"/paper/sg-former-self-guided-transformer-with","title":"SG-Former: Self-guided Transformer with Evolving Token Reallocation","date":"2023-08-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"OliverRensu/SG-Former","path":"sgformer.py","file_url":"https://github.com/OliverRensu/SG-Former/blob/HEAD/sgformer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, OliverRensu/SG-Former when it was checked","code_sha256":"69320a69582cce14","code_sha256_prefix":"69320a69582cce14","mcp_get_code":{"code_sha256":"69320a69582cce14"}},{"arxiv_id":"2307.08579","arxiv_id_is_arxiv":true,"paper":"/paper/scale-aware-modulation-meet-transformer","title":"Scale-Aware Modulation Meet Transformer","date":"2023-07-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AFeng-x/SMT","path":"models/smt.py","file_url":"https://github.com/AFeng-x/SMT/blob/HEAD/models/smt.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b9110ad1b233913a","code_sha256_prefix":"b9110ad1b233913a","mcp_get_code":{"code_sha256":"b9110ad1b233913a"}},{"arxiv_id":"2303.08010","arxiv_id_is_arxiv":true,"paper":"/paper/window-based-early-exit-cascades-for","title":"Window-Based Early-Exit Cascades for Uncertainty Estimation: When Deep Ensembles are More Efficient than Single Models","date":"2023-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"keras-team/keras","path":"keras/src/applications/convnext.py","file_url":"https://github.com/keras-team/keras/blob/HEAD/keras/src/applications/convnext.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":"8566faf0283e84b5","code_sha256_prefix":"8566faf0283e84b5","mcp_get_code":{"code_sha256":"8566faf0283e84b5"}},{"arxiv_id":"2209.00588","arxiv_id_is_arxiv":true,"paper":"/paper/transformers-are-sample-efficient-world","title":"Transformers are Sample-Efficient World Models","date":"2022-09-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eloialonso/iris","path":"src/models/world_model.py","file_url":"https://github.com/eloialonso/iris/blob/HEAD/src/models/world_model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, eloialonso/iris, is not in the permissive set Syntology serves inline","code_sha256":"b4868fbed7dce84a","code_sha256_prefix":"b4868fbed7dce84a","mcp_get_code":{"code_sha256":"b4868fbed7dce84a"}},{"arxiv_id":"2105.01601","arxiv_id_is_arxiv":true,"paper":"/paper/mlp-mixer-an-all-mlp-architecture-for-vision","title":"MLP-Mixer: An all-MLP Architecture for Vision","date":"2021-05-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KiUngSong/Vision","path":"MLP_Mixer/MLP_Mixer.py","file_url":"https://github.com/KiUngSong/Vision/blob/HEAD/MLP_Mixer/MLP_Mixer.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, KiUngSong/Vision when it was checked","code_sha256":"4f78c8e4945a1b8d","code_sha256_prefix":"4f78c8e4945a1b8d","mcp_get_code":{"code_sha256":"4f78c8e4945a1b8d"}},{"arxiv_id":"2103.10814","arxiv_id_is_arxiv":true,"paper":"/paper/skeleton-merger-an-unsupervised-aligned","title":"Skeleton Merger: an Unsupervised Aligned Keypoint Detector","date":"2021-03-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eliphatfs/SkeletonMerger","path":"merger/merger_net.py","file_url":"https://github.com/eliphatfs/SkeletonMerger/blob/HEAD/merger/merger_net.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3c1cee99418ac507","code_sha256_prefix":"3c1cee99418ac507","mcp_get_code":{"code_sha256":"3c1cee99418ac507"}},{"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":"KiUngSong/Vision","path":"ViT/ViT_pytorch.py","file_url":"https://github.com/KiUngSong/Vision/blob/HEAD/ViT/ViT_pytorch.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, KiUngSong/Vision when it was checked","code_sha256":"c694be0d1f02316c","code_sha256_prefix":"c694be0d1f02316c","mcp_get_code":{"code_sha256":"c694be0d1f02316c"}},{"arxiv_id":"1706.03762","arxiv_id_is_arxiv":true,"paper":"/paper/attention-is-all-you-need","title":"Attention Is All You Need","date":"2017-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"glouppe/info8010-deep-learning","path":"code/gpt/gpt-v7.py","file_url":"https://github.com/glouppe/info8010-deep-learning/blob/HEAD/code/gpt/gpt-v7.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"aaf7ff4e43d512a1","code_sha256_prefix":"aaf7ff4e43d512a1","mcp_get_code":{"code_sha256":"aaf7ff4e43d512a1"}}],"record_sha256":"0db1df6a6af653e07767b8c0f6689c729dd2cc6e23dde71d4a2548806cd9bf57","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}