{"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/augment-data","entry":"augment_data","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":3,"n_papers_ran_instrument_only":4,"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":3,"n_samples_instrument":4,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":7,"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":3,"ran_fixture":1,"ran":3,"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":"2411.04986","arxiv_id_is_arxiv":true,"paper":"/paper/the-semantic-hub-hypothesis-language-models","title":"The Semantic Hub Hypothesis: Language Models Share Semantic Representations Across Languages and Modalities","date":"2024-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZhaofengWu/semantic-hub","path":"multilingual/similarity.py","file_url":"https://github.com/ZhaofengWu/semantic-hub/blob/HEAD/multilingual/similarity.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, ZhaofengWu/semantic-hub when it was checked","code_sha256":"51ceab4ea3055e92","code_sha256_prefix":"51ceab4ea3055e92","mcp_get_code":{"code_sha256":"51ceab4ea3055e92"}},{"arxiv_id":"2410.23996","arxiv_id_is_arxiv":true,"paper":"/paper/an-information-criterion-for-controlled","title":"An Information Criterion for Controlled Disentanglement of Multimodal Data","date":"2024-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uhlerlab/disentangledssl","path":"synthetic_task/algorithms.py","file_url":"https://github.com/uhlerlab/disentangledssl/blob/HEAD/synthetic_task/algorithms.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, uhlerlab/disentangledssl when it was checked","code_sha256":"fbaeedfcd82946ff","code_sha256_prefix":"fbaeedfcd82946ff","mcp_get_code":{"code_sha256":"fbaeedfcd82946ff"}},{"arxiv_id":"2410.19818","arxiv_id_is_arxiv":true,"paper":"/paper/unimts-unified-pre-training-for-motion-time","title":"UniMTS: Unified Pre-training for Motion Time Series","date":"2024-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xiyuanzh/unimts","path":"utils.py","file_url":"https://github.com/xiyuanzh/unimts/blob/HEAD/utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, xiyuanzh/unimts when it was checked","code_sha256":"a7a90479c224d2be","code_sha256_prefix":"a7a90479c224d2be","mcp_get_code":{"code_sha256":"a7a90479c224d2be"}},{"arxiv_id":"1911.03221","arxiv_id_is_arxiv":true,"paper":"/paper/dreem-open-datasets-multi-scored-sleep","title":"Dreem Open Datasets: Multi-Scored Sleep Datasets to compare Human and Automated sleep staging","date":"2019-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Dreem-Organization/dreem-learning-open","path":"dreem_learning_open/datasets/data_augmentation.py","file_url":"https://github.com/Dreem-Organization/dreem-learning-open/blob/HEAD/dreem_learning_open/datasets/data_augmentation.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":"8ae689bec5854251","code_sha256_prefix":"8ae689bec5854251","mcp_get_code":{"code_sha256":"8ae689bec5854251"}},{"arxiv_id":"1908.07898","arxiv_id_is_arxiv":true,"paper":"/paper/190807898","title":"Are We Modeling the Task or the Annotator? An Investigation of Annotator Bias in Natural Language Understanding Datasets","date":"2019-08-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mega002/annotator_bias","path":"obqa_create_data_splits.py","file_url":"https://github.com/mega002/annotator_bias/blob/HEAD/obqa_create_data_splits.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, mega002/annotator_bias when it was checked","code_sha256":"b58e8237e5875f5d","code_sha256_prefix":"b58e8237e5875f5d","mcp_get_code":{"code_sha256":"b58e8237e5875f5d"}},{"arxiv_id":"1906.05841","arxiv_id_is_arxiv":true,"paper":"/paper/deep-reinforcement-learning-for-industrial","title":"Deep Reinforcement Learning for Industrial Insertion Tasks with Visual Inputs and Natural Rewards","date":"2019-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mizolotu/SmartExcavator","path":"select_demonstration.py","file_url":"https://github.com/mizolotu/SmartExcavator/blob/HEAD/select_demonstration.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, mizolotu/SmartExcavator, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"9f1afcb162e28be2","code_sha256_prefix":"9f1afcb162e28be2","mcp_get_code":{"code_sha256":"9f1afcb162e28be2"}},{"arxiv_id":"1905.12019","arxiv_id_is_arxiv":true,"paper":"/paper/unified-probabilistic-deep-continual-learning","title":"Unified Probabilistic Deep Continual Learning through Generative Replay and Open Set Recognition","date":"2019-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MrtnMndt/OCDVAEContinualLearning","path":"lib/Training/augmentation.py","file_url":"https://github.com/MrtnMndt/OCDVAEContinualLearning/blob/HEAD/lib/Training/augmentation.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":"acecd7a6217e354d","code_sha256_prefix":"acecd7a6217e354d","mcp_get_code":{"code_sha256":"acecd7a6217e354d"}}],"record_sha256":"a0f56693a1b7f687df108d280e835c10655d731d1c7b97600e562a4f15df3ad2","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}