{"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/jitter","entry":"jitter","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":9,"n_papers_ran_no_instrument_failure":7,"n_papers_ran_instrument_only":2,"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":7,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":6,"n_places":9,"n_places_pointer_only":1,"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":1,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":4,"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":"2608.17190","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-17190","title":"How smoothing the affinity matrix affects neighborhood preservation in t-SNE","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"aida-ugent/smooth_affinity_tsne","path":"openTSNE/initialization.py","file_url":"https://github.com/aida-ugent/smooth_affinity_tsne/blob/HEAD/openTSNE/initialization.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"57eb0722ae52ab9d","code_sha256_prefix":"57eb0722ae52ab9d","mcp_get_code":{"code_sha256":"57eb0722ae52ab9d"}},{"arxiv_id":"2608.11815","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-11815","title":"Learning with Bilevel-Minimax Optimization for Efficient and Reliable Transfer Attacks","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"callous-youth/BMAT","path":"bmat/bmat_attack.py","file_url":"https://github.com/callous-youth/BMAT/blob/HEAD/bmat/bmat_attack.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9fc5283d840a329b","code_sha256_prefix":"9fc5283d840a329b","mcp_get_code":{"code_sha256":"9fc5283d840a329b"}},{"arxiv_id":"2505.04163","arxiv_id_is_arxiv":true,"paper":"/paper/retrieval-augmented-time-series-forecasting-1","title":"Retrieval Augmented Time Series Forecasting","date":"2025-05-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"archon159/RAFT","path":"utils/augmentation.py","file_url":"https://github.com/archon159/RAFT/blob/HEAD/utils/augmentation.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":"7e91f7d6b90183d5","code_sha256_prefix":"7e91f7d6b90183d5","mcp_get_code":{"code_sha256":"7e91f7d6b90183d5"}},{"arxiv_id":"2302.03133","arxiv_id_is_arxiv":true,"paper":"/paper/domain-adaptation-for-time-series-under","title":"Domain Adaptation for Time Series Under Feature and Label Shifts","date":"2023-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mims-harvard/Raincoat","path":"models/augmentations.py","file_url":"https://github.com/mims-harvard/Raincoat/blob/HEAD/models/augmentations.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":"17fb0ac3baafb100","code_sha256_prefix":"17fb0ac3baafb100","mcp_get_code":{"code_sha256":"17fb0ac3baafb100"}},{"arxiv_id":"2212.09877","arxiv_id_is_arxiv":true,"paper":"/paper/layoutdetr-detection-transformer-is-a-good","title":"LayoutDETR: Detection Transformer Is a Good Multimodal Layout Designer","date":"2022-12-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"salesforce/layoutdetr","path":"generate.py","file_url":"https://github.com/salesforce/layoutdetr/blob/HEAD/generate.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e05b3c91f56c23b1","code_sha256_prefix":"e05b3c91f56c23b1","mcp_get_code":{"code_sha256":"e05b3c91f56c23b1"}},{"arxiv_id":"2212.02233","arxiv_id_is_arxiv":true,"paper":"/paper/wearable-based-human-activity-recognition","title":"Wearable-based Human Activity Recognition with Spatio-Temporal Spiking Neural Networks","date":"2022-11-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"intelligent-computing-lab-yale/snn_har","path":"augmentations.py","file_url":"https://github.com/intelligent-computing-lab-yale/snn_har/blob/HEAD/augmentations.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":"d7d7b890d2db3e04","code_sha256_prefix":"d7d7b890d2db3e04","mcp_get_code":{"code_sha256":"d7d7b890d2db3e04"}},{"arxiv_id":"2206.04916","arxiv_id_is_arxiv":true,"paper":"/paper/patchcomplete-learning-multi-resolution-patch","title":"PatchComplete: Learning Multi-Resolution Patch Priors for 3D Shape Completion on Unseen Categories","date":"2022-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuchenrao/PatchComplete","path":"training.py","file_url":"https://github.com/yuchenrao/PatchComplete/blob/HEAD/training.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, yuchenrao/PatchComplete when it was checked","code_sha256":"ba2981502eee4a81","code_sha256_prefix":"ba2981502eee4a81","mcp_get_code":{"code_sha256":"ba2981502eee4a81"}},{"arxiv_id":"2206.01816","arxiv_id_is_arxiv":true,"paper":"/paper/contrastive-learning-unifies-t-sne-and-umap","title":"From $t$-SNE to UMAP with contrastive learning","date":"2022-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"berenslab/contrastive-ne","path":"src/cne/_cne.py","file_url":"https://github.com/berenslab/contrastive-ne/blob/HEAD/src/cne/_cne.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":"57eb0722ae52ab9d","code_sha256_prefix":"57eb0722ae52ab9d","mcp_get_code":{"code_sha256":"57eb0722ae52ab9d"}},{"arxiv_id":"2007.15951","arxiv_id_is_arxiv":true,"paper":"/paper/an-empirical-survey-of-data-augmentation-for","title":"An Empirical Survey of Data Augmentation for Time Series Classification with Neural Networks","date":"2020-07-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uchidalab/time_series_augmentation","path":"utils/augmentation.py","file_url":"https://github.com/uchidalab/time_series_augmentation/blob/HEAD/utils/augmentation.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7e91f7d6b90183d5","code_sha256_prefix":"7e91f7d6b90183d5","mcp_get_code":{"code_sha256":"7e91f7d6b90183d5"}}],"record_sha256":"3d55f3eaaf5bd6213809e1d189b93cf784cad4989348b097c7bafbd5895218b1","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}