{"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/seed-everything","entry":"seed_everything","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":16,"n_papers_ran":11,"n_papers_ran_no_instrument_failure":9,"n_papers_ran_instrument_only":2,"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":16,"n_samples_ran":11,"n_samples_constructed":0,"n_samples_ran_checked":9,"n_samples_instrument":2,"n_samples_unverified":5,"n_samples_fingerprinted":8,"n_places":16,"n_places_pointer_only":7,"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":5,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":4,"unverified":5},"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":"2608.11269","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-11269","title":"CosMAP: Contrastive Manifold Approximation and Projection for Dimensionality Reduction of Omics and Genealogical Data","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"FenosoaRandrianjatovo/CosMAP-dr","path":"src/cosmapdr/cosmapdr.py","file_url":"https://github.com/FenosoaRandrianjatovo/CosMAP-dr/blob/HEAD/src/cosmapdr/cosmapdr.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":"b14bbd1e57c1239d","code_sha256_prefix":"b14bbd1e57c1239d","mcp_get_code":{"code_sha256":"b14bbd1e57c1239d"}},{"arxiv_id":"2601.03237","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-03237","title":"PET-TURTLE: Deep Unsupervised Support Vector Machines for Imbalanced Data Clusters","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"javiersc1/pet-turtle","path":"turtle_pet.py","file_url":"https://github.com/javiersc1/pet-turtle/blob/HEAD/turtle_pet.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, javiersc1/pet-turtle when it was checked","code_sha256":"6a85cbb1a7488a1b","code_sha256_prefix":"6a85cbb1a7488a1b","mcp_get_code":{"code_sha256":"6a85cbb1a7488a1b"}},{"arxiv_id":"2503.24129","arxiv_id_is_arxiv":true,"paper":"/paper/it-s-a-blind-match-towards-vision-language","title":"It's a (Blind) Match! Towards Vision-Language Correspondence without Parallel Data","date":"2025-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dominik-schnaus/itsamatch","path":"itsamatch/utils.py","file_url":"https://github.com/dominik-schnaus/itsamatch/blob/HEAD/itsamatch/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":"5c7e49a4df2f0f1f","code_sha256_prefix":"5c7e49a4df2f0f1f","mcp_get_code":{"code_sha256":"5c7e49a4df2f0f1f"}},{"arxiv_id":"2502.00968","arxiv_id_is_arxiv":true,"paper":"/paper/code-blockwise-control-for-denoising","title":"CoDe: Blockwise Control for Denoising Diffusion Models","date":"2025-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anujinho/code","path":"BoN/src_sd/inference.py","file_url":"https://github.com/anujinho/code/blob/HEAD/BoN/src_sd/inference.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"68c0f926242e3cf1","code_sha256_prefix":"68c0f926242e3cf1","mcp_get_code":{"code_sha256":"68c0f926242e3cf1"}},{"arxiv_id":"2410.07369","arxiv_id_is_arxiv":true,"paper":"/paper/an-undetectable-watermark-for-generative","title":"An Undetectable Watermark for Generative Image Models","date":"2024-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xuandongzhao/prc-watermark","path":"encode.py","file_url":"https://github.com/xuandongzhao/prc-watermark/blob/HEAD/encode.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"31a40604d91b0716","code_sha256_prefix":"31a40604d91b0716","mcp_get_code":{"code_sha256":"31a40604d91b0716"}},{"arxiv_id":"2410.00321","arxiv_id_is_arxiv":true,"paper":"/paper/a-cat-is-a-cat-not-a-dog-unraveling","title":"A Cat Is A Cat (Not A Dog!): Unraveling Information Mix-ups in Text-to-Image Encoders through Causal Analysis and Embedding Optimization","date":"2024-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"basiclab/Unraveling-Information-Mix-ups","path":"utils/utils.py","file_url":"https://github.com/basiclab/Unraveling-Information-Mix-ups/blob/HEAD/utils/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"dad22709a45ad4ab","code_sha256_prefix":"dad22709a45ad4ab","mcp_get_code":{"code_sha256":"dad22709a45ad4ab"}},{"arxiv_id":"2408.03195","arxiv_id_is_arxiv":true,"paper":"/paper/2408-03195","title":"RELIEF: Reinforcement Learning Empowered Graph Feature Prompt Tuning","date":"2024-08-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JasonZhujp/RELIEF","path":"node_level/pretrain_gppt.py","file_url":"https://github.com/JasonZhujp/RELIEF/blob/HEAD/node_level/pretrain_gppt.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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, JasonZhujp/RELIEF when it was checked","code_sha256":"310641cfd279407f","code_sha256_prefix":"310641cfd279407f","mcp_get_code":{"code_sha256":"310641cfd279407f"}},{"arxiv_id":"2406.18187","arxiv_id_is_arxiv":true,"paper":"/paper/selective-prompting-tuning-for-personalized","title":"Selective Prompting Tuning for Personalized Conversations with LLMs","date":"2024-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hqsiswiliam/SPT","path":"utils/seed_everything.py","file_url":"https://github.com/hqsiswiliam/SPT/blob/HEAD/utils/seed_everything.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, hqsiswiliam/SPT when it was checked","code_sha256":"a73433deedbe1382","code_sha256_prefix":"a73433deedbe1382","mcp_get_code":{"code_sha256":"a73433deedbe1382"}},{"arxiv_id":"2403.03938","arxiv_id_is_arxiv":true,"paper":"/paper/guide-guidance-based-incremental-learning","title":"GUIDE: Guidance-based Incremental Learning with Diffusion Models","date":"2024-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cywinski/guide","path":"scripts/image_train.py","file_url":"https://github.com/cywinski/guide/blob/HEAD/scripts/image_train.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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, cywinski/guide when it was checked","code_sha256":"0e90fd677951edd3","code_sha256_prefix":"0e90fd677951edd3","mcp_get_code":{"code_sha256":"0e90fd677951edd3"}},{"arxiv_id":"2402.17423","arxiv_id_is_arxiv":true,"paper":"/paper/reinforced-in-context-black-box-optimization","title":"Reinforced In-Context Black-Box Optimization","date":"2024-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"songlei00/ribbo","path":"utils.py","file_url":"https://github.com/songlei00/ribbo/blob/HEAD/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, songlei00/ribbo when it was checked","code_sha256":"c66c3dbb747d2a17","code_sha256_prefix":"c66c3dbb747d2a17","mcp_get_code":{"code_sha256":"c66c3dbb747d2a17"}},{"arxiv_id":"2402.08679","arxiv_id_is_arxiv":true,"paper":"/paper/cold-attack-jailbreaking-llms-with","title":"COLD-Attack: Jailbreaking LLMs with Stealthiness and Controllability","date":"2024-02-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yu-fangxu/cold-attack","path":"cold_decoding.py","file_url":"https://github.com/yu-fangxu/cold-attack/blob/HEAD/cold_decoding.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, yu-fangxu/cold-attack when it was checked","code_sha256":"9bb79ab60469224a","code_sha256_prefix":"9bb79ab60469224a","mcp_get_code":{"code_sha256":"9bb79ab60469224a"}},{"arxiv_id":"2310.12404","arxiv_id_is_arxiv":true,"paper":"/paper/loop-copilot-conducting-ai-ensembles-for","title":"Loop Copilot: Conducting AI Ensembles for Music Generation and Iterative Editing","date":"2023-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ldzhangyx/loop-copilot","path":"melodytalk/utils.py","file_url":"https://github.com/ldzhangyx/loop-copilot/blob/HEAD/melodytalk/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":"94ef2ffb5a8aef73","code_sha256_prefix":"94ef2ffb5a8aef73","mcp_get_code":{"code_sha256":"94ef2ffb5a8aef73"}},{"arxiv_id":"2306.12330","arxiv_id_is_arxiv":true,"paper":"/paper/protogate-prototype-based-neural-networks","title":"ProtoGate: Prototype-based Neural Networks with Global-to-local Feature Selection for Tabular Biomedical Data","date":"2023-06-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SilenceX12138/ProtoGate","path":"src/_shared_imports.py","file_url":"https://github.com/SilenceX12138/ProtoGate/blob/HEAD/src/_shared_imports.py","status":"ran","verification_level":1,"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":"29afa4ebe6fffe82","code_sha256_prefix":"29afa4ebe6fffe82","mcp_get_code":{"code_sha256":"29afa4ebe6fffe82"}},{"arxiv_id":"2211.17192","arxiv_id_is_arxiv":true,"paper":"/paper/fast-inference-from-transformers-via","title":"Fast Inference from Transformers via Speculative Decoding","date":"2022-11-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"smart-lty/parallelspeculativedecoding","path":"src/engine.py","file_url":"https://github.com/smart-lty/parallelspeculativedecoding/blob/HEAD/src/engine.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, smart-lty/parallelspeculativedecoding when it was checked","code_sha256":"79fc1fb911ac4bf9","code_sha256_prefix":"79fc1fb911ac4bf9","mcp_get_code":{"code_sha256":"79fc1fb911ac4bf9"}},{"arxiv_id":"2112.03415","arxiv_id_is_arxiv":true,"paper":"/paper/producing-augmentation-invariant-embeddings","title":"Producing augmentation-invariant embeddings from real-life imagery","date":"2021-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"socom20/facebook-image-similarity-challenge-2021","path":"modules/Facebook_AFMultiGPU_model_v23_sy_v6.py","file_url":"https://github.com/socom20/facebook-image-similarity-challenge-2021/blob/HEAD/modules/Facebook_AFMultiGPU_model_v23_sy_v6.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":"3c996e923769005a","code_sha256_prefix":"3c996e923769005a","mcp_get_code":{"code_sha256":"3c996e923769005a"}},{"arxiv_id":"1805.08318","arxiv_id_is_arxiv":true,"paper":"/paper/self-attention-generative-adversarial","title":"Self-Attention Generative Adversarial Networks","date":"2018-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kpandey008/SAGAN","path":"config.py","file_url":"https://github.com/kpandey008/SAGAN/blob/HEAD/config.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":"c58d89114d55c178","code_sha256_prefix":"c58d89114d55c178","mcp_get_code":{"code_sha256":"c58d89114d55c178"}}],"record_sha256":"3fb07472b4f990be28a7c9cf9ff0b76c991625636bf36d42c62eb7c422913fce","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}