{"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/rotation","entry":"rotation","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":8,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":5,"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":9,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":0,"n_samples_unverified":4,"n_samples_fingerprinted":3,"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":0,"ran_fixture":0,"ran":4,"unverified":4},"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":"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":"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":"3e06f3c627157901","code_sha256_prefix":"3e06f3c627157901","mcp_get_code":{"code_sha256":"3e06f3c627157901"}},{"arxiv_id":"2308.14575","arxiv_id_is_arxiv":true,"paper":"/paper/referring-image-segmentation-using-text","title":"Referring Image Segmentation Using Text Supervision","date":"2023-08-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fawnliu/tris","path":"IRNet/torch_utils.py","file_url":"https://github.com/fawnliu/tris/blob/HEAD/IRNet/torch_utils.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":"64bd96dab205fe39","code_sha256_prefix":"64bd96dab205fe39","mcp_get_code":{"code_sha256":"64bd96dab205fe39"}},{"arxiv_id":"2103.08273","arxiv_id_is_arxiv":true,"paper":"/paper/refine-myself-by-teaching-myself-feature","title":"Refine Myself by Teaching Myself: Feature Refinement via Self-Knowledge Distillation","date":"2021-03-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MingiJi/FRSKD","path":"classification/distill_loss/sla.py","file_url":"https://github.com/MingiJi/FRSKD/blob/HEAD/classification/distill_loss/sla.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cb064edf7991a3ec","code_sha256_prefix":"cb064edf7991a3ec","mcp_get_code":{"code_sha256":"cb064edf7991a3ec"}},{"arxiv_id":"2010.05272","arxiv_id_is_arxiv":true,"paper":"/paper/if-defense-3d-adversarial-point-cloud-defense-1","title":"IF-Defense: 3D Adversarial Point Cloud Defense via Implicit Function based Restoration","date":"2020-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KaidongLi/pytorch-LatticePointClassifier","path":"isometry_init.py","file_url":"https://github.com/KaidongLi/pytorch-LatticePointClassifier/blob/HEAD/isometry_init.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":"46bfcc9fc0b2f12b","code_sha256_prefix":"46bfcc9fc0b2f12b","mcp_get_code":{"code_sha256":"46bfcc9fc0b2f12b"}},{"arxiv_id":"2008.10545","arxiv_id_is_arxiv":true,"paper":"/paper/products-10k-a-large-scale-product","title":"Products-10K: A Large-scale Product Recognition Dataset","date":"2020-08-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"marcoripa96/clothing_recommendation","path":"bot/utils/data_augmentation.py","file_url":"https://github.com/marcoripa96/clothing_recommendation/blob/HEAD/bot/utils/data_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":"4c90db733770334c","code_sha256_prefix":"4c90db733770334c","mcp_get_code":{"code_sha256":"4c90db733770334c"}},{"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":"ec568a4fd5c0ca0c","code_sha256_prefix":"ec568a4fd5c0ca0c","mcp_get_code":{"code_sha256":"ec568a4fd5c0ca0c"}},{"arxiv_id":"2006.05338","arxiv_id_is_arxiv":true,"paper":"/paper/towards-good-practices-for-data-augmentation","title":"On Data Augmentation for GAN Training","date":"2020-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sutd-visual-computing-group/dag-gans","path":"pytorch/utils.py","file_url":"https://github.com/sutd-visual-computing-group/dag-gans/blob/HEAD/pytorch/utils.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":"a5418a6b54ead8e0","code_sha256_prefix":"a5418a6b54ead8e0","mcp_get_code":{"code_sha256":"a5418a6b54ead8e0"}},{"arxiv_id":"2006.05338","arxiv_id_is_arxiv":true,"paper":"/paper/towards-good-practices-for-data-augmentation","title":"On Data Augmentation for GAN Training","date":"2020-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sutd-visual-computing-group/dag-gans","path":"tensorflow/utils.py","file_url":"https://github.com/sutd-visual-computing-group/dag-gans/blob/HEAD/tensorflow/utils.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":"db6dd49f9dfced2f","code_sha256_prefix":"db6dd49f9dfced2f","mcp_get_code":{"code_sha256":"db6dd49f9dfced2f"}},{"arxiv_id":"2003.04784","arxiv_id_is_arxiv":true,"paper":"/paper/reconstruction-of-3d-flight-trajectories-from","title":"Reconstruction of 3D flight trajectories from ad-hoc camera networks","date":"2020-03-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CenekAlbl/mvus","path":"multiviewunsynch/tools/util.py","file_url":"https://github.com/CenekAlbl/mvus/blob/HEAD/multiviewunsynch/tools/util.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, CenekAlbl/mvus (NOASSERTION)","code_sha256":"c215df5e3f201dcd","code_sha256_prefix":"c215df5e3f201dcd","mcp_get_code":{"code_sha256":"c215df5e3f201dcd"}}],"record_sha256":"0d79830bb15a46084b0bf33d63b5006606fe9e3512870ebdd7d149f8cff1403f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}