{"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/create-projection-matrix","entry":"create_projection_matrix","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":3,"n_samples_ran":2,"n_samples_fingerprinted":1,"n_places":5,"n_places_pointer_only":2,"by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":0,"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":"2507.11229","paper":null,"title":"arXiv:2507.11229","date":null,"month_inferred_from_arxiv_id":"2025-07","title_source":null,"repo":"USTC-DataDarknessLab/DuetGraph","path":"dual_pathway/src/model.py","file_url":"https://github.com/USTC-DataDarknessLab/DuetGraph/blob/HEAD/dual_pathway/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":"f25c793f69e42fc5","mcp_get_code":{"code_sha256":"f25c793f69e42fc5"}},{"arxiv_id":"2412.08160","paper":"/paper/dg-mamba-robust-and-efficient-dynamic-graph","title":"DG-Mamba: Robust and Efficient Dynamic Graph Structure Learning with Selective State Space Models","date":"2024-12-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RingBDStack/DG-Mamba","path":"REDGSL.py","file_url":"https://github.com/RingBDStack/DG-Mamba/blob/HEAD/REDGSL.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"44fbc869db4685a6","mcp_get_code":{"code_sha256":"44fbc869db4685a6"}},{"arxiv_id":"2410.05877","paper":"/paper/mdap-a-multi-view-disentangled-and-adaptive","title":"MDAP: A Multi-view Disentangled and Adaptive Preference Learning Framework for Cross-Domain Recommendation","date":"2024-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"the-garden-of-sinner/mdap","path":"recbole_cdr/model/layers.py","file_url":"https://github.com/the-garden-of-sinner/mdap/blob/HEAD/recbole_cdr/model/layers.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"466802682f90b8ac","mcp_get_code":{"code_sha256":"466802682f90b8ac"}},{"arxiv_id":"2306.08385","paper":"/paper/nodeformer-a-scalable-graph-structure","title":"NodeFormer: A Scalable Graph Structure Learning Transformer for Node Classification","date":"2023-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qitianwu/NodeFormer","path":"nodeformer.py","file_url":"https://github.com/qitianwu/NodeFormer/blob/HEAD/nodeformer.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"44fbc869db4685a6","mcp_get_code":{"code_sha256":"44fbc869db4685a6"}},{"arxiv_id":"2210.13148","paper":"/paper/transformers-over-directed-acyclic-graphs-1","title":"Transformers over Directed Acyclic Graphs","date":"2022-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LUOyk1999/DAGformer","path":"Node_classification_citation/dag_nodeformer.py","file_url":"https://github.com/LUOyk1999/DAGformer/blob/HEAD/Node_classification_citation/dag_nodeformer.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"44fbc869db4685a6","mcp_get_code":{"code_sha256":"44fbc869db4685a6"}}]}