{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/code/calculate-normalized-laplacian","entry":"calculate_normalized_laplacian","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+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 = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":11,"n_papers_ran":11,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":8,"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":6,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":4,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":12,"n_places_pointer_only":4,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":4,"ran_fixture":0,"ran":2,"unverified":0},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"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":"2602.05286","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-05286","title":"HealthMamba: An Uncertainty-aware Spatiotemporal Graph State Space Model for Effective and Reliable Healthcare Facility Visit Prediction","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"UFOdestiny/HealthMamba","path":"utils/graph_algo.py","file_url":"https://github.com/UFOdestiny/HealthMamba/blob/HEAD/utils/graph_algo.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a616b4dba35c9611","code_sha256_prefix":"a616b4dba35c9611","mcp_get_code":{"code_sha256":"a616b4dba35c9611"}},{"arxiv_id":"2410.00373","arxiv_id_is_arxiv":true,"paper":"/paper/robust-traffic-forecasting-against-spatial","title":"Robust Traffic Forecasting against Spatial Shift over Years","date":"2024-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dreamzz5/st-expert","path":"src/utils/graph_algo.py","file_url":"https://github.com/dreamzz5/st-expert/blob/HEAD/src/utils/graph_algo.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"52c34de0cec03ed2","code_sha256_prefix":"52c34de0cec03ed2","mcp_get_code":{"code_sha256":"52c34de0cec03ed2"}},{"arxiv_id":"2409.08766","arxiv_id_is_arxiv":true,"paper":"/paper/sauc-sparsity-aware-uncertainty-calibration","title":"SAUC: Sparsity-Aware Uncertainty Calibration for Spatiotemporal Prediction with Graph Neural Networks","date":"2024-09-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AnonymousSAUC/SAUC","path":"models/GWN/util.py","file_url":"https://github.com/AnonymousSAUC/SAUC/blob/HEAD/models/GWN/util.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, AnonymousSAUC/SAUC when it was checked","code_sha256":"e7b2e6a60daa42ca","code_sha256_prefix":"e7b2e6a60daa42ca","mcp_get_code":{"code_sha256":"e7b2e6a60daa42ca"}},{"arxiv_id":"2403.02600","arxiv_id_is_arxiv":true,"paper":"/paper/testam-a-time-enhanced-spatio-temporal","title":"TESTAM: A Time-Enhanced Spatio-Temporal Attention Model with Mixture of Experts","date":"2024-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HyunWookL/TESTAM","path":"util.py","file_url":"https://github.com/HyunWookL/TESTAM/blob/HEAD/util.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e7b2e6a60daa42ca","code_sha256_prefix":"e7b2e6a60daa42ca","mcp_get_code":{"code_sha256":"e7b2e6a60daa42ca"}},{"arxiv_id":"2312.11198","arxiv_id_is_arxiv":true,"paper":"/paper/signed-graph-neural-ordinary-differential","title":"Signed Graph Neural Ordinary Differential Equation for Modeling Continuous-time Dynamics","date":"2023-12-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"beautyonce/sgode","path":"SGODE-RNN/lib/utils.py","file_url":"https://github.com/beautyonce/sgode/blob/HEAD/SGODE-RNN/lib/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, beautyonce/sgode when it was checked","code_sha256":"e7b2e6a60daa42ca","code_sha256_prefix":"e7b2e6a60daa42ca","mcp_get_code":{"code_sha256":"e7b2e6a60daa42ca"}},{"arxiv_id":"2310.10196","arxiv_id_is_arxiv":true,"paper":"/paper/large-models-for-time-series-and-spatio","title":"Large Models for Time Series and Spatio-Temporal Data: A Survey and Outlook","date":"2023-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wenhaomin/DiffSTG","path":"algorithm/diffstg/graph_algo.py","file_url":"https://github.com/wenhaomin/DiffSTG/blob/HEAD/algorithm/diffstg/graph_algo.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1ceffc7d0f53c1ae","code_sha256_prefix":"1ceffc7d0f53c1ae","mcp_get_code":{"code_sha256":"1ceffc7d0f53c1ae"}},{"arxiv_id":"2308.10436","arxiv_id_is_arxiv":true,"paper":"/paper/approximately-equivariant-graph-networks-1","title":"Approximately Equivariant Graph Networks","date":"2023-08-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nhuang37/approx_equivariant_graph_nets","path":"DCRNN_Pytorch/lib/utils.py","file_url":"https://github.com/nhuang37/approx_equivariant_graph_nets/blob/HEAD/DCRNN_Pytorch/lib/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, nhuang37/approx_equivariant_graph_nets when it was checked","code_sha256":"e7b2e6a60daa42ca","code_sha256_prefix":"e7b2e6a60daa42ca","mcp_get_code":{"code_sha256":"e7b2e6a60daa42ca"}},{"arxiv_id":"2211.11176","arxiv_id_is_arxiv":true,"paper":"/paper/spatiotemporal-modeling-of-multivariate","title":"Modeling Multivariate Biosignals With Graph Neural Networks and Structured State Space Models","date":"2022-11-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tsy935/graphs4mer","path":"model/graphs4mer.py","file_url":"https://github.com/tsy935/graphs4mer/blob/HEAD/model/graphs4mer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"aab13fce6f38406c","code_sha256_prefix":"aab13fce6f38406c","mcp_get_code":{"code_sha256":"aab13fce6f38406c"}},{"arxiv_id":"1906.00121","arxiv_id_is_arxiv":true,"paper":"/paper/190600121","title":"Graph WaveNet for Deep Spatial-Temporal Graph Modeling","date":"2019-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sshleifer/Graph-WaveNet","path":"util.py","file_url":"https://github.com/sshleifer/Graph-WaveNet/blob/HEAD/util.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e7b2e6a60daa42ca","code_sha256_prefix":"e7b2e6a60daa42ca","mcp_get_code":{"code_sha256":"e7b2e6a60daa42ca"}},{"arxiv_id":"1707.01926","arxiv_id_is_arxiv":true,"paper":"/paper/diffusion-convolutional-recurrent-neural","title":"Diffusion Convolutional Recurrent Neural Network: Data-Driven Traffic Forecasting","date":"2017-07-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"e7b2e6a60daa42ca","code_sha256_prefix":"e7b2e6a60daa42ca","mcp_get_code":{"code_sha256":"e7b2e6a60daa42ca"}},{"arxiv_id":"1707.01926","arxiv_id_is_arxiv":true,"paper":"/paper/diffusion-convolutional-recurrent-neural","title":"Diffusion Convolutional Recurrent Neural Network: Data-Driven Traffic Forecasting","date":"2017-07-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KimMeen/DCRNN","path":"xlwang_version/dcrnn_model.py","file_url":"https://github.com/KimMeen/DCRNN/blob/HEAD/xlwang_version/dcrnn_model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2f342093fe5f43a5","code_sha256_prefix":"2f342093fe5f43a5","mcp_get_code":{"code_sha256":"2f342093fe5f43a5"}},{"arxiv_id":"ijcai2025_0372","arxiv_id_is_arxiv":false,"paper":null,"title":"IJCAI id ijcai2025_0372","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"cwang-nus/DOL","path":"utils/graph_algo.py","file_url":"https://github.com/cwang-nus/DOL/blob/HEAD/utils/graph_algo.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1ceffc7d0f53c1ae","code_sha256_prefix":"1ceffc7d0f53c1ae","mcp_get_code":{"code_sha256":"1ceffc7d0f53c1ae"}}],"record_sha256":"87ec1ad6e1e5e8240595a39b86e98f1071d3fb47bcf2c8dd8d495f392ab74abd","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}