{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/attend","entry":"Attend","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":6,"n_papers_ran":5,"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":6,"n_samples_ran":5,"n_samples_fingerprinted":1,"n_places":6,"n_places_pointer_only":0,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":5,"unverified":1},"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":"2506.13064","paper":null,"title":"arXiv:2506.13064","date":null,"month_inferred_from_arxiv_id":"2025-06","title_source":null,"repo":"KaiTang-eng/CoIFNet","path":"model/CoIFNet.py","file_url":"https://github.com/KaiTang-eng/CoIFNet/blob/HEAD/model/CoIFNet.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"354eabbd9f11df36","mcp_get_code":{"code_sha256":"354eabbd9f11df36"}},{"arxiv_id":"2407.16448","paper":"/paper/monowad-weather-adaptive-diffusion-model-for","title":"MonoWAD: Weather-Adaptive Diffusion Model for Robust Monocular 3D Object Detection","date":"2024-07-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VisualAIKHU/MonoWAD","path":"visualDet3D/networks/detectors/MonoWAD.py","file_url":"https://github.com/VisualAIKHU/MonoWAD/blob/HEAD/visualDet3D/networks/detectors/MonoWAD.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"360e36fe7ea92c19","mcp_get_code":{"code_sha256":"360e36fe7ea92c19"}},{"arxiv_id":"2407.16171","paper":"/paper/learning-trimodal-relation-for-avqa-with","title":"Learning Trimodal Relation for AVQA with Missing Modality","date":"2024-07-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VisualAIKHU/Missing-AVQA","path":"net_grd_avst/net_avst.py","file_url":"https://github.com/VisualAIKHU/Missing-AVQA/blob/HEAD/net_grd_avst/net_avst.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a461fe5c0890e880","mcp_get_code":{"code_sha256":"a461fe5c0890e880"}},{"arxiv_id":"2212.11972","paper":"/paper/scalable-adaptive-computation-for-iterative","title":"Scalable Adaptive Computation for Iterative Generation","date":"2022-12-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucidrains/recurrent-interface-network-pytorch","path":"rin_pytorch/rin_pytorch.py","file_url":"https://github.com/lucidrains/recurrent-interface-network-pytorch/blob/HEAD/rin_pytorch/rin_pytorch.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"df4d0ae2244e374f","mcp_get_code":{"code_sha256":"df4d0ae2244e374f"}},{"arxiv_id":"2205.14135","paper":"/paper/flashattention-fast-and-memory-efficient","title":"FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awareness","date":"2022-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucidrains/block-recurrent-transformer-pytorch","path":"block_recurrent_transformer_pytorch/block_recurrent_transformer_pytorch.py","file_url":"https://github.com/lucidrains/block-recurrent-transformer-pytorch/blob/HEAD/block_recurrent_transformer_pytorch/block_recurrent_transformer_pytorch.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a91304b317adcfe6","mcp_get_code":{"code_sha256":"a91304b317adcfe6"}},{"arxiv_id":"2006.11239","paper":"/paper/denoising-diffusion-probabilistic-models","title":"Denoising Diffusion Probabilistic Models","date":"2020-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucidrains/make-a-video-pytorch","path":"make_a_video_pytorch/make_a_video.py","file_url":"https://github.com/lucidrains/make-a-video-pytorch/blob/HEAD/make_a_video_pytorch/make_a_video.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2e3e510714db10cd","mcp_get_code":{"code_sha256":"2e3e510714db10cd"}}]}