{"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/attend","entry":"Attend","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":6,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":5,"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":6,"n_samples_ran":5,"n_samples_constructed":4,"n_samples_ran_checked":5,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":1,"n_places":6,"n_places_pointer_only":0,"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":5,"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":"2506.13064","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"354eabbd9f11df36","code_sha256_prefix":"354eabbd9f11df36","mcp_get_code":{"code_sha256":"354eabbd9f11df36"}},{"arxiv_id":"2407.16448","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"360e36fe7ea92c19","code_sha256_prefix":"360e36fe7ea92c19","mcp_get_code":{"code_sha256":"360e36fe7ea92c19"}},{"arxiv_id":"2407.16171","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a461fe5c0890e880","code_sha256_prefix":"a461fe5c0890e880","mcp_get_code":{"code_sha256":"a461fe5c0890e880"}},{"arxiv_id":"2212.11972","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"df4d0ae2244e374f","code_sha256_prefix":"df4d0ae2244e374f","mcp_get_code":{"code_sha256":"df4d0ae2244e374f"}},{"arxiv_id":"2205.14135","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a91304b317adcfe6","code_sha256_prefix":"a91304b317adcfe6","mcp_get_code":{"code_sha256":"a91304b317adcfe6"}},{"arxiv_id":"2006.11239","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2e3e510714db10cd","code_sha256_prefix":"2e3e510714db10cd","mcp_get_code":{"code_sha256":"2e3e510714db10cd"}}],"record_sha256":"fbd858d9dfefe6ac4c3ce6bf816a4ff619d6401027417b9171e1a3f879ec723e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}