{"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/hasnumbers","entry":"hasNumbers","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":2,"n_samples_ran":1,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":1,"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":"2404.10321","paper":"/paper/cluster-based-graph-collaborative-filtering","title":"Cluster-based Graph Collaborative Filtering","date":"2024-04-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhao254014/clustergcf","path":"ClusterGCF/utility/helper.py","file_url":"https://github.com/zhao254014/clustergcf/blob/HEAD/ClusterGCF/utility/helper.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f16f715a59169c8a","mcp_get_code":{"code_sha256":"f16f715a59169c8a"}},{"arxiv_id":"2312.16203","paper":"/paper/user-consented-federated-recommender-system","title":"User Consented Federated Recommender System Against Personalized Attribute Inference Attack","date":"2023-12-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hkust-knowcomp/uc-fedrec","path":"utility/helper.py","file_url":"https://github.com/hkust-knowcomp/uc-fedrec/blob/HEAD/utility/helper.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f16f715a59169c8a","mcp_get_code":{"code_sha256":"f16f715a59169c8a"}},{"arxiv_id":"2007.01764","paper":"/paper/disentangled-graph-collaborative-filtering","title":"Disentangled Graph Collaborative Filtering","date":"2020-07-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Tingting2477/DGCF_torch","path":"DGCF_torch/helper.py","file_url":"https://github.com/Tingting2477/DGCF_torch/blob/HEAD/DGCF_torch/helper.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f16f715a59169c8a","mcp_get_code":{"code_sha256":"f16f715a59169c8a"}},{"arxiv_id":"1905.08108","paper":"/paper/neural-graph-collaborative-filtering","title":"Neural Graph Collaborative Filtering","date":"2019-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"immabe/NGCF_pytorch","path":"NGCF/utility/helper.py","file_url":"https://github.com/immabe/NGCF_pytorch/blob/HEAD/NGCF/utility/helper.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f16f715a59169c8a","mcp_get_code":{"code_sha256":"f16f715a59169c8a"}},{"arxiv_id":"1905.07854","paper":"/paper/kgat-knowledge-graph-attention-network-for","title":"KGAT: Knowledge Graph Attention Network for Recommendation","date":"2019-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xiangwang1223/knowledge_graph_attention_network","path":"Model/utility/helper.py","file_url":"https://github.com/xiangwang1223/knowledge_graph_attention_network/blob/HEAD/Model/utility/helper.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f16f715a59169c8a","mcp_get_code":{"code_sha256":"f16f715a59169c8a"}},{"arxiv_id":"1804.08217","paper":"/paper/mem2seq-effectively-incorporating-knowledge","title":"Mem2Seq: Effectively Incorporating Knowledge Bases into End-to-End Task-Oriented Dialog Systems","date":"2018-04-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HLTCHKUST/Mem2Seq","path":"utils/utils_babi_mem2seq.py","file_url":"https://github.com/HLTCHKUST/Mem2Seq/blob/HEAD/utils/utils_babi_mem2seq.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6dee9d5e2ef61908","mcp_get_code":{"code_sha256":"6dee9d5e2ef61908"}}]}