{"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/attentionpooling","entry":"AttentionPooling","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":9,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":7,"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":9,"n_samples_ran":7,"n_samples_constructed":5,"n_samples_ran_checked":7,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":9,"n_places_pointer_only":4,"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":7,"unverified":2},"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.21961","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-21961","title":"VegSim: A Geospatial World Model for Scenario-Conditioned Vegetation Simulation","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"arco-group/vegsim","path":"src/models/world_model.py","file_url":"https://github.com/arco-group/vegsim/blob/HEAD/src/models/world_model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"28315f3d1207778b","code_sha256_prefix":"28315f3d1207778b","mcp_get_code":{"code_sha256":"28315f3d1207778b"}},{"arxiv_id":"2604.22826","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-22826","title":"Shape: A Self-Supervised 3D Geometry Foundation Model for Industrial CAD Analysis","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"simd-ai/shape","path":"shape_foundation/models/gaot_backbone.py","file_url":"https://github.com/simd-ai/shape/blob/HEAD/shape_foundation/models/gaot_backbone.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ff9afc61fb306bc7","code_sha256_prefix":"ff9afc61fb306bc7","mcp_get_code":{"code_sha256":"ff9afc61fb306bc7"}},{"arxiv_id":"2603.14889","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-14889","title":"SDiaReward: Modeling and Benchmarking Spoken Dialogue Rewards with Modality and Colloquialness","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"MM-Speech/SDiaReward","path":"model/modeling_qwen_omni_thinker_reward.py","file_url":"https://github.com/MM-Speech/SDiaReward/blob/HEAD/model/modeling_qwen_omni_thinker_reward.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":"56d866d35d4af648","code_sha256_prefix":"56d866d35d4af648","mcp_get_code":{"code_sha256":"56d866d35d4af648"}},{"arxiv_id":"2603.11950","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-11950","title":"Learning Transferable Sensor Models via Language-Informed Pretraining","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"yuc0805/SLIP","path":"modeling_slip.py","file_url":"https://github.com/yuc0805/SLIP/blob/HEAD/modeling_slip.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, yuc0805/SLIP when it was checked","code_sha256":"bda46ca17458b649","code_sha256_prefix":"bda46ca17458b649","mcp_get_code":{"code_sha256":"bda46ca17458b649"}},{"arxiv_id":"2310.03502","arxiv_id_is_arxiv":true,"paper":"/paper/kandinsky-an-improved-text-to-image-synthesis","title":"Kandinsky: an Improved Text-to-Image Synthesis with Image Prior and Latent Diffusion","date":"2023-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ai-forever/Kandinsky-2","path":"kandinsky2/model/text2im_model2_1.py","file_url":"https://github.com/ai-forever/Kandinsky-2/blob/HEAD/kandinsky2/model/text2im_model2_1.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f60bca05893fa428","code_sha256_prefix":"f60bca05893fa428","mcp_get_code":{"code_sha256":"f60bca05893fa428"}},{"arxiv_id":"2205.11487","arxiv_id_is_arxiv":true,"paper":"/paper/photorealistic-text-to-image-diffusion-models","title":"Photorealistic Text-to-Image Diffusion Models with Deep Language Understanding","date":"2022-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deep-floyd/if","path":"deepfloyd_if/model/unet.py","file_url":"https://github.com/deep-floyd/if/blob/HEAD/deepfloyd_if/model/unet.py","status":"ran","verification_level":1,"contract_check":null,"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, deep-floyd/if (NOASSERTION)","code_sha256":"572c310ea05bf309","code_sha256_prefix":"572c310ea05bf309","mcp_get_code":{"code_sha256":"572c310ea05bf309"}},{"arxiv_id":"2109.01134","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-prompt-for-vision-language-models","title":"Learning to Prompt for Vision-Language Models","date":"2021-09-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hhenryd/tap","path":"trainers/TAP.py","file_url":"https://github.com/hhenryd/tap/blob/HEAD/trainers/TAP.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":"e8079fe48af584cb","code_sha256_prefix":"e8079fe48af584cb","mcp_get_code":{"code_sha256":"e8079fe48af584cb"}},{"arxiv_id":"2108.09274","arxiv_id_is_arxiv":true,"paper":"/paper/mg-gan-a-multi-generator-model-preventing-out","title":"MG-GAN: A Multi-Generator Model Preventing Out-of-Distribution Samples in Pedestrian Trajectory Prediction","date":"2021-08-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"selflein/MG-GAN","path":"mggan/model/modules/discriminators.py","file_url":"https://github.com/selflein/MG-GAN/blob/HEAD/mggan/model/modules/discriminators.py","status":"unverified","verification_level":0,"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, selflein/MG-GAN when it was checked","code_sha256":"c13ea505436bde97","code_sha256_prefix":"c13ea505436bde97","mcp_get_code":{"code_sha256":"c13ea505436bde97"}},{"arxiv_id":"2103.02406","arxiv_id_is_arxiv":true,"paper":"/paper/multi-attentional-deepfake-detection","title":"Multi-attentional Deepfake Detection","date":"2021-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yoctta/multiple-attention","path":"models/MAT.py","file_url":"https://github.com/yoctta/multiple-attention/blob/HEAD/models/MAT.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, yoctta/multiple-attention when it was checked","code_sha256":"020e1d7ced206b80","code_sha256_prefix":"020e1d7ced206b80","mcp_get_code":{"code_sha256":"020e1d7ced206b80"}}],"record_sha256":"511918794b5f66679f2fc6dcc9b0023c01264fd80748d53813b58da6d11a5a4b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}