{"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/target-loss","entry":"target_loss","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":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":5,"n_samples_ran":4,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":4,"by_status":{"ran_honours":2,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":1},"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":"2405.04346","paper":"/paper/revisiting-character-level-adversarial","title":"Revisiting Character-level Adversarial Attacks for Language Models","date":"2024-05-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LIONS-EPFL/Charmer","path":"utils_jailbreak.py","file_url":"https://github.com/LIONS-EPFL/Charmer/blob/HEAD/utils_jailbreak.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"11a3348eb0e4ba60","mcp_get_code":{"code_sha256":"11a3348eb0e4ba60"}},{"arxiv_id":"2404.07981","paper":"/paper/manipulating-large-language-models-to","title":"Manipulating Large Language Models to Increase Product Visibility","date":"2024-04-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aounon/llm-rank-optimizer","path":"tools.py","file_url":"https://github.com/aounon/llm-rank-optimizer/blob/HEAD/tools.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9ecf44a5744c0c2a","mcp_get_code":{"code_sha256":"9ecf44a5744c0c2a"}},{"arxiv_id":"1810.12686","paper":"/paper/evaluating-text-gans-as-language-models","title":"Evaluating Text GANs as Language Models","date":"2018-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"3715a5e4aecc4849","mcp_get_code":{"code_sha256":"3715a5e4aecc4849"}},{"arxiv_id":"1709.08624","paper":"/paper/long-text-generation-via-adversarial-training","title":"Long Text Generation via Adversarial Training with Leaked Information","date":"2017-09-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"336fb3340370addd","mcp_get_code":{"code_sha256":"336fb3340370addd"}},{"arxiv_id":"1609.05473","paper":"/paper/seqgan-sequence-generative-adversarial-nets","title":"SeqGAN: Sequence Generative Adversarial Nets with Policy Gradient","date":"2016-09-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rupes438/CodeGen","path":"SeqGAN_3/sequence_gan_main.py","file_url":"https://github.com/rupes438/CodeGen/blob/HEAD/SeqGAN_3/sequence_gan_main.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"336fb3340370addd","mcp_get_code":{"code_sha256":"336fb3340370addd"}},{"arxiv_id":"1609.05473","paper":"/paper/seqgan-sequence-generative-adversarial-nets","title":"SeqGAN: Sequence Generative Adversarial Nets with Policy Gradient","date":"2016-09-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vedantc6/SeqGAN","path":"seqGAN.py","file_url":"https://github.com/vedantc6/SeqGAN/blob/HEAD/seqGAN.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4b1acb7daafe3443","mcp_get_code":{"code_sha256":"4b1acb7daafe3443"}},{"arxiv_id":"1609.05473","paper":"/paper/seqgan-sequence-generative-adversarial-nets","title":"SeqGAN: Sequence Generative Adversarial Nets with Policy Gradient","date":"2016-09-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GuyTevet/SeqGAN-eval","path":"sequence_gan.py","file_url":"https://github.com/GuyTevet/SeqGAN-eval/blob/HEAD/sequence_gan.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"3715a5e4aecc4849","mcp_get_code":{"code_sha256":"3715a5e4aecc4849"}}]}