{"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/set-random-seed","entry":"set_random_seed","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":12,"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":10,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":0,"n_samples_unverified":7,"n_samples_fingerprinted":3,"n_places":12,"n_places_pointer_only":4,"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":2,"unverified":7},"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.10684","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-10684","title":"Is Data Shapley Not Better than Random in Data Selection? Ask NASH","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"snoidetx/nash","path":"main/selection/nash.py","file_url":"https://github.com/snoidetx/nash/blob/HEAD/main/selection/nash.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":"1ffbee6facff5465","code_sha256_prefix":"1ffbee6facff5465","mcp_get_code":{"code_sha256":"1ffbee6facff5465"}},{"arxiv_id":"2505.13211","arxiv_id_is_arxiv":true,"paper":"/paper/magi-1-autoregressive-video-generation-at","title":"MAGI-1: Autoregressive Video Generation at Scale","date":"2025-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sandai-org/magi-1","path":"inference/common/common_utils.py","file_url":"https://github.com/sandai-org/magi-1/blob/HEAD/inference/common/common_utils.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":"c6694cf32dc55cea","code_sha256_prefix":"c6694cf32dc55cea","mcp_get_code":{"code_sha256":"c6694cf32dc55cea"}},{"arxiv_id":"2503.09573","arxiv_id_is_arxiv":true,"paper":"/paper/block-diffusion-interpolating-between","title":"Block Diffusion: Interpolating Between Autoregressive and Diffusion Language Models","date":"2025-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MindSpore-scientific/code-12","path":"AECRNet/data.py","file_url":"https://github.com/MindSpore-scientific/code-12/blob/HEAD/AECRNet/data.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":"14c181fabe865cbf","code_sha256_prefix":"14c181fabe865cbf","mcp_get_code":{"code_sha256":"14c181fabe865cbf"}},{"arxiv_id":"2408.14512","arxiv_id_is_arxiv":true,"paper":"/paper/llms-as-zero-shot-graph-learners-alignment-of","title":"LLMs as Zero-shot Graph Learners: Alignment of GNN Representations with LLM Token Embeddings","date":"2024-08-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MindSpore-scientific-2/code-11","path":"AECRNet/data.py","file_url":"https://github.com/MindSpore-scientific-2/code-11/blob/HEAD/AECRNet/data.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":"14c181fabe865cbf","code_sha256_prefix":"14c181fabe865cbf","mcp_get_code":{"code_sha256":"14c181fabe865cbf"}},{"arxiv_id":"2405.06264","arxiv_id_is_arxiv":true,"paper":"/paper/selective-focus-investigating-semantics","title":"Selective Focus: Investigating Semantics Sensitivity in Post-training Quantization for Lane Detection","date":"2024-05-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PannenetsF/SelectiveFocus","path":"pad/utils/runners/lane_det_quant_trainer.py","file_url":"https://github.com/PannenetsF/SelectiveFocus/blob/HEAD/pad/utils/runners/lane_det_quant_trainer.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, PannenetsF/SelectiveFocus when it was checked","code_sha256":"045cf9d1358080e2","code_sha256_prefix":"045cf9d1358080e2","mcp_get_code":{"code_sha256":"045cf9d1358080e2"}},{"arxiv_id":"2311.18815","arxiv_id_is_arxiv":true,"paper":"/paper/imma-immunizing-text-to-image-models-against","title":"IMMA: Immunizing text-to-image Models against Malicious Adaptation","date":"2023-11-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MindCode-4/code-14","path":"AECRNet/data.py","file_url":"https://github.com/MindCode-4/code-14/blob/HEAD/AECRNet/data.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":"14c181fabe865cbf","code_sha256_prefix":"14c181fabe865cbf","mcp_get_code":{"code_sha256":"14c181fabe865cbf"}},{"arxiv_id":"2310.19342","arxiv_id_is_arxiv":true,"paper":"/paper/label-only-model-inversion-attacks-via-1","title":"Label-Only Model Inversion Attacks via Knowledge Transfer","date":"2023-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ngoc-nguyen-0/LOKT_neurips2023","path":"plg_tacgan.py","file_url":"https://github.com/ngoc-nguyen-0/LOKT_neurips2023/blob/HEAD/plg_tacgan.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, ngoc-nguyen-0/LOKT_neurips2023 when it was checked","code_sha256":"e4778d33af343c8c","code_sha256_prefix":"e4778d33af343c8c","mcp_get_code":{"code_sha256":"e4778d33af343c8c"}},{"arxiv_id":"2204.03111","arxiv_id_is_arxiv":true,"paper":"/paper/uigr-unified-interactive-garment-retrieval","title":"UIGR: Unified Interactive Garment Retrieval","date":"2022-04-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"brandonhanx/compfashion","path":"train_net.py","file_url":"https://github.com/brandonhanx/compfashion/blob/HEAD/train_net.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"eac8df43c66acb80","code_sha256_prefix":"eac8df43c66acb80","mcp_get_code":{"code_sha256":"eac8df43c66acb80"}},{"arxiv_id":"2111.04263","arxiv_id_is_arxiv":true,"paper":"/paper/federated-learning-based-on-dynamic-1","title":"Federated Learning Based on Dynamic Regularization","date":"2021-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thejungwon/gc-fed","path":"algorithms/gcfed.py","file_url":"https://github.com/thejungwon/gc-fed/blob/HEAD/algorithms/gcfed.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, thejungwon/gc-fed when it was checked","code_sha256":"c08e488e6cf86c88","code_sha256_prefix":"c08e488e6cf86c88","mcp_get_code":{"code_sha256":"c08e488e6cf86c88"}},{"arxiv_id":"2109.07437","arxiv_id_is_arxiv":true,"paper":"/paper/should-we-be-pre-training-an-argument-for-end","title":"Should We Be Pre-training? An Argument for End-task Aware Training as an Alternative","date":"2021-09-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ldery/tartan","path":"simple_vision_tartan/run_tartan.py","file_url":"https://github.com/ldery/tartan/blob/HEAD/simple_vision_tartan/run_tartan.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":"20afabbb41adfa6e","code_sha256_prefix":"20afabbb41adfa6e","mcp_get_code":{"code_sha256":"20afabbb41adfa6e"}},{"arxiv_id":"2106.03097","arxiv_id_is_arxiv":true,"paper":"/paper/preservation-of-the-global-knowledge-by-not","title":"Preservation of the Global Knowledge by Not-True Distillation in Federated Learning","date":"2021-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thejungwon/gc-fed","path":"algorithms/fedntd.py","file_url":"https://github.com/thejungwon/gc-fed/blob/HEAD/algorithms/fedntd.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, thejungwon/gc-fed when it was checked","code_sha256":"55dd9a2df5092e25","code_sha256_prefix":"55dd9a2df5092e25","mcp_get_code":{"code_sha256":"55dd9a2df5092e25"}},{"arxiv_id":"1409.7495","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-domain-adaptation-by","title":"Unsupervised Domain Adaptation by Backpropagation","date":"2014-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adapt-python/adapt","path":"adapt/feature_based/_dann.py","file_url":"https://github.com/adapt-python/adapt/blob/HEAD/adapt/feature_based/_dann.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"988358e38ca0a57c","code_sha256_prefix":"988358e38ca0a57c","mcp_get_code":{"code_sha256":"988358e38ca0a57c"}}],"record_sha256":"b729f5ee1b7dd34b4b486b7566a42c315a05b2635cdb6962ed498ac9546c75d9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}