{"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/scatter-add","entry":"scatter_add","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":10,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":1,"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":10,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":1,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":10,"n_places_pointer_only":1,"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":1,"ran_fixture":0,"ran":6,"unverified":3},"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.14602","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-14602","title":"Opbench: A Graph Benchmark to Combat the Opioid Crisis","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"Tianyi-Billy-Ma/OPBench","path":"src/extras/scatter.py","file_url":"https://github.com/Tianyi-Billy-Ma/OPBench/blob/HEAD/src/extras/scatter.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":"afe2645e95b78546","code_sha256_prefix":"afe2645e95b78546","mcp_get_code":{"code_sha256":"afe2645e95b78546"}},{"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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bf0ef31097e9c705","code_sha256_prefix":"bf0ef31097e9c705","mcp_get_code":{"code_sha256":"bf0ef31097e9c705"}},{"arxiv_id":"2405.15429","arxiv_id_is_arxiv":true,"paper":"/paper/e-n-equivariant-topological-neural-networks","title":"E(n) Equivariant Topological Neural Networks","date":"2024-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NSAPH-Projects/topological-equivariant-networks","path":"etnn/utils.py","file_url":"https://github.com/NSAPH-Projects/topological-equivariant-networks/blob/HEAD/etnn/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":"7cce375add6e219b","code_sha256_prefix":"7cce375add6e219b","mcp_get_code":{"code_sha256":"7cce375add6e219b"}},{"arxiv_id":"2311.16716","arxiv_id_is_arxiv":true,"paper":"/paper/graph-pre-training-and-prompt-learning-for","title":"GraphPro: Graph Pre-training and Prompt Learning for Recommendation","date":"2023-11-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hkuds/graphpl","path":"modules/utils.py","file_url":"https://github.com/hkuds/graphpl/blob/HEAD/modules/utils.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":"d3ae3230ce671e90","code_sha256_prefix":"d3ae3230ce671e90","mcp_get_code":{"code_sha256":"d3ae3230ce671e90"}},{"arxiv_id":"2309.15188","arxiv_id_is_arxiv":true,"paper":"/paper/icml-2023-topological-deep-learning-challenge","title":"ICML 2023 Topological Deep Learning Challenge : Design and Results","date":"2023-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pyt-team/topomodelx","path":"topomodelx/utils/scatter.py","file_url":"https://github.com/pyt-team/topomodelx/blob/HEAD/topomodelx/utils/scatter.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":"b5c5e952d5470bc3","code_sha256_prefix":"b5c5e952d5470bc3","mcp_get_code":{"code_sha256":"b5c5e952d5470bc3"}},{"arxiv_id":"2308.04583","arxiv_id_is_arxiv":true,"paper":"/paper/latr-3d-lane-detection-from-monocular-images","title":"LATR: 3D Lane Detection from Monocular Images with Transformer","date":"2023-08-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JMoonr/LATR","path":"models/scatter_utils.py","file_url":"https://github.com/JMoonr/LATR/blob/HEAD/models/scatter_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":"e2d07b9f31178c8b","code_sha256_prefix":"e2d07b9f31178c8b","mcp_get_code":{"code_sha256":"e2d07b9f31178c8b"}},{"arxiv_id":"2206.13602","arxiv_id_is_arxiv":true,"paper":"/paper/molecular-geometry-pretraining-with-se-3","title":"Molecular Geometry Pretraining with SE(3)-Invariant Denoising Distance Matching","date":"2022-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chao1224/geossl","path":"Geom3D/models/painn_utils.py","file_url":"https://github.com/chao1224/geossl/blob/HEAD/Geom3D/models/painn_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":"bc76859c3c792263","code_sha256_prefix":"bc76859c3c792263","mcp_get_code":{"code_sha256":"bc76859c3c792263"}},{"arxiv_id":"2204.10555","arxiv_id_is_arxiv":true,"paper":"/paper/kala-knowledge-augmented-language-model-1","title":"KALA: Knowledge-Augmented Language Model Adaptation","date":"2022-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rusty1s/pytorch_scatter","path":"torch_scatter/scatter.py","file_url":"https://github.com/rusty1s/pytorch_scatter/blob/HEAD/torch_scatter/scatter.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"865555a5b2967160","code_sha256_prefix":"865555a5b2967160","mcp_get_code":{"code_sha256":"865555a5b2967160"}},{"arxiv_id":"2102.03150","arxiv_id_is_arxiv":true,"paper":"/paper/equivariant-message-passing-for-the","title":"Equivariant message passing for the prediction of tensorial properties and molecular spectra","date":"2021-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"learningmatter-mit/NeuralForceField","path":"nff/nn/models/painn.py","file_url":"https://github.com/learningmatter-mit/NeuralForceField/blob/HEAD/nff/nn/models/painn.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"04e4a832f331db07","code_sha256_prefix":"04e4a832f331db07","mcp_get_code":{"code_sha256":"04e4a832f331db07"}},{"arxiv_id":"1907.12377","arxiv_id_is_arxiv":true,"paper":"/paper/intentgc-a-scalable-graph-convolution","title":"IntentGC: a Scalable Graph Convolution Framework Fusing Heterogeneous Information for Recommendation","date":"2019-07-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alibaba/euler","path":"tf_euler/python/contrib/py_scatter.py","file_url":"https://github.com/alibaba/euler/blob/HEAD/tf_euler/python/contrib/py_scatter.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"Apache-2.0, as GitHub detects it on this paper's repository, alibaba/euler, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"09d2d98d26a6123f","code_sha256_prefix":"09d2d98d26a6123f","mcp_get_code":{"code_sha256":"09d2d98d26a6123f"}}],"record_sha256":"4c9e38cfd59f76c2b9f11015141ef3f112fd251cabf6e8bc69e916b6a7bade31","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}