{"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/fill-with-neg-inf","entry":"fill_with_neg_inf","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":13,"n_papers_ran_instrument_only":1,"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":2,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":2,"n_places":14,"n_places_pointer_only":13,"n_places_pointer_only_link_open":9,"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":1,"ran_violates":0,"ran_draft_wrong":1,"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":"2606.06249","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-06249","title":"GRAMformer: Any-Order Modality Interactions via Volumetric Multimodal Cross-Attention","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"ispamm/GRAMformer","path":"gramformer.py.py","file_url":"https://github.com/ispamm/GRAMformer/blob/HEAD/gramformer.py.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from kenford953/graphcage, and GitHub detected no licence in that repository when it was checked","code_sha256":"8f266b9d616de9b9","code_sha256_prefix":"8f266b9d616de9b9","mcp_get_code":{"code_sha256":"8f266b9d616de9b9"}},{"arxiv_id":"2508.05164","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2508-05164","title":"S 2 M-Former: Spiking Symmetric Mixing Branchformer for Brain Auditory Attention Detection","date":null,"month_inferred_from_arxiv_id":"2025-08","title_source":"syntology","repo":"JackieWang9811/S2M-Former","path":"model_zoo/DBPNet.py","file_url":"https://github.com/JackieWang9811/S2M-Former/blob/HEAD/model_zoo/DBPNet.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, JackieWang9811/S2M-Former when it was checked","code_sha256":"8f266b9d616de9b9","code_sha256_prefix":"8f266b9d616de9b9","mcp_get_code":{"code_sha256":"8f266b9d616de9b9"}},{"arxiv_id":"2412.08979","arxiv_id_is_arxiv":true,"paper":"/paper/a-wander-through-the-multimodal-landscape","title":"A Wander Through the Multimodal Landscape: Efficient Transfer Learning via Low-rank Sequence Multimodal Adapter","date":"2024-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zrguo/Wander","path":"models/transformer.py","file_url":"https://github.com/zrguo/Wander/blob/HEAD/models/transformer.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zrguo/Wander when it was checked","code_sha256":"8f266b9d616de9b9","code_sha256_prefix":"8f266b9d616de9b9","mcp_get_code":{"code_sha256":"8f266b9d616de9b9"}},{"arxiv_id":"2412.07121","arxiv_id_is_arxiv":true,"paper":"/paper/bridging-the-gap-for-test-time-multimodal","title":"Bridging the Gap for Test-Time Multimodal Sentiment Analysis","date":"2024-12-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zrguo/casp","path":"modules/transformer.py","file_url":"https://github.com/zrguo/casp/blob/HEAD/modules/transformer.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from kenford953/graphcage, and GitHub detected no licence in that repository when it was checked","code_sha256":"8f266b9d616de9b9","code_sha256_prefix":"8f266b9d616de9b9","mcp_get_code":{"code_sha256":"8f266b9d616de9b9"}},{"arxiv_id":"2411.01409","arxiv_id_is_arxiv":true,"paper":"/paper/classifier-guided-gradient-modulation-for","title":"Classifier-guided Gradient Modulation for Enhanced Multimodal Learning","date":"2024-11-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zrguo/CGGM","path":"modules/transformer.py","file_url":"https://github.com/zrguo/CGGM/blob/HEAD/modules/transformer.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from kenford953/graphcage, and GitHub detected no licence in that repository when it was checked","code_sha256":"8f266b9d616de9b9","code_sha256_prefix":"8f266b9d616de9b9","mcp_get_code":{"code_sha256":"8f266b9d616de9b9"}},{"arxiv_id":"2410.18373","arxiv_id_is_arxiv":true,"paper":"/paper/ugotme-an-embodied-system-for-affective-human","title":"UGotMe: An Embodied System for Affective Human-Robot Interaction","date":null,"month_inferred_from_arxiv_id":"2024-10","title_source":"archive","repo":"lipzh5/amecavle","path":"models/modules/cross_modal_transformer.py","file_url":"https://github.com/lipzh5/amecavle/blob/HEAD/models/modules/cross_modal_transformer.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, lipzh5/amecavle when it was checked","code_sha256":"8f266b9d616de9b9","code_sha256_prefix":"8f266b9d616de9b9","mcp_get_code":{"code_sha256":"8f266b9d616de9b9"}},{"arxiv_id":"2312.14667","arxiv_id_is_arxiv":true,"paper":"/paper/token-level-contrastive-learning-with","title":"Token-Level Contrastive Learning with Modality-Aware Prompting for Multimodal Intent Recognition","date":"2023-12-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thuiar/TCL-MAP","path":"methods/TCL_MAP/SubNets/transformers_encoder/transformer.py","file_url":"https://github.com/thuiar/TCL-MAP/blob/HEAD/methods/TCL_MAP/SubNets/transformers_encoder/transformer.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from kenford953/graphcage, and GitHub detected no licence in that repository when it was checked","code_sha256":"8f266b9d616de9b9","code_sha256_prefix":"8f266b9d616de9b9","mcp_get_code":{"code_sha256":"8f266b9d616de9b9"}},{"arxiv_id":"2210.17444","arxiv_id_is_arxiv":true,"paper":"/paper/multimodal-information-bottleneck-learning","title":"Multimodal Information Bottleneck: Learning Minimal Sufficient Unimodal and Multimodal Representations","date":"2022-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tmacmai/multimodal-information-bottleneck","path":"MIB_github/modules/transformer.py","file_url":"https://github.com/tmacmai/multimodal-information-bottleneck/blob/HEAD/MIB_github/modules/transformer.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from kenford953/graphcage, and GitHub detected no licence in that repository when it was checked","code_sha256":"8f266b9d616de9b9","code_sha256_prefix":"8f266b9d616de9b9","mcp_get_code":{"code_sha256":"8f266b9d616de9b9"}},{"arxiv_id":"2209.00277","arxiv_id_is_arxiv":true,"paper":"/paper/video-guided-curriculum-learning-for-spoken","title":"Video-Guided Curriculum Learning for Spoken Video Grounding","date":"2022-09-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"marmot-xy/spoken-video-grounding","path":"modules/attention_layers.py","file_url":"https://github.com/marmot-xy/spoken-video-grounding/blob/HEAD/modules/attention_layers.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from kenford953/graphcage, and GitHub detected no licence in that repository when it was checked","code_sha256":"8f266b9d616de9b9","code_sha256_prefix":"8f266b9d616de9b9","mcp_get_code":{"code_sha256":"8f266b9d616de9b9"}},{"arxiv_id":"2109.04096","arxiv_id_is_arxiv":true,"paper":"/paper/a-three-stage-learning-framework-for-low","title":"A Three-Stage Learning Framework for Low-Resource Knowledge-Grounded Dialogue Generation","date":"2021-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"neukg/KAT-TSLF","path":"kat/modeling.py","file_url":"https://github.com/neukg/KAT-TSLF/blob/HEAD/kat/modeling.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3dac763ebcde95c6","code_sha256_prefix":"3dac763ebcde95c6","mcp_get_code":{"code_sha256":"3dac763ebcde95c6"}},{"arxiv_id":"2007.00808","arxiv_id_is_arxiv":true,"paper":"/paper/approximate-nearest-neighbor-negative","title":"Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrieval","date":"2020-07-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/ANCE","path":"model/SEED_Encoder/transformer_sentence_encoder.py","file_url":"https://github.com/microsoft/ANCE/blob/HEAD/model/SEED_Encoder/transformer_sentence_encoder.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from kenford953/graphcage, and GitHub detected no licence in that repository when it was checked","code_sha256":"8f266b9d616de9b9","code_sha256_prefix":"8f266b9d616de9b9","mcp_get_code":{"code_sha256":"8f266b9d616de9b9"}},{"arxiv_id":"1906.00295","arxiv_id_is_arxiv":true,"paper":"/paper/190600295","title":"Multimodal Transformer for Unaligned Multimodal Language Sequences","date":"2019-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kenford953/graphcage","path":"src/CrossmodalTransformer.py","file_url":"https://github.com/kenford953/graphcage/blob/HEAD/src/CrossmodalTransformer.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, kenford953/graphcage when it was checked","code_sha256":"8f266b9d616de9b9","code_sha256_prefix":"8f266b9d616de9b9","mcp_get_code":{"code_sha256":"8f266b9d616de9b9"}},{"arxiv_id":"aaai_28059","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_28059","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"sunoh-kim/pps","path":"model/module/mutihead_attention.py","file_url":"https://github.com/sunoh-kim/pps/blob/HEAD/model/module/mutihead_attention.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from kenford953/graphcage, and GitHub detected no licence in that repository when it was checked","code_sha256":"8f266b9d616de9b9","code_sha256_prefix":"8f266b9d616de9b9","mcp_get_code":{"code_sha256":"8f266b9d616de9b9"}},{"arxiv_id":"Pan_Wnet_Audio-Guided_Video_Object_Segmentation_via_Wavelet-Based_Cross-Modal_Denoising_Networks_CVPR_2022_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Pan_Wnet_Audio-Guided_Video_Object_Segmentation_via_Wavelet-Based_Cross-Modal_Denoising_Networks_CVPR_2022_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"asudahkzj/Wnet","path":"models/mult_transformer.py","file_url":"https://github.com/asudahkzj/Wnet/blob/HEAD/models/mult_transformer.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from kenford953/graphcage, and GitHub detected no licence in that repository when it was checked","code_sha256":"8f266b9d616de9b9","code_sha256_prefix":"8f266b9d616de9b9","mcp_get_code":{"code_sha256":"8f266b9d616de9b9"}}],"record_sha256":"af21a45665876cad7bfa3e924b125a7c0b19fd6725c56f35d9828c9aad29b579","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}