{"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/t","entry":"T","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":8,"n_papers_ran_no_instrument_failure":8,"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":9,"n_samples_ran":8,"n_samples_constructed":1,"n_samples_ran_checked":8,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":4,"n_places":9,"n_places_pointer_only":3,"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":0,"ran_fixture":0,"ran":6,"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":"2504.09374","arxiv_id_is_arxiv":true,"paper":"/paper/hierarchical-protein-backbone-generation-with","title":"Hierarchical protein backbone generation with latent and structure diffusion","date":"2025-04-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aqlaboratory/genie2","path":"genie/model/structure_net.py","file_url":"https://github.com/aqlaboratory/genie2/blob/HEAD/genie/model/structure_net.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":"ac7fd878729b5dfd","code_sha256_prefix":"ac7fd878729b5dfd","mcp_get_code":{"code_sha256":"ac7fd878729b5dfd"}},{"arxiv_id":"2410.01537","arxiv_id_is_arxiv":true,"paper":"/paper/attention-layers-provably-solve-single","title":"Attention layers provably solve single-location regression","date":"2024-10-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pierremarion23/single-location-regression","path":"dynamics.py","file_url":"https://github.com/pierremarion23/single-location-regression/blob/HEAD/dynamics.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":"fa6dc6bcf90c743f","code_sha256_prefix":"fa6dc6bcf90c743f","mcp_get_code":{"code_sha256":"fa6dc6bcf90c743f"}},{"arxiv_id":"2406.02309","arxiv_id_is_arxiv":true,"paper":"/paper/effects-of-exponential-gaussian-distribution","title":"Effects of Exponential Gaussian Distribution on (Double Sampling) Randomized Smoothing","date":"2024-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tdano1/eg-on-smoothing","path":"th_heuristic.py","file_url":"https://github.com/tdano1/eg-on-smoothing/blob/HEAD/th_heuristic.py","status":"ran","verification_level":1,"contract_check":null,"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, tdano1/eg-on-smoothing when it was checked","code_sha256":"46f3c7ec743814b7","code_sha256_prefix":"46f3c7ec743814b7","mcp_get_code":{"code_sha256":"46f3c7ec743814b7"}},{"arxiv_id":"2405.15252","arxiv_id_is_arxiv":true,"paper":"/paper/fast-3d-molecule-generation-via-unified","title":"Fast 3D Molecule Generation via Unified Geometric Optimal Transport","date":"2024-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HaokaiHong/GOAT","path":"models/goat.py","file_url":"https://github.com/HaokaiHong/GOAT/blob/HEAD/models/goat.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, HaokaiHong/GOAT when it was checked","code_sha256":"b7c96c37f7279a53","code_sha256_prefix":"b7c96c37f7279a53","mcp_get_code":{"code_sha256":"b7c96c37f7279a53"}},{"arxiv_id":"2403.20200","arxiv_id_is_arxiv":true,"paper":"/paper/high-dimensional-analysis-of-ridge-regression","title":"High-dimensional analysis of ridge regression for non-identically distributed data with a variance profile","date":"2024-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"issoudab/ridgeregressionvarianceprofile","path":"utils.py","file_url":"https://github.com/issoudab/ridgeregressionvarianceprofile/blob/HEAD/utils.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, issoudab/ridgeregressionvarianceprofile when it was checked","code_sha256":"dcb59b21789f8752","code_sha256_prefix":"dcb59b21789f8752","mcp_get_code":{"code_sha256":"dcb59b21789f8752"}},{"arxiv_id":"2306.14773","arxiv_id_is_arxiv":true,"paper":"/paper/unifying-the-design-space-of-truss","title":"Unifying the design space and optimizing linear and nonlinear truss metamaterials by generative modeling","date":null,"month_inferred_from_arxiv_id":"2023-06","title_source":"archive","repo":"li-zhengz/unifyingtrussdesignspace","path":"dataGeneration/moveNodes.py","file_url":"https://github.com/li-zhengz/unifyingtrussdesignspace/blob/HEAD/dataGeneration/moveNodes.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":"216f1bad40c3584f","code_sha256_prefix":"216f1bad40c3584f","mcp_get_code":{"code_sha256":"216f1bad40c3584f"}},{"arxiv_id":"2203.06462","arxiv_id_is_arxiv":true,"paper":"/paper/low-rank-softmax-can-have-unargmaxable-1","title":"Low-Rank Softmax Can Have Unargmaxable Classes in Theory but Rarely in Practice","date":"2022-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"andreasgrv/unargmaxable","path":"paper/appendix/braid-slice-regions/count_regions.py","file_url":"https://github.com/andreasgrv/unargmaxable/blob/HEAD/paper/appendix/braid-slice-regions/count_regions.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":"6b4db4e8842f98c8","code_sha256_prefix":"6b4db4e8842f98c8","mcp_get_code":{"code_sha256":"6b4db4e8842f98c8"}},{"arxiv_id":"1806.00550","arxiv_id_is_arxiv":true,"paper":"/paper/a-swiss-army-infinitesimal-jackknife","title":"A Swiss Army Infinitesimal Jackknife","date":null,"month_inferred_from_arxiv_id":"2018-06","title_source":"archive","repo":"rgiordan/paragami","path":"paragami/autograd_supplement_lib.py","file_url":"https://github.com/rgiordan/paragami/blob/HEAD/paragami/autograd_supplement_lib.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":"c58078439679996f","code_sha256_prefix":"c58078439679996f","mcp_get_code":{"code_sha256":"c58078439679996f"}},{"arxiv_id":"1801.04062","arxiv_id_is_arxiv":true,"paper":"/paper/mine-mutual-information-neural-estimation","title":"MINE: Mutual Information Neural Estimation","date":"2018-01-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gtegner/mine-pytorch","path":"mine/models/mine.py","file_url":"https://github.com/gtegner/mine-pytorch/blob/HEAD/mine/models/mine.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9344ddbf1a3fe029","code_sha256_prefix":"9344ddbf1a3fe029","mcp_get_code":{"code_sha256":"9344ddbf1a3fe029"}}],"record_sha256":"672f46acc4a3d9a4ae3669dc5f93b52e2176fda76dd5badc990fda1e1954c45c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}