{"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/unsqueeze-like","entry":"unsqueeze_like","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":5,"n_papers_ran":4,"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":4,"n_samples_ran":3,"n_samples_fingerprinted":3,"n_places":5,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":3,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":1},"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":"2506.09625","paper":"/paper/glgenn-a-novel-parameter-light-equivariant","title":"GLGENN: A Novel Parameter-Light Equivariant Neural Networks Architecture Based on Clifford Geometric Algebras","date":"2025-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"katyafilimoshina/glgenn","path":"models/nbody_glgenn_gnn.py","file_url":"https://github.com/katyafilimoshina/glgenn/blob/HEAD/models/nbody_glgenn_gnn.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7b7e51ca2a20bbb8","mcp_get_code":{"code_sha256":"7b7e51ca2a20bbb8"}},{"arxiv_id":"2407.09926","paper":"/paper/metric-learning-for-clifford-group","title":"Metric Learning for Clifford Group Equivariant Neural Networks","date":"2024-07-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rick-ali/metric-learning-for-cgenns","path":"models/modules/fcgp.py","file_url":"https://github.com/rick-ali/metric-learning-for-cgenns/blob/HEAD/models/modules/fcgp.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f6c0971a1cd07155","mcp_get_code":{"code_sha256":"f6c0971a1cd07155"}},{"arxiv_id":"2402.10011","paper":"/paper/clifford-group-equivariant-simplicial-message","title":"Clifford Group Equivariant Simplicial Message Passing Networks","date":"2024-02-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"congliuuva/clifford-group-equivariant-simplicial-message-passing-networks","path":"csmpn/models/cegnn_utils.py","file_url":"https://github.com/congliuuva/clifford-group-equivariant-simplicial-message-passing-networks/blob/HEAD/csmpn/models/cegnn_utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f6c0971a1cd07155","mcp_get_code":{"code_sha256":"f6c0971a1cd07155"}},{"arxiv_id":"2310.13397","paper":"/paper/equivariant-deep-weight-space-alignment","title":"Equivariant Deep Weight Space Alignment","date":"2023-10-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AvivNavon/deep-align","path":"deepalign/sinkhorn.py","file_url":"https://github.com/AvivNavon/deep-align/blob/HEAD/deepalign/sinkhorn.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"872a1d3182fa7818","mcp_get_code":{"code_sha256":"872a1d3182fa7818"}},{"arxiv_id":"2306.02342","paper":"/paper/deep-optimal-transport-a-practical-algorithm-1","title":"Deep Optimal Transport: A Practical Algorithm for Photo-realistic Image Restoration","date":"2023-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"theoad/dot-dmax","path":"dmax/latent_w2.py","file_url":"https://github.com/theoad/dot-dmax/blob/HEAD/dmax/latent_w2.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e6e29a67faf00eeb","mcp_get_code":{"code_sha256":"e6e29a67faf00eeb"}}]}