{"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/index2mask","entry":"index2mask","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":7,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":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":5,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":3,"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":3,"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":"2410.15556","arxiv_id_is_arxiv":true,"paper":"/paper/gradient-rewiring-for-editable-graph-neural","title":"Gradient Rewiring for Editable Graph Neural Network Training","date":"2024-10-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhimengj0326/Gradient_rewiring_editing","path":"data.py","file_url":"https://github.com/zhimengj0326/Gradient_rewiring_editing/blob/HEAD/data.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zhimengj0326/Gradient_rewiring_editing when it was checked","code_sha256":"4e0d1bcb50e86417","code_sha256_prefix":"4e0d1bcb50e86417","mcp_get_code":{"code_sha256":"4e0d1bcb50e86417"}},{"arxiv_id":"2410.13798","arxiv_id_is_arxiv":true,"paper":"/paper/learning-graph-quantized-tokenizers-for","title":"Learning Graph Quantized Tokenizers","date":"2024-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"limei0307/GQT","path":"data.py","file_url":"https://github.com/limei0307/GQT/blob/HEAD/data.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":"942da4a4a8ad2c9d","code_sha256_prefix":"942da4a4a8ad2c9d","mcp_get_code":{"code_sha256":"942da4a4a8ad2c9d"}},{"arxiv_id":"2405.16435","arxiv_id_is_arxiv":true,"paper":"/paper/structure-aware-semantic-node-identifiers-for","title":"Node Identifiers: Compact, Discrete Representations for Efficient Graph Learning","date":"2024-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LUOyk1999/NodeID","path":"SL/Graph_Classification/ID_MLP_f.py","file_url":"https://github.com/LUOyk1999/NodeID/blob/HEAD/SL/Graph_Classification/ID_MLP_f.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":"10e5b33e372f7d10","code_sha256_prefix":"10e5b33e372f7d10","mcp_get_code":{"code_sha256":"10e5b33e372f7d10"}},{"arxiv_id":"2310.17394","arxiv_id_is_arxiv":true,"paper":"/paper/enhancing-graph-neural-networks-with","title":"PSP: Pre-Training and Structure Prompt Tuning for Graph Neural Networks","date":"2023-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gqq1210/psp","path":"PSP_graph/utils.py","file_url":"https://github.com/gqq1210/psp/blob/HEAD/PSP_graph/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, gqq1210/psp when it was checked","code_sha256":"77707dee73264190","code_sha256_prefix":"77707dee73264190","mcp_get_code":{"code_sha256":"77707dee73264190"}},{"arxiv_id":"2310.12457","arxiv_id_is_arxiv":true,"paper":"/paper/musegnn-interpretable-and-convergent-graph","title":"MuseGNN: Interpretable and Convergent Graph Neural Network Layers at Scale","date":"2023-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haitian-jiang/MuseGNN","path":"gen_ppr_subg.py","file_url":"https://github.com/haitian-jiang/MuseGNN/blob/HEAD/gen_ppr_subg.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":"10e5b33e372f7d10","code_sha256_prefix":"10e5b33e372f7d10","mcp_get_code":{"code_sha256":"10e5b33e372f7d10"}},{"arxiv_id":"2310.01678","arxiv_id_is_arxiv":true,"paper":"/paper/score-dynamics-scaling-molecular-dynamics","title":"Score dynamics: scaling molecular dynamics with picoseconds timestep via conditional diffusion model","date":"2023-10-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"llnl/graphite","path":"src/graphite/utils/utils.py","file_url":"https://github.com/llnl/graphite/blob/HEAD/src/graphite/utils/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, llnl/graphite (NOASSERTION)","code_sha256":"2241bc27ba2bd174","code_sha256_prefix":"2241bc27ba2bd174","mcp_get_code":{"code_sha256":"2241bc27ba2bd174"}},{"arxiv_id":"2306.10759","arxiv_id_is_arxiv":true,"paper":"/paper/simplifying-and-empowering-transformers-for-1","title":"SGFormer: Simplifying and Empowering Transformers for Large-Graph Representations","date":"2023-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qitianwu/SGFormer","path":"100M/nb-sample.py","file_url":"https://github.com/qitianwu/SGFormer/blob/HEAD/100M/nb-sample.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":"10e5b33e372f7d10","code_sha256_prefix":"10e5b33e372f7d10","mcp_get_code":{"code_sha256":"10e5b33e372f7d10"}}],"record_sha256":"2f6423a129c4192bf614db6f366a151ff6330a763db5b77c5229c006975865cc","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}