{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/code/extract-entities","entry":"extract_entities","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+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 = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":6,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":0,"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":5,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":2,"n_places":6,"n_places_pointer_only":0,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":5,"unverified":1},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"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","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"803fac58e74c7e8b","code_sha256_prefix":"803fac58e74c7e8b","mcp_get_code":{"code_sha256":"803fac58e74c7e8b"}},{"arxiv_id":"2411.17388","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5cc881bcb8e83712","code_sha256_prefix":"5cc881bcb8e83712","mcp_get_code":{"code_sha256":"5cc881bcb8e83712"}},{"arxiv_id":"2410.14211","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"76234c3134b81ef7","code_sha256_prefix":"76234c3134b81ef7","mcp_get_code":{"code_sha256":"76234c3134b81ef7"}},{"arxiv_id":"2310.08975","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e73dc55f0b4f1aed","code_sha256_prefix":"e73dc55f0b4f1aed","mcp_get_code":{"code_sha256":"e73dc55f0b4f1aed"}},{"arxiv_id":"2203.14987","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3689ab93616e1197","code_sha256_prefix":"3689ab93616e1197","mcp_get_code":{"code_sha256":"3689ab93616e1197"}},{"arxiv_id":"2112.05682","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c17fb3de0d47f94a","code_sha256_prefix":"c17fb3de0d47f94a","mcp_get_code":{"code_sha256":"c17fb3de0d47f94a"}}],"record_sha256":"ac6675b946962095167cbeaef58f84338abf710619e3da1b174de89bd12d5986","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}