{"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/propagate","entry":"propagate","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":6,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":2,"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":7,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":2,"n_samples_unverified":1,"n_samples_fingerprinted":1,"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":2,"ran_fixture":0,"ran":4,"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":"2601.20891","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-20891","title":"ATTNSOM: LEARNING CROSS-ISOFORM ATTENTION FOR CYTOCHROME P450 SITE-OF-METABOLISM","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"dmis-lab/ATTNSOM","path":"model.py","file_url":"https://github.com/dmis-lab/ATTNSOM/blob/HEAD/model.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":"0391d1886945eded","code_sha256_prefix":"0391d1886945eded","mcp_get_code":{"code_sha256":"0391d1886945eded"}},{"arxiv_id":"2407.12543","arxiv_id_is_arxiv":true,"paper":"/paper/abstraction-alignment-comparing-model-and","title":"Abstraction Alignment: Comparing Model-Learned and Human-Encoded Conceptual Relationships","date":"2024-07-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mitvis/abstraction-alignment","path":"abstraction_graph_toy_example.py","file_url":"https://github.com/mitvis/abstraction-alignment/blob/HEAD/abstraction_graph_toy_example.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, mitvis/abstraction-alignment when it was checked","code_sha256":"125298654275b542","code_sha256_prefix":"125298654275b542","mcp_get_code":{"code_sha256":"125298654275b542"}},{"arxiv_id":"2405.15119","arxiv_id_is_arxiv":true,"paper":"/paper/bayesian-optimization-of-functions-over-node","title":"Bayesian Optimization of Functions over Node Subsets in Graphs","date":"2024-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LeonResearch/GraphComBO","path":"problems/IC.py","file_url":"https://github.com/LeonResearch/GraphComBO/blob/HEAD/problems/IC.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, LeonResearch/GraphComBO when it was checked","code_sha256":"26247306194df274","code_sha256_prefix":"26247306194df274","mcp_get_code":{"code_sha256":"26247306194df274"}},{"arxiv_id":"2401.11760","arxiv_id_is_arxiv":true,"paper":"/paper/towards-effective-and-general-graph","title":"Towards Effective and General Graph Unlearning via Mutual Evolution","date":"2024-01-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xkli-allen/megu","path":"exp/exp_megu.py","file_url":"https://github.com/xkli-allen/megu/blob/HEAD/exp/exp_megu.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, xkli-allen/megu when it was checked","code_sha256":"36bc4e09d31701a7","code_sha256_prefix":"36bc4e09d31701a7","mcp_get_code":{"code_sha256":"36bc4e09d31701a7"}},{"arxiv_id":"2311.03035","arxiv_id_is_arxiv":true,"paper":"/paper/gtp-vit-efficient-vision-transformers-via","title":"GTP-ViT: Efficient Vision Transformers via Graph-based Token Propagation","date":"2023-11-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ackesnal/gtp-vit","path":"models_v3.py","file_url":"https://github.com/ackesnal/gtp-vit/blob/HEAD/models_v3.py","status":"unverified","verification_level":0,"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":"0e95f70efaf7910b","code_sha256_prefix":"0e95f70efaf7910b","mcp_get_code":{"code_sha256":"0e95f70efaf7910b"}},{"arxiv_id":"2006.06803","arxiv_id_is_arxiv":true,"paper":"/paper/query-training-learning-and-inference-for","title":"Query Training: Learning a Worse Model to Infer Better Marginals in Undirected Graphical Models with Hidden Variables","date":"2020-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vicariousinc/query_training","path":"query_training/rbm_dbm/rbm.py","file_url":"https://github.com/vicariousinc/query_training/blob/HEAD/query_training/rbm_dbm/rbm.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":"273434ee7320eeed","code_sha256_prefix":"273434ee7320eeed","mcp_get_code":{"code_sha256":"273434ee7320eeed"}},{"arxiv_id":"2005.11079","arxiv_id_is_arxiv":true,"paper":"/paper/graph-random-neural-network","title":"Graph Random Neural Network for Semi-Supervised Learning on Graphs","date":"2020-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vapene/Graph-Random-Neural-Networks-for-Semi-Supervised-Learning-on-Graphs","path":"train_grand.py","file_url":"https://github.com/vapene/Graph-Random-Neural-Networks-for-Semi-Supervised-Learning-on-Graphs/blob/HEAD/train_grand.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5087e50651937e1a","code_sha256_prefix":"5087e50651937e1a","mcp_get_code":{"code_sha256":"5087e50651937e1a"}}],"record_sha256":"9cef9c9ec2a975ef6490268dd731cf2510e700645fedc6005091f49214164001","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}