{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/safe-norm","entry":"safe_norm","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":9,"n_papers_ran":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":1,"n_samples_fingerprinted":0,"n_places":9,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":1,"ran":0,"unverified":5},"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","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"51cf12d8bfb2bf4f","mcp_get_code":{"code_sha256":"51cf12d8bfb2bf4f"}},{"arxiv_id":"2411.10618","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e253039723a2f1f8","mcp_get_code":{"code_sha256":"e253039723a2f1f8"}},{"arxiv_id":"2306.07179","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"8446f6b71ea9fde1","mcp_get_code":{"code_sha256":"8446f6b71ea9fde1"}},{"arxiv_id":"2303.14505","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,"code_sha256_prefix":"6043a99e59a7e14d","mcp_get_code":{"code_sha256":"6043a99e59a7e14d"}},{"arxiv_id":"2301.12842","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"908dca4182b46323","mcp_get_code":{"code_sha256":"908dca4182b46323"}},{"arxiv_id":"2207.08631","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,"code_sha256_prefix":"6043a99e59a7e14d","mcp_get_code":{"code_sha256":"6043a99e59a7e14d"}},{"arxiv_id":"2203.14486","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e253039723a2f1f8","mcp_get_code":{"code_sha256":"e253039723a2f1f8"}},{"arxiv_id":"2201.13299","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e253039723a2f1f8","mcp_get_code":{"code_sha256":"e253039723a2f1f8"}},{"arxiv_id":"1710.09829","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,"code_sha256_prefix":"852e571b48325d2a","mcp_get_code":{"code_sha256":"852e571b48325d2a"}}]}