{"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/extract-entities","entry":"extract_entities","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":6,"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":6,"n_samples_ran":1,"n_samples_fingerprinted":1,"n_places":6,"n_places_pointer_only":0,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":5},"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.01885","paper":"/paper/arxiv-2601-01885","title":"Agentic Memory: Learning Unified Long-Term and Short-Term Memory Management for Large Language Model Agents","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"mem0ai/mem0","path":"mem0/utils/entity_extraction.py","file_url":"https://github.com/mem0ai/mem0/blob/HEAD/mem0/utils/entity_extraction.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":"803fac58e74c7e8b","mcp_get_code":{"code_sha256":"803fac58e74c7e8b"}},{"arxiv_id":"2411.17388","paper":"/paper/can-llms-be-good-graph-judger-for-knowledge","title":"Can LLMs be Good Graph Judge for Knowledge Graph Construction?","date":"2024-11-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hhy-huang/graphjudge","path":"chat/run_chatgpt_entity.py","file_url":"https://github.com/hhy-huang/graphjudge/blob/HEAD/chat/run_chatgpt_entity.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5cc881bcb8e83712","mcp_get_code":{"code_sha256":"5cc881bcb8e83712"}},{"arxiv_id":"2410.14211","paper":"/paper/paths-over-graph-knowledge-graph-enpowered","title":"Paths-over-Graph: Knowledge Graph Empowered Large Language Model Reasoning","date":"2024-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SteveTANTAN/PoG","path":"PoG/PoG_multi.py","file_url":"https://github.com/SteveTANTAN/PoG/blob/HEAD/PoG/PoG_multi.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":"76234c3134b81ef7","mcp_get_code":{"code_sha256":"76234c3134b81ef7"}},{"arxiv_id":"2310.08975","paper":"/paper/chatkbqa-a-generate-then-retrieve-framework","title":"ChatKBQA: A Generate-then-Retrieve Framework for Knowledge Base Question Answering with Fine-tuned Large Language Models","date":"2023-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lhrlab/chatkbqa","path":"components/expr_parser.py","file_url":"https://github.com/lhrlab/chatkbqa/blob/HEAD/components/expr_parser.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e73dc55f0b4f1aed","mcp_get_code":{"code_sha256":"e73dc55f0b4f1aed"}},{"arxiv_id":"2203.14987","paper":"/paper/multilingual-knowledge-graph-completion-with-1","title":"Multilingual Knowledge Graph Completion with Self-Supervised Adaptive Graph Alignment","date":"2022-03-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amzn/ss-aga-kgc","path":"src/validate.py","file_url":"https://github.com/amzn/ss-aga-kgc/blob/HEAD/src/validate.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":"3689ab93616e1197","mcp_get_code":{"code_sha256":"3689ab93616e1197"}},{"arxiv_id":"2112.05682","paper":"/paper/self-attention-does-not-need-o-n-2-memory","title":"Self-attention Does Not Need $O(n^2)$ Memory","date":"2021-12-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"X-iZhang/Libra","path":"libra/eval/temporal_f1.py","file_url":"https://github.com/X-iZhang/Libra/blob/HEAD/libra/eval/temporal_f1.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":"c17fb3de0d47f94a","mcp_get_code":{"code_sha256":"c17fb3de0d47f94a"}}]}