{"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/ntuple","entry":"_ntuple","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":17,"n_papers_ran":17,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":17,"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":17,"n_samples_ran":17,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":17,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":17,"n_places_pointer_only":7,"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":17,"ran_fixture":0,"ran":0,"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":"2608.24547","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-24547","title":"From Numerical Simulators of PDEs to Neural Emulators and Back","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"Ceyron/pdequinox","path":"pdequinox/conv/_physics_conv.py","file_url":"https://github.com/Ceyron/pdequinox/blob/HEAD/pdequinox/conv/_physics_conv.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0bdc4e280816adff","code_sha256_prefix":"0bdc4e280816adff","mcp_get_code":{"code_sha256":"0bdc4e280816adff"}},{"arxiv_id":"2509.25033","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-25033","title":"VT-FSL: Bridging Vision and Text with LLMs for Few-Shot Learning","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"peacelwh/VT-FSL","path":"model/visformer.py","file_url":"https://github.com/peacelwh/VT-FSL/blob/HEAD/model/visformer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"671adf4caf15b9fd","code_sha256_prefix":"671adf4caf15b9fd","mcp_get_code":{"code_sha256":"671adf4caf15b9fd"}},{"arxiv_id":"2503.20354","arxiv_id_is_arxiv":true,"paper":"/paper/surgeon-memory-adaptive-fully-test-time","title":"SURGEON: Memory-Adaptive Fully Test-Time Adaptation via Dynamic Activation Sparsity","date":"2025-03-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kadmkbl/SURGEON","path":"methods/das.py","file_url":"https://github.com/kadmkbl/SURGEON/blob/HEAD/methods/das.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, kadmkbl/SURGEON when it was checked","code_sha256":"8a69f6beafdd8b41","code_sha256_prefix":"8a69f6beafdd8b41","mcp_get_code":{"code_sha256":"8a69f6beafdd8b41"}},{"arxiv_id":"2502.11663","arxiv_id_is_arxiv":true,"paper":"/paper/maskgwm-a-generalizable-driving-world-model","title":"MaskGWM: A Generalizable Driving World Model with Video Mask Reconstruction","date":"2025-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SenseTime-FVG/OpenDWM","path":"src/dwm/models/mask_layers.py","file_url":"https://github.com/SenseTime-FVG/OpenDWM/blob/HEAD/src/dwm/models/mask_layers.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"edcc588e588a39da","code_sha256_prefix":"edcc588e588a39da","mcp_get_code":{"code_sha256":"edcc588e588a39da"}},{"arxiv_id":"2411.11471","arxiv_id_is_arxiv":true,"paper":"/paper/generalizable-person-re-identification-via-2","title":"Generalizable Person Re-identification via Balancing Alignment and Uniformity","date":"2024-11-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yoonkicho/bau","path":"bau/models/vit.py","file_url":"https://github.com/yoonkicho/bau/blob/HEAD/bau/models/vit.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"251bb5809692264f","code_sha256_prefix":"251bb5809692264f","mcp_get_code":{"code_sha256":"251bb5809692264f"}},{"arxiv_id":"2406.04303","arxiv_id_is_arxiv":true,"paper":"/paper/vision-lstm-xlstm-as-generic-vision-backbone","title":"Vision-LSTM: xLSTM as Generic Vision Backbone","date":"2024-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NX-AI/vision-lstm","path":"vision_lstm/vision_lstm.py","file_url":"https://github.com/NX-AI/vision-lstm/blob/HEAD/vision_lstm/vision_lstm.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"90263a78b0923104","code_sha256_prefix":"90263a78b0923104","mcp_get_code":{"code_sha256":"90263a78b0923104"}},{"arxiv_id":"2402.12138","arxiv_id_is_arxiv":true,"paper":"/paper/perceiving-longer-sequences-with-bi","title":"Perceiving Longer Sequences With Bi-Directional Cross-Attention Transformers","date":"2024-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mrkshllr/bixt","path":"timm/models/bixt.py","file_url":"https://github.com/mrkshllr/bixt/blob/HEAD/timm/models/bixt.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, mrkshllr/bixt (NOASSERTION)","code_sha256":"65b709c708e72249","code_sha256_prefix":"65b709c708e72249","mcp_get_code":{"code_sha256":"65b709c708e72249"}},{"arxiv_id":"2310.16898","arxiv_id_is_arxiv":true,"paper":"/paper/mcuformer-deploying-vision-tranformers-on-1","title":"MCUFormer: Deploying Vision Transformers on Microcontrollers with Limited Memory","date":"2023-10-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liangyn22/mcuformer","path":"model/supernet_transformer.py","file_url":"https://github.com/liangyn22/mcuformer/blob/HEAD/model/supernet_transformer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, liangyn22/mcuformer when it was checked","code_sha256":"e2c1a7dffcdbe918","code_sha256_prefix":"e2c1a7dffcdbe918","mcp_get_code":{"code_sha256":"e2c1a7dffcdbe918"}},{"arxiv_id":"2305.13500","arxiv_id_is_arxiv":true,"paper":"/paper/learning-emotion-representations-from-verbal-1","title":"Learning Emotion Representations from Verbal and Nonverbal Communication","date":"2023-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Xeaver/EmotionCLIP","path":"src/models/base.py","file_url":"https://github.com/Xeaver/EmotionCLIP/blob/HEAD/src/models/base.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ee61c52d701d0844","code_sha256_prefix":"ee61c52d701d0844","mcp_get_code":{"code_sha256":"ee61c52d701d0844"}},{"arxiv_id":"2210.10716","arxiv_id_is_arxiv":true,"paper":"/paper/croco-self-supervised-pre-training-for-3d","title":"CroCo: Self-Supervised Pre-training for 3D Vision Tasks by Cross-View Completion","date":"2022-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"naver/croco","path":"models/croco.py","file_url":"https://github.com/naver/croco/blob/HEAD/models/croco.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, naver/croco (NOASSERTION)","code_sha256":"cd4d36b9126e53f2","code_sha256_prefix":"cd4d36b9126e53f2","mcp_get_code":{"code_sha256":"cd4d36b9126e53f2"}},{"arxiv_id":"2204.07683","arxiv_id_is_arxiv":true,"paper":"/paper/safe-self-refinement-for-transformer-based","title":"Safe Self-Refinement for Transformer-based Domain Adaptation","date":"2022-04-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tsun/SSRT","path":"model/SSRT.py","file_url":"https://github.com/tsun/SSRT/blob/HEAD/model/SSRT.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"553ee0765abad219","code_sha256_prefix":"553ee0765abad219","mcp_get_code":{"code_sha256":"553ee0765abad219"}},{"arxiv_id":"2203.03844","arxiv_id_is_arxiv":true,"paper":"/paper/dynamic-dual-trainable-bounds-for-ultra-low","title":"Dynamic Dual Trainable Bounds for Ultra-low Precision Super-Resolution Networks","date":"2022-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zysxmu/DDTB","path":"model/quant_ops.py","file_url":"https://github.com/zysxmu/DDTB/blob/HEAD/model/quant_ops.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, zysxmu/DDTB when it was checked","code_sha256":"f824d678bd760ea9","code_sha256_prefix":"f824d678bd760ea9","mcp_get_code":{"code_sha256":"f824d678bd760ea9"}},{"arxiv_id":"2201.04850","arxiv_id_is_arxiv":true,"paper":"/paper/bridgeformer-bridging-video-text-retrieval","title":"Bridging Video-text Retrieval with Multiple Choice Questions","date":"2022-01-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"towhee-io/towhee","path":"towhee/models/bridgeformer/bridge_former_training_block.py","file_url":"https://github.com/towhee-io/towhee/blob/HEAD/towhee/models/bridgeformer/bridge_former_training_block.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0ef9a056059a14d9","code_sha256_prefix":"0ef9a056059a14d9","mcp_get_code":{"code_sha256":"0ef9a056059a14d9"}},{"arxiv_id":"2201.04676","arxiv_id_is_arxiv":true,"paper":"/paper/uniformer-unified-transformer-for-efficient-1","title":"UniFormer: Unified Transformer for Efficient Spatiotemporal Representation Learning","date":"2022-01-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"towhee-io/towhee","path":"towhee/models/uniformer/uniformer.py","file_url":"https://github.com/towhee-io/towhee/blob/HEAD/towhee/models/uniformer/uniformer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2f3cf06bc7cb9815","code_sha256_prefix":"2f3cf06bc7cb9815","mcp_get_code":{"code_sha256":"2f3cf06bc7cb9815"}},{"arxiv_id":"2105.14432","arxiv_id_is_arxiv":true,"paper":"/paper/transformer-based-deep-image-matching-for","title":"TransMatcher: Deep Image Matching Through Transformers for Generalizable Person Re-identification","date":"2021-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JDAI-CV/fast-reid","path":"fastreid/modeling/backbones/vision_transformer.py","file_url":"https://github.com/JDAI-CV/fast-reid/blob/HEAD/fastreid/modeling/backbones/vision_transformer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"019554bbb3a9809d","code_sha256_prefix":"019554bbb3a9809d","mcp_get_code":{"code_sha256":"019554bbb3a9809d"}},{"arxiv_id":"aaai_28529","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_28529","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"AlienZhang1996/S2WAT","path":"model/s2wat.py","file_url":"https://github.com/AlienZhang1996/S2WAT/blob/HEAD/model/s2wat.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, AlienZhang1996/S2WAT when it was checked","code_sha256":"155a78c7098ac4ff","code_sha256_prefix":"155a78c7098ac4ff","mcp_get_code":{"code_sha256":"155a78c7098ac4ff"}},{"arxiv_id":"Sun_EntropyMark_Towards_More_Harmless_Backdoor_Watermark_via_Entropy-based_Constraint_for_CVPR_2025_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Sun_EntropyMark_Towards_More_Harmless_Backdoor_Watermark_via_Entropy-based_Constraint_for_CVPR_2025_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"AaronSun2000/EntropyMark","path":"SSBW.py","file_url":"https://github.com/AaronSun2000/EntropyMark/blob/HEAD/SSBW.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, AaronSun2000/EntropyMark when it was checked","code_sha256":"2996c83a788017d7","code_sha256_prefix":"2996c83a788017d7","mcp_get_code":{"code_sha256":"2996c83a788017d7"}}],"record_sha256":"bbdea0756038c40a2537677c2754ad220989d07600ed7e3e70a5c5c8ceedc545","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}