{"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/get-dim-act-curv","entry":"get_dim_act_curv","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":6,"n_papers_ran":5,"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":0,"n_places":6,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":1,"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":"2505.08157","paper":"/paper/hyperbolic-contrastive-learning-with-model","title":"Hyperbolic Contrastive Learning with Model-augmentation for Knowledge-aware Recommendation","date":"2025-05-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sunshy-1/HCMKR","path":"code/layers/hyp_layers.py","file_url":"https://github.com/sunshy-1/HCMKR/blob/HEAD/code/layers/hyp_layers.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5a890d31b81d5078","mcp_get_code":{"code_sha256":"5a890d31b81d5078"}},{"arxiv_id":"2405.03188","paper":"/paper/hyperbolic-geometric-latent-diffusion-model","title":"Hyperbolic Geometric Latent Diffusion Model for Graph Generation","date":"2024-05-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ringbdstack/hypdiff","path":"layers/hyp_layers.py","file_url":"https://github.com/ringbdstack/hypdiff/blob/HEAD/layers/hyp_layers.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e5f19b97aeeb95d9","mcp_get_code":{"code_sha256":"e5f19b97aeeb95d9"}},{"arxiv_id":"2401.15478","paper":"/paper/product-manifold-representations-for-learning","title":"Product Manifold Representations for Learning on Biological Pathways","date":"2024-01-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mcneela/mixed-curvature-gcn","path":"layers/hyp_layers.py","file_url":"https://github.com/mcneela/mixed-curvature-gcn/blob/HEAD/layers/hyp_layers.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"5a890d31b81d5078","mcp_get_code":{"code_sha256":"5a890d31b81d5078"}},{"arxiv_id":"2106.03134","paper":"/paper/semi-riemannian-graph-convolutional-networks","title":"Pseudo-Riemannian Graph Convolutional Networks","date":"2021-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xiongbo010/qgcn","path":"layers/hyp_layers.py","file_url":"https://github.com/xiongbo010/qgcn/blob/HEAD/layers/hyp_layers.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"93fff6b57b2f74cb","mcp_get_code":{"code_sha256":"93fff6b57b2f74cb"}},{"arxiv_id":"2105.14686","paper":"/paper/fully-hyperbolic-neural-networks","title":"Fully Hyperbolic Neural Networks","date":"2021-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chenweize1998/fully-hyperbolic-nn","path":"gcn/layers/hyp_layers.py","file_url":"https://github.com/chenweize1998/fully-hyperbolic-nn/blob/HEAD/gcn/layers/hyp_layers.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5a890d31b81d5078","mcp_get_code":{"code_sha256":"5a890d31b81d5078"}},{"arxiv_id":"2103.16046","paper":"/paper/unsupervised-hyperbolic-representation","title":"Unsupervised Hyperbolic Representation Learning via Message Passing Auto-Encoders","date":"2021-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"junhocho/HGCAE","path":"models/encoders.py","file_url":"https://github.com/junhocho/HGCAE/blob/HEAD/models/encoders.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"16ac17aa0ccb2abf","mcp_get_code":{"code_sha256":"16ac17aa0ccb2abf"}}]}