{"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/get-2d-relative-pos-embed","entry":"get_2d_relative_pos_embed","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":5,"n_papers_ran":0,"n_papers_ran_no_instrument_failure":0,"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":2,"n_samples_ran":0,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":5,"n_places_pointer_only_link_open":2,"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":0,"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":"2409.14538","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, KHU-AGI/HMDC when it was checked","code_sha256":"571021715428528c","code_sha256_prefix":"571021715428528c","mcp_get_code":{"code_sha256":"571021715428528c"}},{"arxiv_id":"2310.16175","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, SLDGroup/G-CASCADE when it was checked","code_sha256":"571021715428528c","code_sha256_prefix":"571021715428528c","mcp_get_code":{"code_sha256":"571021715428528c"}},{"arxiv_id":"2304.04269","arxiv_id_is_arxiv":true,"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":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 KHU-AGI/HMDC, and GitHub detected no licence in that repository when it was checked","code_sha256":"571021715428528c","code_sha256_prefix":"571021715428528c","mcp_get_code":{"code_sha256":"571021715428528c"}},{"arxiv_id":"2211.12941","arxiv_id_is_arxiv":true,"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":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 KHU-AGI/HMDC, and GitHub detected no licence in that repository when it was checked","code_sha256":"571021715428528c","code_sha256_prefix":"571021715428528c","mcp_get_code":{"code_sha256":"571021715428528c"}},{"arxiv_id":"2206.00272","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, gswycf/signgraph when it was checked","code_sha256":"5ae9597352254138","code_sha256_prefix":"5ae9597352254138","mcp_get_code":{"code_sha256":"5ae9597352254138"}}],"record_sha256":"e02b5d5c7163ad9153018166a5111f4246809aea1f2b4493d37289cb77bd02b7","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}