{"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/tonp","entry":"tonp","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":10,"n_papers_ran_no_instrument_failure":5,"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":8,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":3,"n_samples_unverified":1,"n_samples_fingerprinted":2,"n_places":11,"n_places_pointer_only":4,"n_places_pointer_only_link_open":1,"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":1,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":2,"ran":3,"unverified":1},"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":"2407.01171","arxiv_id_is_arxiv":true,"paper":"/paper/neural-conditional-probability-for-inference","title":"Neural Conditional Probability for Uncertainty Quantification","date":"2024-07-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CSML-IIT-UCL/NCP","path":"NCP/model.py","file_url":"https://github.com/CSML-IIT-UCL/NCP/blob/HEAD/NCP/model.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, CSML-IIT-UCL/NCP when it was checked","code_sha256":"12f203b46fecc22d","code_sha256_prefix":"12f203b46fecc22d","mcp_get_code":{"code_sha256":"12f203b46fecc22d"}},{"arxiv_id":"2406.09870","arxiv_id_is_arxiv":true,"paper":"/paper/igl-bench-establishing-the-comprehensive","title":"IGL-Bench: Establishing the Comprehensive Benchmark for Imbalanced Graph Learning","date":"2024-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RingBDStack/IGL-Bench","path":"IGL_Bench/algorithm/COLDBREW/GCN.py","file_url":"https://github.com/RingBDStack/IGL-Bench/blob/HEAD/IGL_Bench/algorithm/COLDBREW/GCN.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"18d569c66cbe1eda","code_sha256_prefix":"18d569c66cbe1eda","mcp_get_code":{"code_sha256":"18d569c66cbe1eda"}},{"arxiv_id":"2305.08018","arxiv_id_is_arxiv":true,"paper":"/paper/drew-dynamically-rewired-message-passing-with","title":"DRew: Dynamically Rewired Message Passing with Delay","date":"2023-05-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bengutteridge/drew","path":"lrgb/graphgps/stage/drew_gnn.py","file_url":"https://github.com/bengutteridge/drew/blob/HEAD/lrgb/graphgps/stage/drew_gnn.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":"ca403e2f8771a00f","code_sha256_prefix":"ca403e2f8771a00f","mcp_get_code":{"code_sha256":"ca403e2f8771a00f"}},{"arxiv_id":"2210.08122","arxiv_id_is_arxiv":true,"paper":"/paper/old-can-be-gold-better-gradient-flow-can-make","title":"Old can be Gold: Better Gradient Flow can Make Vanilla-GCNs Great Again","date":"2022-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vita-group/gradientgcn","path":"models/GCN.py","file_url":"https://github.com/vita-group/gradientgcn/blob/HEAD/models/GCN.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, vita-group/gradientgcn when it was checked","code_sha256":"e359f7852b0eb48f","code_sha256_prefix":"e359f7852b0eb48f","mcp_get_code":{"code_sha256":"e359f7852b0eb48f"}},{"arxiv_id":"2210.08122","arxiv_id_is_arxiv":true,"paper":"/paper/old-can-be-gold-better-gradient-flow-can-make","title":"Old can be Gold: Better Gradient Flow can Make Vanilla-GCNs Great Again","date":"2022-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vita-group/gradientgcn","path":"rewire_model.py","file_url":"https://github.com/vita-group/gradientgcn/blob/HEAD/rewire_model.py","status":"unverified","verification_level":0,"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, vita-group/gradientgcn when it was checked","code_sha256":"7b524945ac9fc063","code_sha256_prefix":"7b524945ac9fc063","mcp_get_code":{"code_sha256":"7b524945ac9fc063"}},{"arxiv_id":"2202.03397","arxiv_id_is_arxiv":true,"paper":"/paper/bilevel-optimization-with-a-lower-level","title":"Bilevel Optimization with a Lower-level Contraction: Optimal Sample Complexity without Warm-start","date":"2022-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"csml-iit-ucl/bioptexps","path":"source/poisoning.py","file_url":"https://github.com/csml-iit-ucl/bioptexps/blob/HEAD/source/poisoning.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e9907a680034c66c","code_sha256_prefix":"e9907a680034c66c","mcp_get_code":{"code_sha256":"e9907a680034c66c"}},{"arxiv_id":"2201.10777","arxiv_id_is_arxiv":true,"paper":"/paper/meta-learning-spiking-neural-networks-with","title":"Meta-learning Spiking Neural Networks with Surrogate Gradient Descent","date":"2022-01-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nmi-lab/snn_maml","path":"snn_maml/device_models.py","file_url":"https://github.com/nmi-lab/snn_maml/blob/HEAD/snn_maml/device_models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from CSML-IIT-UCL/NCP, and GitHub detected no licence in that repository when it was checked","code_sha256":"12f203b46fecc22d","code_sha256_prefix":"12f203b46fecc22d","mcp_get_code":{"code_sha256":"12f203b46fecc22d"}},{"arxiv_id":"2112.11628","arxiv_id_is_arxiv":true,"paper":"/paper/skipnode-on-alleviating-over-smoothing-for","title":"SkipNode: On Alleviating Performance Degradation for Deep Graph Convolutional Networks","date":"2021-12-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"weiganglu/skipnode","path":"utils/energy.py","file_url":"https://github.com/weiganglu/skipnode/blob/HEAD/utils/energy.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":"254aa250e6c6fd5e","code_sha256_prefix":"254aa250e6c6fd5e","mcp_get_code":{"code_sha256":"254aa250e6c6fd5e"}},{"arxiv_id":"2111.04840","arxiv_id_is_arxiv":true,"paper":"/paper/cold-brew-distilling-graph-node-1","title":"Cold Brew: Distilling Graph Node Representations with Incomplete or Missing Neighborhoods","date":"2021-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amazon-research/gnn-tail-generalization","path":"GNN_model/GCN.py","file_url":"https://github.com/amazon-research/gnn-tail-generalization/blob/HEAD/GNN_model/GCN.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"18d569c66cbe1eda","code_sha256_prefix":"18d569c66cbe1eda","mcp_get_code":{"code_sha256":"18d569c66cbe1eda"}},{"arxiv_id":"2008.01777","arxiv_id_is_arxiv":true,"paper":"/paper/making-sense-of-cnns-interpreting-deep","title":"Making Sense of CNNs: Interpreting Deep Representations & Their Invariances with INNs","date":"2020-08-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CompVis/invariances","path":"invariances/iterator/base_trainer.py","file_url":"https://github.com/CompVis/invariances/blob/HEAD/invariances/iterator/base_trainer.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":"3d7adb2f95674903","code_sha256_prefix":"3d7adb2f95674903","mcp_get_code":{"code_sha256":"3d7adb2f95674903"}},{"arxiv_id":"2004.13166","arxiv_id_is_arxiv":true,"paper":"/paper/a-disentangling-invertible-interpretation","title":"A Disentangling Invertible Interpretation Network for Explaining Latent Representations","date":"2020-04-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CompVis/iin","path":"iin/iterators/base.py","file_url":"https://github.com/CompVis/iin/blob/HEAD/iin/iterators/base.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":"3d7adb2f95674903","code_sha256_prefix":"3d7adb2f95674903","mcp_get_code":{"code_sha256":"3d7adb2f95674903"}}],"record_sha256":"12ed1a3d81f520e79dac6f82e05d4dad28e59a7c6f44b128540d62459f6b7969","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}