{"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/rand-scale","entry":"rand_scale","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":10,"n_papers_ran":10,"n_papers_ran_no_instrument_failure":6,"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":9,"n_samples_ran":9,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":4,"n_samples_unverified":0,"n_samples_fingerprinted":2,"n_places":10,"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":4,"ran_fixture":0,"ran":5,"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":"2605.13475","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-13475","title":"FedHPro: Federated Hyper-Prototype Learning via Gradient Matching","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"mala-lab/FedHPro","path":"main_run.py","file_url":"https://github.com/mala-lab/FedHPro/blob/HEAD/main_run.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, mala-lab/FedHPro when it was checked","code_sha256":"2cc42f2e0f92442c","code_sha256_prefix":"2cc42f2e0f92442c","mcp_get_code":{"code_sha256":"2cc42f2e0f92442c"}},{"arxiv_id":"2406.18561","arxiv_id_is_arxiv":true,"paper":"/paper/selmatch-effectively-scaling-up-dataset","title":"SelMatch: Effectively Scaling Up Dataset Distillation via Selection-Based Initialization and Partial Updates by Trajectory Matching","date":"2024-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Yongalls/SelMatch","path":"distill.py","file_url":"https://github.com/Yongalls/SelMatch/blob/HEAD/distill.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, Yongalls/SelMatch when it was checked","code_sha256":"48298f98898ede21","code_sha256_prefix":"48298f98898ede21","mcp_get_code":{"code_sha256":"48298f98898ede21"}},{"arxiv_id":"2310.00093","arxiv_id_is_arxiv":true,"paper":"/paper/datadam-efficient-dataset-distillation-with-1","title":"DataDAM: Efficient Dataset Distillation with Attention Matching","date":"2023-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"datadistillation/datadam","path":"main_DataDAM.py","file_url":"https://github.com/datadistillation/datadam/blob/HEAD/main_DataDAM.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, datadistillation/datadam when it was checked","code_sha256":"ce2cd9ed7e80e7e5","code_sha256_prefix":"ce2cd9ed7e80e7e5","mcp_get_code":{"code_sha256":"ce2cd9ed7e80e7e5"}},{"arxiv_id":"2307.14959","arxiv_id_is_arxiv":true,"paper":"/paper/federated-model-aggregation-via-self","title":"Federated Model Aggregation via Self-Supervised Priors for Highly Imbalanced Medical Image Classification","date":"2023-07-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xmed-lab/fed-mas","path":"methods/utils.py","file_url":"https://github.com/xmed-lab/fed-mas/blob/HEAD/methods/utils.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, xmed-lab/fed-mas when it was checked","code_sha256":"845a5a7c89d42d05","code_sha256_prefix":"845a5a7c89d42d05","mcp_get_code":{"code_sha256":"845a5a7c89d42d05"}},{"arxiv_id":"2302.01068","arxiv_id_is_arxiv":true,"paper":"/paper/fed-gloss-dp-federated-global-learning-using","title":"FedLAP-DP: Federated Learning by Sharing Differentially Private Loss Approximations","date":"2023-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"a514514772/fedlap-dp","path":"utils/augmentation.py","file_url":"https://github.com/a514514772/fedlap-dp/blob/HEAD/utils/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":"a7a3291ababdea1f","code_sha256_prefix":"a7a3291ababdea1f","mcp_get_code":{"code_sha256":"a7a3291ababdea1f"}},{"arxiv_id":"2211.04446","arxiv_id_is_arxiv":true,"paper":"/paper/private-set-generation-with-discriminative","title":"Private Set Generation with Discriminative Information","date":"2022-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DingfanChen/Private-Set","path":"utils/augmentation.py","file_url":"https://github.com/DingfanChen/Private-Set/blob/HEAD/utils/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":"018d0e459aac197e","code_sha256_prefix":"018d0e459aac197e","mcp_get_code":{"code_sha256":"018d0e459aac197e"}},{"arxiv_id":"2203.01531","arxiv_id_is_arxiv":true,"paper":"/paper/cafe-learning-to-condense-dataset-by-aligning","title":"CAFE: Learning to Condense Dataset by Aligning Features","date":"2022-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kaiwang960112/cafe","path":"distill.py","file_url":"https://github.com/kaiwang960112/cafe/blob/HEAD/distill.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, kaiwang960112/cafe when it was checked","code_sha256":"d2492574e9a83673","code_sha256_prefix":"d2492574e9a83673","mcp_get_code":{"code_sha256":"d2492574e9a83673"}},{"arxiv_id":"2004.10934","arxiv_id_is_arxiv":true,"paper":"/paper/yolov4-optimal-speed-and-accuracy-of-object","title":"YOLOv4: Optimal Speed and Accuracy of Object Detection","date":"2020-04-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"OwlTing/AI_basketball_games_video_editor","path":"pytorch_YOLOv4/dataset.py","file_url":"https://github.com/OwlTing/AI_basketball_games_video_editor/blob/HEAD/pytorch_YOLOv4/dataset.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":"be52ff73178c92a1","code_sha256_prefix":"be52ff73178c92a1","mcp_get_code":{"code_sha256":"be52ff73178c92a1"}},{"arxiv_id":"1910.00068","arxiv_id_is_arxiv":true,"paper":"/paper/adversarial-patches-exploiting-contextual","title":"Role of Spatial Context in Adversarial Robustness for Object Detection","date":"2019-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"UMBCvision/Contextual-Adversarial-Patches","path":"image.py","file_url":"https://github.com/UMBCvision/Contextual-Adversarial-Patches/blob/HEAD/image.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":"6a4124c294bed05b","code_sha256_prefix":"6a4124c294bed05b","mcp_get_code":{"code_sha256":"6a4124c294bed05b"}},{"arxiv_id":"1904.08653","arxiv_id_is_arxiv":true,"paper":"/paper/fooling-automated-surveillance-cameras","title":"Fooling automated surveillance cameras: adversarial patches to attack person detection","date":"2019-04-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Zhang-Jack/adversarial_yolo2","path":"image.py","file_url":"https://github.com/Zhang-Jack/adversarial_yolo2/blob/HEAD/image.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":"6a4124c294bed05b","code_sha256_prefix":"6a4124c294bed05b","mcp_get_code":{"code_sha256":"6a4124c294bed05b"}}],"record_sha256":"f47b50b09961e2a7a2c99da565d9ddeb3ca8d4c49c472ecad630ea41ddcb8e07","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}