{"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/get-2d-relative-pos-embed","entry":"get_2d_relative_pos_embed","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":5,"n_papers_ran":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":2,"n_samples_ran":0,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":2},"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":"2409.14538","paper":"/paper/towards-model-agnostic-dataset-condensation","title":"Towards Model-Agnostic Dataset Condensation by Heterogeneous Models","date":"2024-09-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KHU-AGI/HMDC","path":"gcn_lib/pos_embed.py","file_url":"https://github.com/KHU-AGI/HMDC/blob/HEAD/gcn_lib/pos_embed.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"571021715428528c","mcp_get_code":{"code_sha256":"571021715428528c"}},{"arxiv_id":"2310.16175","paper":"/paper/g-cascade-efficient-cascaded-graph","title":"G-CASCADE: Efficient Cascaded Graph Convolutional Decoding for 2D Medical Image Segmentation","date":"2023-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SLDGroup/G-CASCADE","path":"lib/gcn_lib/pos_embed.py","file_url":"https://github.com/SLDGroup/G-CASCADE/blob/HEAD/lib/gcn_lib/pos_embed.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"571021715428528c","mcp_get_code":{"code_sha256":"571021715428528c"}},{"arxiv_id":"2304.04269","paper":"/paper/humansd-a-native-skeleton-guided-diffusion","title":"HumanSD: A Native Skeleton-Guided Diffusion Model for Human Image Generation","date":"2023-04-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xiangchenyin/grpose","path":"gcn_lib/pos_embed.py","file_url":"https://github.com/xiangchenyin/grpose/blob/HEAD/gcn_lib/pos_embed.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"571021715428528c","mcp_get_code":{"code_sha256":"571021715428528c"}},{"arxiv_id":"2211.12941","paper":"/paper/eurnet-efficient-multi-range-relational","title":"EurNet: Efficient Multi-Range Relational Modeling of Spatial Multi-Relational Data","date":"2022-11-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hirl-team/eurnet-image","path":"eurnet/utils/position_embed.py","file_url":"https://github.com/hirl-team/eurnet-image/blob/HEAD/eurnet/utils/position_embed.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"571021715428528c","mcp_get_code":{"code_sha256":"571021715428528c"}},{"arxiv_id":"2206.00272","paper":"/paper/vision-gnn-an-image-is-worth-graph-of-nodes","title":"Vision GNN: An Image is Worth Graph of Nodes","date":"2022-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gswycf/signgraph","path":"modules/gcn_lib/torch_vertex.py","file_url":"https://github.com/gswycf/signgraph/blob/HEAD/modules/gcn_lib/torch_vertex.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5ae9597352254138","mcp_get_code":{"code_sha256":"5ae9597352254138"}}]}