{"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/eval-step","entry":"eval_step","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":10,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":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":13,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":1,"n_samples_unverified":9,"n_samples_fingerprinted":0,"n_places":13,"n_places_pointer_only":7,"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":1,"ran_fixture":0,"ran":3,"unverified":9},"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":"2509.07963","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-07963","title":"Customizing the Inductive Biases of Softmax Attention using Structured Matrices","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"YilunKuang/structured-attention","path":"train_ICL.py","file_url":"https://github.com/YilunKuang/structured-attention/blob/HEAD/train_ICL.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":"53782f15c39fa389","code_sha256_prefix":"53782f15c39fa389","mcp_get_code":{"code_sha256":"53782f15c39fa389"}},{"arxiv_id":"2406.04601","arxiv_id_is_arxiv":true,"paper":"/paper/enhancing-size-generalization-in-graph-neural","title":"Enhancing Size Generalization in Graph Neural Networks through Disentangled Representation Learning","date":"2024-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"graphminddartmouth/disgen","path":"src/train_util.py","file_url":"https://github.com/graphminddartmouth/disgen/blob/HEAD/src/train_util.py","status":"unverified","verification_level":0,"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, graphminddartmouth/disgen when it was checked","code_sha256":"8dd72428904bc682","code_sha256_prefix":"8dd72428904bc682","mcp_get_code":{"code_sha256":"8dd72428904bc682"}},{"arxiv_id":"2402.03485","arxiv_id_is_arxiv":true,"paper":"/paper/attention-meets-post-hoc-interpretability-a","title":"Attention Meets Post-hoc Interpretability: A Mathematical Perspective","date":"2024-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gianluigilopardo/attention_meets_xai","path":"multi_head_trainer.py","file_url":"https://github.com/gianluigilopardo/attention_meets_xai/blob/HEAD/multi_head_trainer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, gianluigilopardo/attention_meets_xai when it was checked","code_sha256":"5346471696249003","code_sha256_prefix":"5346471696249003","mcp_get_code":{"code_sha256":"5346471696249003"}},{"arxiv_id":"2312.01538","arxiv_id_is_arxiv":true,"paper":"/paper/recurrent-distance-encoding-neural-networks","title":"Recurrent Distance Filtering for Graph Representation Learning","date":"2023-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"skeletondyh/GRED","path":"train_peptides_func.py","file_url":"https://github.com/skeletondyh/GRED/blob/HEAD/train_peptides_func.py","status":"unverified","verification_level":0,"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, skeletondyh/GRED when it was checked","code_sha256":"33f96f60e03d9f4d","code_sha256_prefix":"33f96f60e03d9f4d","mcp_get_code":{"code_sha256":"33f96f60e03d9f4d"}},{"arxiv_id":"2312.01538","arxiv_id_is_arxiv":true,"paper":"/paper/recurrent-distance-encoding-neural-networks","title":"Recurrent Distance Filtering for Graph Representation Learning","date":"2023-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"skeletondyh/GRED","path":"train_peptides_struct.py","file_url":"https://github.com/skeletondyh/GRED/blob/HEAD/train_peptides_struct.py","status":"unverified","verification_level":0,"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, skeletondyh/GRED when it was checked","code_sha256":"573953132860b6c8","code_sha256_prefix":"573953132860b6c8","mcp_get_code":{"code_sha256":"573953132860b6c8"}},{"arxiv_id":"2312.01538","arxiv_id_is_arxiv":true,"paper":"/paper/recurrent-distance-encoding-neural-networks","title":"Recurrent Distance Filtering for Graph Representation Learning","date":"2023-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"skeletondyh/GRED","path":"train_pixel.py","file_url":"https://github.com/skeletondyh/GRED/blob/HEAD/train_pixel.py","status":"unverified","verification_level":0,"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, skeletondyh/GRED when it was checked","code_sha256":"361ca6724f795584","code_sha256_prefix":"361ca6724f795584","mcp_get_code":{"code_sha256":"361ca6724f795584"}},{"arxiv_id":"2312.01538","arxiv_id_is_arxiv":true,"paper":"/paper/recurrent-distance-encoding-neural-networks","title":"Recurrent Distance Filtering for Graph Representation Learning","date":"2023-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"skeletondyh/GRED","path":"train_sbm.py","file_url":"https://github.com/skeletondyh/GRED/blob/HEAD/train_sbm.py","status":"unverified","verification_level":0,"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, skeletondyh/GRED when it was checked","code_sha256":"2ce1907d2dc05d8f","code_sha256_prefix":"2ce1907d2dc05d8f","mcp_get_code":{"code_sha256":"2ce1907d2dc05d8f"}},{"arxiv_id":"2310.16355","arxiv_id_is_arxiv":true,"paper":"/paper/redco-a-lightweight-tool-to-automate","title":"RedCoast: A Lightweight Tool to Automate Distributed Training of LLMs on Any GPU/TPUs","date":"2023-10-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tanyuqian/redco","path":"redco/trainers/utils.py","file_url":"https://github.com/tanyuqian/redco/blob/HEAD/redco/trainers/utils.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":"4925175b59c41e2d","code_sha256_prefix":"4925175b59c41e2d","mcp_get_code":{"code_sha256":"4925175b59c41e2d"}},{"arxiv_id":"2310.04687","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-and-improving-adversarial","title":"Targeted Attack Improves Protection against Unauthorized Diffusion Customization","date":"2023-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"caradryanliang/improvedadvdm","path":"evaluation.py","file_url":"https://github.com/caradryanliang/improvedadvdm/blob/HEAD/evaluation.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, caradryanliang/improvedadvdm when it was checked","code_sha256":"7f5f265e8a1e513c","code_sha256_prefix":"7f5f265e8a1e513c","mcp_get_code":{"code_sha256":"7f5f265e8a1e513c"}},{"arxiv_id":"2304.14082","arxiv_id_is_arxiv":true,"paper":"/paper/jaxpruner-a-concise-library-for-sparsity","title":"JaxPruner: A concise library for sparsity research","date":"2023-04-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/jaxpruner","path":"jaxpruner/baselines/scenic/classification_trainer.py","file_url":"https://github.com/google-research/jaxpruner/blob/HEAD/jaxpruner/baselines/scenic/classification_trainer.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":"c6a6436e3a9a3b4d","code_sha256_prefix":"c6a6436e3a9a3b4d","mcp_get_code":{"code_sha256":"c6a6436e3a9a3b4d"}},{"arxiv_id":"2201.05989","arxiv_id_is_arxiv":true,"paper":"/paper/instant-neural-graphics-primitives-with-a","title":"Instant Neural Graphics Primitives with a Multiresolution Hash Encoding","date":"2022-01-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"blurgyy/jaxngp","path":"app/imagefit.py","file_url":"https://github.com/blurgyy/jaxngp/blob/HEAD/app/imagefit.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":"e1d0a3ae170c33ea","code_sha256_prefix":"e1d0a3ae170c33ea","mcp_get_code":{"code_sha256":"e1d0a3ae170c33ea"}},{"arxiv_id":"2112.05253","arxiv_id_is_arxiv":true,"paper":"/paper/magma-multimodal-augmentation-of-generative","title":"MAGMA -- Multimodal Augmentation of Generative Models through Adapter-based Finetuning","date":"2021-12-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Aleph-Alpha/magma","path":"magma/train_loop.py","file_url":"https://github.com/Aleph-Alpha/magma/blob/HEAD/magma/train_loop.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":"5efa2a11277a7471","code_sha256_prefix":"5efa2a11277a7471","mcp_get_code":{"code_sha256":"5efa2a11277a7471"}},{"arxiv_id":"1810.11738","arxiv_id_is_arxiv":true,"paper":"/paper/gaussian-process-prior-variational","title":"Gaussian Process Prior Variational Autoencoders","date":"2018-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fpcasale/GPPVAE","path":"pysrc/faceplace/train_gppvae.py","file_url":"https://github.com/fpcasale/GPPVAE/blob/HEAD/pysrc/faceplace/train_gppvae.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":"9df13e595576ff5e","code_sha256_prefix":"9df13e595576ff5e","mcp_get_code":{"code_sha256":"9df13e595576ff5e"}}],"record_sha256":"4cb15cace233a6aecabd0dad846d7c425094b39c9d2c0fe02cc93e46a4e90690","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}