{"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/subsample-dataset","entry":"subsample_dataset","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":6,"n_papers_ran":3,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":1,"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":6,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":1,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":2,"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":1,"ran_fixture":0,"ran":2,"unverified":3},"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":"2602.13024","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-13024","title":"FedHENet: A Frugal Federated Learning Framework for Heterogeneous Environments","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"AlejandroDopico2/FedHENet","path":"fedhenet/datasets.py","file_url":"https://github.com/AlejandroDopico2/FedHENet/blob/HEAD/fedhenet/datasets.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":"6eb9a83c86aba72c","code_sha256_prefix":"6eb9a83c86aba72c","mcp_get_code":{"code_sha256":"6eb9a83c86aba72c"}},{"arxiv_id":"2408.13492","arxiv_id_is_arxiv":true,"paper":"/paper/online-continuous-generalized-category","title":"Online Continuous Generalized Category Discovery","date":"2024-08-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"khu-agi/ocgcd","path":"dataset/imagenet.py","file_url":"https://github.com/khu-agi/ocgcd/blob/HEAD/dataset/imagenet.py","status":"unverified","verification_level":0,"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, khu-agi/ocgcd when it was checked","code_sha256":"b3b459956a66c45c","code_sha256_prefix":"b3b459956a66c45c","mcp_get_code":{"code_sha256":"b3b459956a66c45c"}},{"arxiv_id":"2405.06283","arxiv_id_is_arxiv":true,"paper":"/paper/novel-class-discovery-for-ultra-fine-grained","title":"Novel Class Discovery for Ultra-Fine-Grained Visual Categorization","date":"2024-05-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SSDUT-Caiyq/UFG-NCD","path":"FineGrained/cifar.py","file_url":"https://github.com/SSDUT-Caiyq/UFG-NCD/blob/HEAD/FineGrained/cifar.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, SSDUT-Caiyq/UFG-NCD when it was checked","code_sha256":"6b976c03af7e2ffc","code_sha256_prefix":"6b976c03af7e2ffc","mcp_get_code":{"code_sha256":"6b976c03af7e2ffc"}},{"arxiv_id":"2104.08453","arxiv_id_is_arxiv":true,"paper":"/paper/attacking-text-classifiers-via-sentence","title":"R&R: Metric-guided Adversarial Sentence Generation","date":"2021-04-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DAI-Lab/fibber","path":"fibber/datasets/dataset_utils.py","file_url":"https://github.com/DAI-Lab/fibber/blob/HEAD/fibber/datasets/dataset_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":"6c6a9fdb373fe331","code_sha256_prefix":"6c6a9fdb373fe331","mcp_get_code":{"code_sha256":"6c6a9fdb373fe331"}},{"arxiv_id":"1909.13719","arxiv_id_is_arxiv":true,"paper":"/paper/randaugment-practical-data-augmentation-with","title":"RandAugment: Practical automated data augmentation with a reduced search space","date":"2019-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhanghang1989/fast-autoaug-torch","path":"utils.py","file_url":"https://github.com/zhanghang1989/fast-autoaug-torch/blob/HEAD/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":"50c88035541deccb","code_sha256_prefix":"50c88035541deccb","mcp_get_code":{"code_sha256":"50c88035541deccb"}},{"arxiv_id":"Huang_AnomalyNCD_Towards_Novel_Anomaly_Class_Discovery_in_Industrial_Scenarios_CVPR_2025_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Huang_AnomalyNCD_Towards_Novel_Anomaly_Class_Discovery_in_Industrial_Scenarios_CVPR_2025_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"HUST-SLOW/AnomalyNCD","path":"datasets/dataset.py","file_url":"https://github.com/HUST-SLOW/AnomalyNCD/blob/HEAD/datasets/dataset.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":"2ac0505fadab3173","code_sha256_prefix":"2ac0505fadab3173","mcp_get_code":{"code_sha256":"2ac0505fadab3173"}}],"record_sha256":"367552db21402dcaa687af53e96ca2b627ad5e6b986e4ab4ba73e658bf962257","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}