{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/get-seeds","entry":"get_seeds","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":5,"n_papers_ran":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":5,"n_samples_ran":1,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":0,"unverified":4},"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":"2601.18546","paper":"/paper/arxiv-2601-18546","title":"Information Hidden in Gradients of Regression with Target Noise","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"edahelsinki/noisy_targets","path":"run_utils.py","file_url":"https://github.com/edahelsinki/noisy_targets/blob/HEAD/run_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"398016a9d4e853c8","mcp_get_code":{"code_sha256":"398016a9d4e853c8"}},{"arxiv_id":"2503.24129","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"dda62270492c2d21","mcp_get_code":{"code_sha256":"dda62270492c2d21"}},{"arxiv_id":"2212.09611","paper":"/paper/optimizing-prompts-for-text-to-image-1","title":"Optimizing Prompts for Text-to-Image Generation","date":"2022-12-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adieyal/sd-dynamic-prompts","path":"sd_dynamic_prompts/helpers.py","file_url":"https://github.com/adieyal/sd-dynamic-prompts/blob/HEAD/sd_dynamic_prompts/helpers.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"420f90dad5a53d9b","mcp_get_code":{"code_sha256":"420f90dad5a53d9b"}},{"arxiv_id":"2205.03105","paper":"/paper/lpgnet-link-private-graph-networks-for-node","title":"LPGNet: Link Private Graph Networks for Node Classification","date":"2022-05-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ashgeek/lpgnet-prototype","path":"src/utils.py","file_url":"https://github.com/ashgeek/lpgnet-prototype/blob/HEAD/src/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"771d81f8889f1f8e","mcp_get_code":{"code_sha256":"771d81f8889f1f8e"}},{"arxiv_id":"2203.08307","paper":"/paper/improving-word-translation-via-two-stage-1","title":"Improving Word Translation via Two-Stage Contrastive Learning","date":"2022-03-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vinsachi/FIPPCLE","path":"xling-bli/code/projection.py","file_url":"https://github.com/vinsachi/FIPPCLE/blob/HEAD/xling-bli/code/projection.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"731634f448ca1287","mcp_get_code":{"code_sha256":"731634f448ca1287"}}]}