{"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/maybe-num-nodes","entry":"maybe_num_nodes","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":12,"n_papers_ran":12,"n_papers_ran_no_instrument_failure":12,"n_papers_ran_instrument_only":0,"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":3,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":12,"n_places_pointer_only":0,"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":1,"ran_draft_wrong":0,"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":"2503.13465","arxiv_id_is_arxiv":true,"paper":"/paper/a-novel-fourier-adjacency-transformer-for","title":"A novel Fourier Adjacency Transformer for advanced EEG emotion recognition","date":"2025-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YanhaoHuang23/FAT","path":"Model/RGNN_model.py","file_url":"https://github.com/YanhaoHuang23/FAT/blob/HEAD/Model/RGNN_model.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":"ef93260b5137f73b","code_sha256_prefix":"ef93260b5137f73b","mcp_get_code":{"code_sha256":"ef93260b5137f73b"}},{"arxiv_id":"2412.20404","arxiv_id_is_arxiv":true,"paper":"/paper/open-sora-democratizing-efficient-video","title":"Open-Sora: Democratizing Efficient Video Production for All","date":"2024-12-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MindSpore-scientific/code-10","path":"RGNN/model_simple.py","file_url":"https://github.com/MindSpore-scientific/code-10/blob/HEAD/RGNN/model_simple.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ef93260b5137f73b","code_sha256_prefix":"ef93260b5137f73b","mcp_get_code":{"code_sha256":"ef93260b5137f73b"}},{"arxiv_id":"2412.06329","arxiv_id_is_arxiv":true,"paper":"/paper/normalizing-flows-are-capable-generative","title":"Normalizing Flows are Capable Generative Models","date":"2024-12-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MindSpore-scientific-2/code-10","path":"RGNN/model_simple.py","file_url":"https://github.com/MindSpore-scientific-2/code-10/blob/HEAD/RGNN/model_simple.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ef93260b5137f73b","code_sha256_prefix":"ef93260b5137f73b","mcp_get_code":{"code_sha256":"ef93260b5137f73b"}},{"arxiv_id":"2411.14711","arxiv_id_is_arxiv":true,"paper":"/paper/can-gnns-learn-link-heuristics-a-concise","title":"Can GNNs Learn Link Heuristics? A Concise Review and Evaluation of Link Prediction Methods","date":"2024-11-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"astroming/GNNHE","path":"ogbl-citation2_88.91_10runs/utils.py","file_url":"https://github.com/astroming/GNNHE/blob/HEAD/ogbl-citation2_88.91_10runs/utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"76ea6d8c225e28b7","code_sha256_prefix":"76ea6d8c225e28b7","mcp_get_code":{"code_sha256":"76ea6d8c225e28b7"}},{"arxiv_id":"2410.09754","arxiv_id_is_arxiv":true,"paper":"/paper/simba-simplicity-bias-for-scaling-up","title":"SimBa: Simplicity Bias for Scaling Up Parameters in Deep Reinforcement Learning","date":"2024-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MindSpore-scientific/code-8","path":"RGNN/model_simple.py","file_url":"https://github.com/MindSpore-scientific/code-8/blob/HEAD/RGNN/model_simple.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ef93260b5137f73b","code_sha256_prefix":"ef93260b5137f73b","mcp_get_code":{"code_sha256":"ef93260b5137f73b"}},{"arxiv_id":"2408.14512","arxiv_id_is_arxiv":true,"paper":"/paper/llms-as-zero-shot-graph-learners-alignment-of","title":"LLMs as Zero-shot Graph Learners: Alignment of GNN Representations with LLM Token Embeddings","date":"2024-08-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MindSpore-scientific-2/code-11","path":"RGNN/model_simple.py","file_url":"https://github.com/MindSpore-scientific-2/code-11/blob/HEAD/RGNN/model_simple.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ef93260b5137f73b","code_sha256_prefix":"ef93260b5137f73b","mcp_get_code":{"code_sha256":"ef93260b5137f73b"}},{"arxiv_id":"2403.16372","arxiv_id_is_arxiv":true,"paper":"/paper/signsgd-with-federated-voting","title":"SignSGD with Federated Voting","date":"2024-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MindSpore-scientific/code-11","path":"RGNN/model_simple.py","file_url":"https://github.com/MindSpore-scientific/code-11/blob/HEAD/RGNN/model_simple.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ef93260b5137f73b","code_sha256_prefix":"ef93260b5137f73b","mcp_get_code":{"code_sha256":"ef93260b5137f73b"}},{"arxiv_id":"2312.16476","arxiv_id_is_arxiv":true,"paper":"/paper/svgdreamer-text-guided-svg-generation-with","title":"SVGDreamer: Text Guided SVG Generation with Diffusion Model","date":"2023-12-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MindSpore-scientific/code-13","path":"RGNN/model_simple.py","file_url":"https://github.com/MindSpore-scientific/code-13/blob/HEAD/RGNN/model_simple.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ef93260b5137f73b","code_sha256_prefix":"ef93260b5137f73b","mcp_get_code":{"code_sha256":"ef93260b5137f73b"}},{"arxiv_id":"2307.16372","arxiv_id_is_arxiv":true,"paper":"/paper/lp-musiccaps-llm-based-pseudo-music","title":"LP-MusicCaps: LLM-Based Pseudo Music Captioning","date":"2023-07-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MindSpore-scientific-2/code-8","path":"RGNN/model_simple.py","file_url":"https://github.com/MindSpore-scientific-2/code-8/blob/HEAD/RGNN/model_simple.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ef93260b5137f73b","code_sha256_prefix":"ef93260b5137f73b","mcp_get_code":{"code_sha256":"ef93260b5137f73b"}},{"arxiv_id":"2210.12624","arxiv_id_is_arxiv":true,"paper":"/paper/mitigating-gradient-bias-in-multi-objective","title":"Mitigating Gradient Bias in Multi-objective Learning: A Provably Convergent Stochastic Approach","date":"2022-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MindSpore-scientific/code-1","path":"RGNN/model_simple.py","file_url":"https://github.com/MindSpore-scientific/code-1/blob/HEAD/RGNN/model_simple.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ef93260b5137f73b","code_sha256_prefix":"ef93260b5137f73b","mcp_get_code":{"code_sha256":"ef93260b5137f73b"}},{"arxiv_id":"2111.06011","arxiv_id_is_arxiv":true,"paper":"/paper/climate-modeling-with-neural-diffusion","title":"Climate Modeling with Neural Diffusion Equations","date":"2021-11-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jeehyunhwang/neural-diffusion-equation","path":"utils.py","file_url":"https://github.com/jeehyunhwang/neural-diffusion-equation/blob/HEAD/utils.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":"f8832e2f4df6c3d9","code_sha256_prefix":"f8832e2f4df6c3d9","mcp_get_code":{"code_sha256":"f8832e2f4df6c3d9"}},{"arxiv_id":"2104.01528","arxiv_id_is_arxiv":true,"paper":"/paper/sgcn-sparse-graph-convolution-network-for","title":"SGCN:Sparse Graph Convolution Network for Pedestrian Trajectory Prediction","date":"2021-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lyqcom/sgcn","path":"src/signedsageconvolution.py","file_url":"https://github.com/lyqcom/sgcn/blob/HEAD/src/signedsageconvolution.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ef93260b5137f73b","code_sha256_prefix":"ef93260b5137f73b","mcp_get_code":{"code_sha256":"ef93260b5137f73b"}}],"record_sha256":"c983efe1e0a85ac8ce611d73ac4bf39cc7cc29c6aafbaa43a438f449e724e53e","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}