{"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/getscore","entry":"getScore","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":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":6,"n_samples_ran":2,"n_samples_fingerprinted":1,"n_places":6,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":1,"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":"2504.14587","paper":"/paper/generative-auto-bidding-with-value-guided","title":"Generative Auto-Bidding with Value-Guided Explorations","date":"2025-04-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Applied-Machine-Learning-Lab/GAVE","path":"code/bidding_train_env/baseline/dt/dt.py","file_url":"https://github.com/Applied-Machine-Learning-Lab/GAVE/blob/HEAD/code/bidding_train_env/baseline/dt/dt.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"363afcb8671faa10","mcp_get_code":{"code_sha256":"363afcb8671faa10"}},{"arxiv_id":"2203.16618","paper":"/paper/end-to-end-document-recognition-and","title":"End-to-end Document Recognition and Understanding with Dessurt","date":"2022-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"herobd/dessurt","path":"get_GAnTED_for_Dessurt.py","file_url":"https://github.com/herobd/dessurt/blob/HEAD/get_GAnTED_for_Dessurt.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0b062bbeed5dd70a","mcp_get_code":{"code_sha256":"0b062bbeed5dd70a"}},{"arxiv_id":"2106.10785","paper":"/paper/adversarial-attack-on-graph-neural-networks","title":"Adversarial Attack on Graph Neural Networks as An Influence Maximization Problem","date":"2021-06-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Mark12Ding/GNN-Practical-Attack","path":"attack.py","file_url":"https://github.com/Mark12Ding/GNN-Practical-Attack/blob/HEAD/attack.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"93d1979b7ccbcd8e","mcp_get_code":{"code_sha256":"93d1979b7ccbcd8e"}},{"arxiv_id":"2006.05057","paper":"/paper/black-box-adversarial-attacks-on-graph-neural","title":"Towards More Practical Adversarial Attacks on Graph Neural Networks","date":"2020-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mark12ding/gnn-practical-attack","path":"attack.py","file_url":"https://github.com/mark12ding/gnn-practical-attack/blob/HEAD/attack.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a37e866ddc285b70","mcp_get_code":{"code_sha256":"a37e866ddc285b70"}},{"arxiv_id":"2006.05057","paper":"/paper/black-box-adversarial-attacks-on-graph-neural","title":"Towards More Practical Adversarial Attacks on Graph Neural Networks","date":"2020-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"theaperdeng/gnn-attack-infmax","path":"attack.py","file_url":"https://github.com/theaperdeng/gnn-attack-infmax/blob/HEAD/attack.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"62cc074a62020b53","mcp_get_code":{"code_sha256":"62cc074a62020b53"}},{"arxiv_id":"1411.2738","paper":"/paper/word2vec-parameter-learning-explained","title":"word2vec Parameter Learning Explained","date":"2014-11-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gymk/ANLP","path":"Week10/Q9.py","file_url":"https://github.com/gymk/ANLP/blob/HEAD/Week10/Q9.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"61583f325997c9a0","mcp_get_code":{"code_sha256":"61583f325997c9a0"}}]}