{"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/laplacian-2","entry":"Laplacian","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-25T09:33:49+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":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":4,"n_samples_ran":2,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":1,"unverified":2},"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":"2608.10247","paper":"/paper/arxiv-2608-10247","title":"DualSpectralCF: Training-Free Sign-Aware Spectral Collaborative Filtering *","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"guanqun-yang/DualSpectralCF","path":"src/model.py","file_url":"https://github.com/guanqun-yang/DualSpectralCF/blob/HEAD/src/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"36ab54801e19f460","mcp_get_code":{"code_sha256":"36ab54801e19f460"}},{"arxiv_id":"2306.09623","paper":"/paper/from-hypergraph-energy-functions-to","title":"From Hypergraph Energy Functions to Hypergraph Neural Networks","date":"2023-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"malllabiisc/HyperGCN","path":"model/utils.py","file_url":"https://github.com/malllabiisc/HyperGCN/blob/HEAD/model/utils.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":"62a8829b5b3e655b","mcp_get_code":{"code_sha256":"62a8829b5b3e655b"}},{"arxiv_id":"2302.03933","paper":"/paper/graph-signal-sampling-for-inductive-one-bit","title":"Graph Signal Sampling for Inductive One-Bit Matrix Completion: a Closed-form Solution","date":"2023-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cchao0116/GSIMC-ICLR2023","path":"src/model.py","file_url":"https://github.com/cchao0116/GSIMC-ICLR2023/blob/HEAD/src/model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0888cac7f58926f1","mcp_get_code":{"code_sha256":"0888cac7f58926f1"}},{"arxiv_id":"2210.08008","paper":"/paper/inductive-logical-query-answering-in","title":"Inductive Logical Query Answering in Knowledge Graphs","date":"2022-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tgebhart/sheaf_kg_transind","path":"script/batch_harmonic_extension.py","file_url":"https://github.com/tgebhart/sheaf_kg_transind/blob/HEAD/script/batch_harmonic_extension.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"44ba9622ce9741b3","mcp_get_code":{"code_sha256":"44ba9622ce9741b3"}},{"arxiv_id":"2207.06680","paper":"/paper/equivariant-hypergraph-diffusion-neural","title":"Equivariant Hypergraph Diffusion Neural Operators","date":"2022-07-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"graph-com/ed-hnn","path":"models/hypergcn.py","file_url":"https://github.com/graph-com/ed-hnn/blob/HEAD/models/hypergcn.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"62a8829b5b3e655b","mcp_get_code":{"code_sha256":"62a8829b5b3e655b"}},{"arxiv_id":"2105.00956","paper":"/paper/unignn-a-unified-framework-for-graph-and","title":"UniGNN: a Unified Framework for Graph and Hypergraph Neural Networks","date":"2021-05-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"OneForward/UniGNN","path":"model/HyperGCN.py","file_url":"https://github.com/OneForward/UniGNN/blob/HEAD/model/HyperGCN.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"62a8829b5b3e655b","mcp_get_code":{"code_sha256":"62a8829b5b3e655b"}}]}