{"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/safe-norm","entry":"safe_norm","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":6,"n_papers_ran_instrument_only":2,"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":4,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":9,"n_places_pointer_only":3,"n_places_pointer_only_link_open":2,"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":1,"ran":4,"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":"2501.17965","arxiv_id_is_arxiv":true,"paper":"/paper/variational-combinatorial-sequential-monte-1","title":"Variational Combinatorial Sequential Monte Carlo for Bayesian Phylogenetics in Hyperbolic Space","date":"2025-01-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"axchen7/vcsmc","path":"vcsmc/utils/distance_utils.py","file_url":"https://github.com/axchen7/vcsmc/blob/HEAD/vcsmc/utils/distance_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":"51cf12d8bfb2bf4f","code_sha256_prefix":"51cf12d8bfb2bf4f","mcp_get_code":{"code_sha256":"51cf12d8bfb2bf4f"}},{"arxiv_id":"2411.10618","arxiv_id_is_arxiv":true,"paper":"/paper/d-flow-multi-modality-flow-matching-for-d","title":"D-Flow: Multi-modality Flow Matching for D-peptide Design","date":null,"month_inferred_from_arxiv_id":"2024-11","title_source":"archive","repo":"smiles724/peptidedesign","path":"dflow/models/geometry.py","file_url":"https://github.com/smiles724/peptidedesign/blob/HEAD/dflow/models/geometry.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, smiles724/peptidedesign when it was checked","code_sha256":"e253039723a2f1f8","code_sha256_prefix":"e253039723a2f1f8","mcp_get_code":{"code_sha256":"e253039723a2f1f8"}},{"arxiv_id":"2306.07179","arxiv_id_is_arxiv":true,"paper":"/paper/benchmarking-neural-network-training","title":"Benchmarking Neural Network Training Algorithms","date":"2023-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deepmind/optax","path":"optax/_src/numerics.py","file_url":"https://github.com/deepmind/optax/blob/HEAD/optax/_src/numerics.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":"8446f6b71ea9fde1","code_sha256_prefix":"8446f6b71ea9fde1","mcp_get_code":{"code_sha256":"8446f6b71ea9fde1"}},{"arxiv_id":"2303.14505","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-inference-of-signed-distance","title":"Unsupervised Inference of Signed Distance Functions from Single Sparse Point Clouds without Learning Priors","date":"2023-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chenchao15/NeuralTPS","path":"sample_query_point.py","file_url":"https://github.com/chenchao15/NeuralTPS/blob/HEAD/sample_query_point.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6043a99e59a7e14d","code_sha256_prefix":"6043a99e59a7e14d","mcp_get_code":{"code_sha256":"6043a99e59a7e14d"}},{"arxiv_id":"2301.12842","arxiv_id_is_arxiv":true,"paper":"/paper/direct-preference-based-policy-optimization-1","title":"Direct Preference-based Policy Optimization without Reward Modeling","date":"2023-01-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"snu-mllab/DPPO","path":"learner.py","file_url":"https://github.com/snu-mllab/DPPO/blob/HEAD/learner.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":"908dca4182b46323","code_sha256_prefix":"908dca4182b46323","mcp_get_code":{"code_sha256":"908dca4182b46323"}},{"arxiv_id":"2207.08631","arxiv_id_is_arxiv":true,"paper":"/paper/latent-partition-implicit-with-surface-codes","title":"Latent Partition Implicit with Surface Codes for 3D Representation","date":"2022-07-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chenchao15/LPI","path":"LPI.py","file_url":"https://github.com/chenchao15/LPI/blob/HEAD/LPI.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6043a99e59a7e14d","code_sha256_prefix":"6043a99e59a7e14d","mcp_get_code":{"code_sha256":"6043a99e59a7e14d"}},{"arxiv_id":"2203.14486","arxiv_id_is_arxiv":true,"paper":"/paper/equivariant-point-cloud-analysis-via-learning","title":"Equivariant Point Cloud Analysis via Learning Orientations for Message Passing","date":"2022-03-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"luost26/equivariant-orientedmp","path":"modules/geometric.py","file_url":"https://github.com/luost26/equivariant-orientedmp/blob/HEAD/modules/geometric.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from smiles724/peptidedesign, and GitHub detected no licence in that repository when it was checked","code_sha256":"e253039723a2f1f8","code_sha256_prefix":"e253039723a2f1f8","mcp_get_code":{"code_sha256":"e253039723a2f1f8"}},{"arxiv_id":"2201.13299","arxiv_id_is_arxiv":true,"paper":"/paper/directed-weight-neural-networks-for-protein","title":"Orientation-Aware Graph Neural Networks for Protein Structure Representation Learning","date":"2022-01-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ced3-han/oagnn","path":"modules/common.py","file_url":"https://github.com/ced3-han/oagnn/blob/HEAD/modules/common.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from smiles724/peptidedesign, and GitHub detected no licence in that repository when it was checked","code_sha256":"e253039723a2f1f8","code_sha256_prefix":"e253039723a2f1f8","mcp_get_code":{"code_sha256":"e253039723a2f1f8"}},{"arxiv_id":"1710.09829","arxiv_id_is_arxiv":true,"paper":"/paper/dynamic-routing-between-capsules","title":"Dynamic Routing Between Capsules","date":"2017-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ameliajimenez/capsule-networks-medical-data-challenges","path":"networks/capsnet.py","file_url":"https://github.com/ameliajimenez/capsule-networks-medical-data-challenges/blob/HEAD/networks/capsnet.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":"852e571b48325d2a","code_sha256_prefix":"852e571b48325d2a","mcp_get_code":{"code_sha256":"852e571b48325d2a"}}],"record_sha256":"ec11a18f826edf71b3fba921aee072c23451dc9c59987ef00bfcc98311380286","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}