{"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/sinusoidalpositionalembedding","entry":"SinusoidalPositionalEmbedding","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":10,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":9,"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":10,"n_samples_ran":9,"n_samples_constructed":8,"n_samples_ran_checked":9,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":7,"n_places":10,"n_places_pointer_only":5,"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":9,"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":"2605.25127","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-25127","title":"PQDT: Pseudo-Query Dual Transformer for Robust Point Cloud Restoration","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"ins-uni-bonn/PQDT","path":"pqdt/models/pq_transformer.py","file_url":"https://github.com/ins-uni-bonn/PQDT/blob/HEAD/pqdt/models/pq_transformer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ins-uni-bonn/PQDT when it was checked","code_sha256":"5ff767a95e6325f2","code_sha256_prefix":"5ff767a95e6325f2","mcp_get_code":{"code_sha256":"5ff767a95e6325f2"}},{"arxiv_id":"2407.05374","arxiv_id_is_arxiv":true,"paper":"/paper/multimodal-prompt-learning-with-missing","title":"Multimodal Prompt Learning with Missing Modalities for Sentiment Analysis and Emotion Recognition","date":"2024-07-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zrguo/MPLMM","path":"src/model.py","file_url":"https://github.com/zrguo/MPLMM/blob/HEAD/src/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"177caab3f8231bc1","code_sha256_prefix":"177caab3f8231bc1","mcp_get_code":{"code_sha256":"177caab3f8231bc1"}},{"arxiv_id":"2404.04557","arxiv_id_is_arxiv":true,"paper":"/paper/learning-instance-aware-correspondences-for","title":"Learning Instance-Aware Correspondences for Robust Multi-Instance Point Cloud Registration in Cluttered Scenes","date":"2024-04-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhiyuanYU134/MIRETR","path":"release/robi/modules.py","file_url":"https://github.com/zhiyuanYU134/MIRETR/blob/HEAD/release/robi/modules.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zhiyuanYU134/MIRETR when it was checked","code_sha256":"a6969607b6b2c1ef","code_sha256_prefix":"a6969607b6b2c1ef","mcp_get_code":{"code_sha256":"a6969607b6b2c1ef"}},{"arxiv_id":"2303.13802","arxiv_id_is_arxiv":true,"paper":"/paper/decoupled-multimodal-distilling-for-emotion","title":"Decoupled Multimodal Distilling for Emotion Recognition","date":"2023-03-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mdswyz/DMD","path":"trains/singleTask/model/dmd.py","file_url":"https://github.com/mdswyz/DMD/blob/HEAD/trains/singleTask/model/dmd.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":"6cde542a176e7ff1","code_sha256_prefix":"6cde542a176e7ff1","mcp_get_code":{"code_sha256":"6cde542a176e7ff1"}},{"arxiv_id":"2109.04096","arxiv_id_is_arxiv":true,"paper":"/paper/a-three-stage-learning-framework-for-low","title":"A Three-Stage Learning Framework for Low-Resource Knowledge-Grounded Dialogue Generation","date":"2021-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"neukg/KAT-TSLF","path":"kat/modeling.py","file_url":"https://github.com/neukg/KAT-TSLF/blob/HEAD/kat/modeling.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":"c77b117cb39bd303","code_sha256_prefix":"c77b117cb39bd303","mcp_get_code":{"code_sha256":"c77b117cb39bd303"}},{"arxiv_id":"2105.11269","arxiv_id_is_arxiv":true,"paper":"/paper/neural-machine-translation-with-monolingual","title":"Neural Machine Translation with Monolingual Translation Memory","date":"2021-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jcyk/copyisallyouneed","path":"generator.py","file_url":"https://github.com/jcyk/copyisallyouneed/blob/HEAD/generator.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, jcyk/copyisallyouneed when it was checked","code_sha256":"a4966f0ea189dad1","code_sha256_prefix":"a4966f0ea189dad1","mcp_get_code":{"code_sha256":"a4966f0ea189dad1"}},{"arxiv_id":"2006.04558","arxiv_id_is_arxiv":true,"paper":"/paper/fastspeech-2-fast-and-high-quality-end-to-end","title":"FastSpeech 2: Fast and High-Quality End-to-End Text to Speech","date":"2020-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"keonlee9420/Comprehensive-Transformer-TTS","path":"model/transformers/transformer_fs2.py","file_url":"https://github.com/keonlee9420/Comprehensive-Transformer-TTS/blob/HEAD/model/transformers/transformer_fs2.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":"3305668af12f291b","code_sha256_prefix":"3305668af12f291b","mcp_get_code":{"code_sha256":"3305668af12f291b"}},{"arxiv_id":"2004.05572","arxiv_id_is_arxiv":true,"paper":"/paper/amr-parsing-via-graph-sequence-iterative","title":"AMR Parsing via Graph-Sequence Iterative Inference","date":"2020-04-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bjascob/amrlib","path":"amrlib/models/parse_gsii/modules/parser.py","file_url":"https://github.com/bjascob/amrlib/blob/HEAD/amrlib/models/parse_gsii/modules/parser.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":"940651e6bf8dc1b0","code_sha256_prefix":"940651e6bf8dc1b0","mcp_get_code":{"code_sha256":"940651e6bf8dc1b0"}},{"arxiv_id":"1906.00295","arxiv_id_is_arxiv":true,"paper":"/paper/190600295","title":"Multimodal Transformer for Unaligned Multimodal Language Sequences","date":"2019-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kenford953/graphcage","path":"src/CrossmodalTransformer.py","file_url":"https://github.com/kenford953/graphcage/blob/HEAD/src/CrossmodalTransformer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, kenford953/graphcage when it was checked","code_sha256":"0056ce87dc2bc16f","code_sha256_prefix":"0056ce87dc2bc16f","mcp_get_code":{"code_sha256":"0056ce87dc2bc16f"}},{"arxiv_id":"1706.03762","arxiv_id_is_arxiv":true,"paper":"/paper/attention-is-all-you-need","title":"Attention Is All You Need","date":"2017-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AssafSinger94/sigmorphon-2020-inflection","path":"src/transformer.py","file_url":"https://github.com/AssafSinger94/sigmorphon-2020-inflection/blob/HEAD/src/transformer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, AssafSinger94/sigmorphon-2020-inflection when it was checked","code_sha256":"30c5a54b1bd6f5fa","code_sha256_prefix":"30c5a54b1bd6f5fa","mcp_get_code":{"code_sha256":"30c5a54b1bd6f5fa"}}],"record_sha256":"ae3182902e17e653b7a7c21c854a72e9324d077ca70a7b38205c49b21f5209da","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}