{"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/learnablepositionalencoding","entry":"LearnablePositionalEncoding","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":7,"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":8,"n_samples_ran":8,"n_samples_constructed":3,"n_samples_ran_checked":8,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":2,"n_places":8,"n_places_pointer_only":6,"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":8,"unverified":0},"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":"2601.18392","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-18392","title":"Efficient Complex-Valued Vision Transformers for MRI Classification Directly from k-Space","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"TIO-IKIM/kViT","path":"src/model/cTransformer.py","file_url":"https://github.com/TIO-IKIM/kViT/blob/HEAD/src/model/cTransformer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"well_formed","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, TIO-IKIM/kViT (NOASSERTION)","code_sha256":"4a1d1bcdce05e4b0","code_sha256_prefix":"4a1d1bcdce05e4b0","mcp_get_code":{"code_sha256":"4a1d1bcdce05e4b0"}},{"arxiv_id":"2501.00910","arxiv_id_is_arxiv":true,"paper":"/paper/population-aware-diffusion-for-time-series","title":"Population Aware Diffusion for Time Series Generation","date":"2025-01-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wmd3i/PaD-TS","path":"Model.py","file_url":"https://github.com/wmd3i/PaD-TS/blob/HEAD/Model.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, wmd3i/PaD-TS when it was checked","code_sha256":"9d9b6c61504ce60d","code_sha256_prefix":"9d9b6c61504ce60d","mcp_get_code":{"code_sha256":"9d9b6c61504ce60d"}},{"arxiv_id":"2412.12146","arxiv_id_is_arxiv":true,"paper":"/paper/generative-modeling-and-data-augmentation-for","title":"Generative Modeling and Data Augmentation for Power System Production Simulation","date":"2024-12-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Becklishious/NeurIPS2024","path":"TS-Diffusion/Models/interpretable_diffusion/gaussian_diffusion.py","file_url":"https://github.com/Becklishious/NeurIPS2024/blob/HEAD/TS-Diffusion/Models/interpretable_diffusion/gaussian_diffusion.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Becklishious/NeurIPS2024 when it was checked","code_sha256":"b15c5a5fdf22e554","code_sha256_prefix":"b15c5a5fdf22e554","mcp_get_code":{"code_sha256":"b15c5a5fdf22e554"}},{"arxiv_id":"2406.10354","arxiv_id_is_arxiv":true,"paper":"/paper/sigdiffusions-score-based-diffusion-models","title":"SigDiffusions: Score-Based Diffusion Models for Long Time Series via Log-Signature Embeddings","date":"2024-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Barb0ra/SigDiffusions","path":"model.py","file_url":"https://github.com/Barb0ra/SigDiffusions/blob/HEAD/model.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, Barb0ra/SigDiffusions when it was checked","code_sha256":"89e0fe61f90c79f6","code_sha256_prefix":"89e0fe61f90c79f6","mcp_get_code":{"code_sha256":"89e0fe61f90c79f6"}},{"arxiv_id":"2406.10354","arxiv_id_is_arxiv":true,"paper":"/paper/sigdiffusions-score-based-diffusion-models","title":"SigDiffusions: Score-Based Diffusion Models for Long Time Series via Log-Signature Embeddings","date":"2024-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Y-debug-sys/Diffusion-TS","path":"Models/interpretable_diffusion/gaussian_diffusion.py","file_url":"https://github.com/Y-debug-sys/Diffusion-TS/blob/HEAD/Models/interpretable_diffusion/gaussian_diffusion.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":"d0d1a8d43d381f8c","code_sha256_prefix":"d0d1a8d43d381f8c","mcp_get_code":{"code_sha256":"d0d1a8d43d381f8c"}},{"arxiv_id":"2405.11905","arxiv_id_is_arxiv":true,"paper":"/paper/csta-cnn-based-spatiotemporal-attention-for","title":"CSTA: CNN-based Spatiotemporal Attention for Video Summarization","date":"2024-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thswodnjs3/CSTA","path":"models/ResNet.py","file_url":"https://github.com/thswodnjs3/CSTA/blob/HEAD/models/ResNet.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":"dcdf2add2e19b043","code_sha256_prefix":"dcdf2add2e19b043","mcp_get_code":{"code_sha256":"dcdf2add2e19b043"}},{"arxiv_id":"2403.06197","arxiv_id_is_arxiv":true,"paper":"/paper/drfuse-learning-disentangled-representation","title":"DrFuse: Learning Disentangled Representation for Clinical Multi-Modal Fusion with Missing Modality and Modal Inconsistency","date":"2024-03-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dorothy-yao/drfuse","path":"models/drfuse.py","file_url":"https://github.com/dorothy-yao/drfuse/blob/HEAD/models/drfuse.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, dorothy-yao/drfuse when it was checked","code_sha256":"2f2b8aeee02d8495","code_sha256_prefix":"2f2b8aeee02d8495","mcp_get_code":{"code_sha256":"2f2b8aeee02d8495"}},{"arxiv_id":"2010.04505","arxiv_id_is_arxiv":true,"paper":"/paper/self-paced-learning-for-neural-machine","title":"Self-Paced Learning for Neural Machine Translation","date":"2020-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wanyu2018umac/Self-Paced-Learning-for-Neural-Machine-Translation","path":"train/train_single.py","file_url":"https://github.com/wanyu2018umac/Self-Paced-Learning-for-Neural-Machine-Translation/blob/HEAD/train/train_single.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, wanyu2018umac/Self-Paced-Learning-for-Neural-Machine-Translation when it was checked","code_sha256":"f984714f0caadb11","code_sha256_prefix":"f984714f0caadb11","mcp_get_code":{"code_sha256":"f984714f0caadb11"}}],"record_sha256":"6c07537c280b84c024aae20856a7e7ab8944a824bd4d2a1d58660bf5ba58c302","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}