{"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-answers","entry":"get_answers","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":5,"n_samples_ran":2,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":3},"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.05075","paper":"/paper/arxiv-2601-05075","title":"SemPA: Improving Sentence Embeddings of Large Language Models through Semantic Preference Alignment","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"szu-tera/SemPA","path":"drop/utils.py","file_url":"https://github.com/szu-tera/SemPA/blob/HEAD/drop/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"1b91c1817a9609fa","mcp_get_code":{"code_sha256":"1b91c1817a9609fa"}},{"arxiv_id":"2406.13356","paper":"/paper/jogging-the-memory-of-unlearned-model-through","title":"Jogging the Memory of Unlearned LLMs Through Targeted Relearning Attacks","date":"2024-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"s-huu/jog_llm_memory","path":"wmdp/src/gpt4_eval.py","file_url":"https://github.com/s-huu/jog_llm_memory/blob/HEAD/wmdp/src/gpt4_eval.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"28f40801cc5a9fd3","mcp_get_code":{"code_sha256":"28f40801cc5a9fd3"}},{"arxiv_id":"2406.00144","paper":"/paper/query2cad-generating-cad-models-using-natural","title":"Query2CAD: Generating CAD models using natural language queries","date":"2024-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"akshay140601/query2cad","path":"src/llm.py","file_url":"https://github.com/akshay140601/query2cad/blob/HEAD/src/llm.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4746a82240044cc7","mcp_get_code":{"code_sha256":"4746a82240044cc7"}},{"arxiv_id":"2308.14436","paper":"/paper/bridging-the-kb-text-gap-leveraging","title":"Bridging the KB-Text Gap: Leveraging Structured Knowledge-aware Pre-training for KBQA","date":"2023-08-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dongguanting/skp-for-kbqa","path":"DPR_inference/fid_preprocess.py","file_url":"https://github.com/dongguanting/skp-for-kbqa/blob/HEAD/DPR_inference/fid_preprocess.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e671c895df132135","mcp_get_code":{"code_sha256":"e671c895df132135"}},{"arxiv_id":"2212.00959","paper":"/paper/unikgqa-unified-retrieval-and-reasoning-for","title":"UniKGQA: Unified Retrieval and Reasoning for Solving Multi-hop Question Answering Over Knowledge Graph","date":"2022-12-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RUCAIBox/UniKGQA","path":"UniModel/convert_abs_to_NSM_format.py","file_url":"https://github.com/RUCAIBox/UniKGQA/blob/HEAD/UniModel/convert_abs_to_NSM_format.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6cc4c2a66647120f","mcp_get_code":{"code_sha256":"6cc4c2a66647120f"}}]}