{"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/construct-graph","entry":"construct_graph","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":9,"n_papers_ran":3,"n_papers_ran_no_instrument_failure":3,"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":5,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":9,"n_places_pointer_only":1,"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":3,"unverified":2},"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":"2410.22149","arxiv_id_is_arxiv":true,"paper":"/paper/capacity-control-is-an-effective-memorization","title":"Capacity Control is an Effective Memorization Mitigation Mechanism in Text-Conditional Diffusion Models","date":"2024-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"raman1121/diffusion_memorization_hpo","path":"extraction_attack.py","file_url":"https://github.com/raman1121/diffusion_memorization_hpo/blob/HEAD/extraction_attack.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, raman1121/diffusion_memorization_hpo when it was checked","code_sha256":"80b0901668ac3b4b","code_sha256_prefix":"80b0901668ac3b4b","mcp_get_code":{"code_sha256":"80b0901668ac3b4b"}},{"arxiv_id":"2409.01143","arxiv_id_is_arxiv":true,"paper":"/paper/flashflex-accommodating-large-language-model","title":"HexiScale: Accommodating Large Language Model Training over Heterogeneous Environment","date":null,"month_inferred_from_arxiv_id":"2024-09","title_source":"archive","repo":"relaxed-system-lab/flashflex","path":"experimental/graph.py","file_url":"https://github.com/relaxed-system-lab/flashflex/blob/HEAD/experimental/graph.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":"a25d59327ea592b2","code_sha256_prefix":"a25d59327ea592b2","mcp_get_code":{"code_sha256":"a25d59327ea592b2"}},{"arxiv_id":"2210.09338","arxiv_id_is_arxiv":true,"paper":"/paper/deep-bidirectional-language-knowledge-graph","title":"Deep Bidirectional Language-Knowledge Graph Pretraining","date":"2022-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"michiyasunaga/dragon","path":"preprocess_utils/conceptnet.py","file_url":"https://github.com/michiyasunaga/dragon/blob/HEAD/preprocess_utils/conceptnet.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":"be8c35c9c1d52b66","code_sha256_prefix":"be8c35c9c1d52b66","mcp_get_code":{"code_sha256":"be8c35c9c1d52b66"}},{"arxiv_id":"2104.06378","arxiv_id_is_arxiv":true,"paper":"/paper/qa-gnn-reasoning-with-language-models-and","title":"QA-GNN: Reasoning with Language Models and Knowledge Graphs for Question Answering","date":"2021-04-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"michiyasunaga/qagnn","path":"utils/conceptnet.py","file_url":"https://github.com/michiyasunaga/qagnn/blob/HEAD/utils/conceptnet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"be8c35c9c1d52b66","code_sha256_prefix":"be8c35c9c1d52b66","mcp_get_code":{"code_sha256":"be8c35c9c1d52b66"}},{"arxiv_id":"2010.11465","arxiv_id_is_arxiv":true,"paper":"/paper/beta-embeddings-for-multi-hop-logical","title":"Beta Embeddings for Multi-Hop Logical Reasoning in Knowledge Graphs","date":"2020-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"snap-stanford/KGReasoning","path":"create_queries.py","file_url":"https://github.com/snap-stanford/KGReasoning/blob/HEAD/create_queries.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":"75304c63d0f3ce0c","code_sha256_prefix":"75304c63d0f3ce0c","mcp_get_code":{"code_sha256":"75304c63d0f3ce0c"}},{"arxiv_id":"2010.03790","arxiv_id_is_arxiv":true,"paper":"/paper/text-based-rl-agents-with-commonsense","title":"Text-based RL Agents with Commonsense Knowledge: New Challenges, Environments and Baselines","date":"2020-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IBM/commonsense-rl","path":"utils/kg.py","file_url":"https://github.com/IBM/commonsense-rl/blob/HEAD/utils/kg.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":"a8fb47a8145651ed","code_sha256_prefix":"a8fb47a8145651ed","mcp_get_code":{"code_sha256":"a8fb47a8145651ed"}},{"arxiv_id":"aaai_26578","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_26578","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"mlvlab/QAT","path":"utils/conceptnet.py","file_url":"https://github.com/mlvlab/QAT/blob/HEAD/utils/conceptnet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"be8c35c9c1d52b66","code_sha256_prefix":"be8c35c9c1d52b66","mcp_get_code":{"code_sha256":"be8c35c9c1d52b66"}},{"arxiv_id":"2023.findings-emnlp.540","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2023.findings-emnlp.540","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"lingchen0331/KEEP","path":"preprocessing/conceptnet.py","file_url":"https://github.com/lingchen0331/KEEP/blob/HEAD/preprocessing/conceptnet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"be8c35c9c1d52b66","code_sha256_prefix":"be8c35c9c1d52b66","mcp_get_code":{"code_sha256":"be8c35c9c1d52b66"}},{"arxiv_id":"2022.findings-naacl.131","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2022.findings-naacl.131","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"RUCAIBox/SAFE","path":"utils/conceptnet.py","file_url":"https://github.com/RUCAIBox/SAFE/blob/HEAD/utils/conceptnet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"be8c35c9c1d52b66","code_sha256_prefix":"be8c35c9c1d52b66","mcp_get_code":{"code_sha256":"be8c35c9c1d52b66"}}],"record_sha256":"11a3329ee2c8b8e278fd8a4771b60301bf60dd1634b02b6e0f13fb01a62ea228","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}