{"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/get-param","entry":"get_param","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":15,"n_papers_ran":13,"n_papers_ran_no_instrument_failure":8,"n_papers_ran_instrument_only":5,"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":12,"n_samples_ran":10,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":3,"n_samples_unverified":2,"n_samples_fingerprinted":2,"n_places":15,"n_places_pointer_only":6,"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":2,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":0,"ran":5,"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":"2503.01838","arxiv_id_is_arxiv":true,"paper":"/paper/grain-exact-graph-reconstruction-from","title":"GRAIN: Exact Graph Reconstruction from Gradients","date":"2025-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"insait-institute/grain","path":"src/extract_neptune.py","file_url":"https://github.com/insait-institute/grain/blob/HEAD/src/extract_neptune.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":"68917fefa350c8e4","code_sha256_prefix":"68917fefa350c8e4","mcp_get_code":{"code_sha256":"68917fefa350c8e4"}},{"arxiv_id":"2411.01535","arxiv_id_is_arxiv":true,"paper":"/paper/customized-subgraph-selection-and-encoding","title":"Customized Subgraph Selection and Encoding for Drug-drug Interaction Prediction","date":"2024-11-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LARS-research/CSSE-DDI","path":"model/lte_models.py","file_url":"https://github.com/LARS-research/CSSE-DDI/blob/HEAD/model/lte_models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, LARS-research/CSSE-DDI when it was checked","code_sha256":"ae1ab58e0972762d","code_sha256_prefix":"ae1ab58e0972762d","mcp_get_code":{"code_sha256":"ae1ab58e0972762d"}},{"arxiv_id":"2407.05705","arxiv_id_is_arxiv":true,"paper":"/paper/fast-and-continual-knowledge-graph-embedding","title":"Fast and Continual Knowledge Graph Embedding via Incremental LoRA","date":"2024-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"seukgcode/FastKGE","path":"src/utils.py","file_url":"https://github.com/seukgcode/FastKGE/blob/HEAD/src/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, seukgcode/FastKGE when it was checked","code_sha256":"c5332ac773270ba2","code_sha256_prefix":"c5332ac773270ba2","mcp_get_code":{"code_sha256":"c5332ac773270ba2"}},{"arxiv_id":"2405.15586","arxiv_id_is_arxiv":true,"paper":"/paper/dager-exact-gradient-inversion-for-large","title":"DAGER: Exact Gradient Inversion for Large Language Models","date":"2024-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"insait-institute/dager-gradient-inversion","path":"analyze_neptune.py","file_url":"https://github.com/insait-institute/dager-gradient-inversion/blob/HEAD/analyze_neptune.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":"68917fefa350c8e4","code_sha256_prefix":"68917fefa350c8e4","mcp_get_code":{"code_sha256":"68917fefa350c8e4"}},{"arxiv_id":"2405.04453","arxiv_id_is_arxiv":true,"paper":"/paper/towards-continual-knowledge-graph-embedding","title":"Towards Continual Knowledge Graph Embedding via Incremental Distillation","date":"2024-05-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"seukgcode/IncDE","path":"src/utils.py","file_url":"https://github.com/seukgcode/IncDE/blob/HEAD/src/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, seukgcode/IncDE when it was checked","code_sha256":"c5332ac773270ba2","code_sha256_prefix":"c5332ac773270ba2","mcp_get_code":{"code_sha256":"c5332ac773270ba2"}},{"arxiv_id":"2404.12362","arxiv_id_is_arxiv":true,"paper":"/paper/transformer-tricks-removing-weights-for","title":"Transformer tricks: Removing weights for skipless transformers","date":"2024-04-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"openmachine-ai/transformer-tricks","path":"transformer_tricks.py","file_url":"https://github.com/openmachine-ai/transformer-tricks/blob/HEAD/transformer_tricks.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":"aae2e9803ea68042","code_sha256_prefix":"aae2e9803ea68042","mcp_get_code":{"code_sha256":"aae2e9803ea68042"}},{"arxiv_id":"2402.11846","arxiv_id_is_arxiv":true,"paper":"/paper/unlearncanvas-a-stylized-image-dataset-to","title":"UnlearnCanvas: Stylized Image Dataset for Enhanced Machine Unlearning Evaluation in Diffusion Models","date":"2024-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JingWu321/EraseDiff","path":"sd/train_scripts/erasediff.py","file_url":"https://github.com/JingWu321/EraseDiff/blob/HEAD/sd/train_scripts/erasediff.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, JingWu321/EraseDiff when it was checked","code_sha256":"2ccf562d07794d65","code_sha256_prefix":"2ccf562d07794d65","mcp_get_code":{"code_sha256":"2ccf562d07794d65"}},{"arxiv_id":"2402.04054","arxiv_id_is_arxiv":true,"paper":"/paper/more-flexible-pac-bayesian-meta-learning-by","title":"More Flexible PAC-Bayesian Meta-Learning by Learning Learning Algorithms","date":"2024-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hzakerinia/flexible-pac-bayes-meta-learning","path":"PriorMetaLearning/Get_Objective_MPB.py","file_url":"https://github.com/hzakerinia/flexible-pac-bayes-meta-learning/blob/HEAD/PriorMetaLearning/Get_Objective_MPB.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, hzakerinia/flexible-pac-bayes-meta-learning when it was checked","code_sha256":"6e1e341585a9b2c5","code_sha256_prefix":"6e1e341585a9b2c5","mcp_get_code":{"code_sha256":"6e1e341585a9b2c5"}},{"arxiv_id":"2401.05779","arxiv_id_is_arxiv":true,"paper":"/paper/erasediff-erasing-data-influence-in-diffusion","title":"Erasing Undesirable Influence in Diffusion Models","date":"2024-01-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jingwu321/erasediff","path":"sd/train_scripts/erasediff.py","file_url":"https://github.com/jingwu321/erasediff/blob/HEAD/sd/train_scripts/erasediff.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, jingwu321/erasediff when it was checked","code_sha256":"2ccf562d07794d65","code_sha256_prefix":"2ccf562d07794d65","mcp_get_code":{"code_sha256":"2ccf562d07794d65"}},{"arxiv_id":"2210.10837","arxiv_id_is_arxiv":true,"paper":"/paper/on-learning-fairness-and-accuracy-on-multiple","title":"On Learning Fairness and Accuracy on Multiple Subgroups","date":"2022-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xugezheng/fams","path":"engine/fair_training.py","file_url":"https://github.com/xugezheng/fams/blob/HEAD/engine/fair_training.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"848d9716cf25c800","code_sha256_prefix":"848d9716cf25c800","mcp_get_code":{"code_sha256":"848d9716cf25c800"}},{"arxiv_id":"2004.05199","arxiv_id_is_arxiv":true,"paper":"/paper/hamiltonian-dynamics-for-real-world-shape","title":"Hamiltonian Dynamics for Real-World Shape Interpolation","date":"2020-04-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"marvin-eisenberger/hamiltonian-interpolation","path":"main_interpolation.py","file_url":"https://github.com/marvin-eisenberger/hamiltonian-interpolation/blob/HEAD/main_interpolation.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":"ae96ad19e8a8aac7","code_sha256_prefix":"ae96ad19e8a8aac7","mcp_get_code":{"code_sha256":"ae96ad19e8a8aac7"}},{"arxiv_id":"1911.04933","arxiv_id_is_arxiv":true,"paper":"/paper/eternal-sunshine-of-the-spotless-net","title":"Eternal Sunshine of the Spotless Net: Selective Forgetting in Deep Networks","date":"2019-11-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zero-or-one/URP","path":"models/models_utils.py","file_url":"https://github.com/zero-or-one/URP/blob/HEAD/models/models_utils.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":"16051d5190516416","code_sha256_prefix":"16051d5190516416","mcp_get_code":{"code_sha256":"16051d5190516416"}},{"arxiv_id":"1911.03082","arxiv_id_is_arxiv":true,"paper":"/paper/composition-based-multi-relational-graph","title":"Composition-based Multi-Relational Graph Convolutional Networks","date":"2019-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"malllabiisc/CompGCN","path":"helper.py","file_url":"https://github.com/malllabiisc/CompGCN/blob/HEAD/helper.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":"892c466d12dfb05b","code_sha256_prefix":"892c466d12dfb05b","mcp_get_code":{"code_sha256":"892c466d12dfb05b"}},{"arxiv_id":"aaai_28602","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_28602","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Sainzerjj/SFERD","path":"diffusion/utils.py","file_url":"https://github.com/Sainzerjj/SFERD/blob/HEAD/diffusion/utils.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":"a80dffb347144cb4","code_sha256_prefix":"a80dffb347144cb4","mcp_get_code":{"code_sha256":"a80dffb347144cb4"}},{"arxiv_id":"2022.findings-emnlp.341","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2022.findings-emnlp.341","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"vinhsuhi/JMAC","path":"JMAC_DBPv1/modules/helper/helper.py","file_url":"https://github.com/vinhsuhi/JMAC/blob/HEAD/JMAC_DBPv1/modules/helper/helper.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":"3e25584b85b42780","code_sha256_prefix":"3e25584b85b42780","mcp_get_code":{"code_sha256":"3e25584b85b42780"}}],"record_sha256":"a4da28b94533312b2489f62a559caccecb068305a7606de70f9a6928bd43ea22","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}