{"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/remove-self-loops","entry":"remove_self_loops","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":8,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":5,"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":8,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":1,"n_samples_unverified":2,"n_samples_fingerprinted":2,"n_places":9,"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":1,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":4,"unverified":2},"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":"2510.16990","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-16990","title":"Graph4MM: Weaving Multimodal Learning with Structural Information","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"YennNing/Graph4MM","path":"language_modelling/utils.py","file_url":"https://github.com/YennNing/Graph4MM/blob/HEAD/language_modelling/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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, YennNing/Graph4MM when it was checked","code_sha256":"e7a9875216e9146c","code_sha256_prefix":"e7a9875216e9146c","mcp_get_code":{"code_sha256":"e7a9875216e9146c"}},{"arxiv_id":"2406.18854","arxiv_id_is_arxiv":true,"paper":"/paper/what-is-missing-in-homophily-disentangling","title":"What Is Missing In Homophily? Disentangling Graph Homophily For Graph Neural Networks","date":"2024-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zylmozart/disentangle_graphhom","path":"homophily.py","file_url":"https://github.com/zylmozart/disentangle_graphhom/blob/HEAD/homophily.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ef90ba6dacfae5eb","code_sha256_prefix":"ef90ba6dacfae5eb","mcp_get_code":{"code_sha256":"ef90ba6dacfae5eb"}},{"arxiv_id":"2304.14274","arxiv_id_is_arxiv":true,"paper":"/paper/when-do-graph-neural-networks-help-with-node","title":"When Do Graph Neural Networks Help with Node Classification? Investigating the Impact of Homophily Principle on Node Distinguishability","date":"2023-04-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sitaoluan/when-do-gnns-help","path":"utils/homophily_metrics.py","file_url":"https://github.com/sitaoluan/when-do-gnns-help/blob/HEAD/utils/homophily_metrics.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ef90ba6dacfae5eb","code_sha256_prefix":"ef90ba6dacfae5eb","mcp_get_code":{"code_sha256":"ef90ba6dacfae5eb"}},{"arxiv_id":"2304.14274","arxiv_id_is_arxiv":true,"paper":"/paper/when-do-graph-neural-networks-help-with-node","title":"When Do Graph Neural Networks Help with Node Classification? Investigating the Impact of Homophily Principle on Node Distinguishability","date":"2023-04-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SitaoLuan/When-Do-GNNs-Help","path":"utils/homophily_plot.py","file_url":"https://github.com/SitaoLuan/When-Do-GNNs-Help/blob/HEAD/utils/homophily_plot.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":"cbeb665d00a9d64a","code_sha256_prefix":"cbeb665d00a9d64a","mcp_get_code":{"code_sha256":"cbeb665d00a9d64a"}},{"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":"e1461a414a1bf86e","code_sha256_prefix":"e1461a414a1bf86e","mcp_get_code":{"code_sha256":"e1461a414a1bf86e"}},{"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":"preprocess.py","file_url":"https://github.com/lyqcom/sgcn/blob/HEAD/preprocess.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"42a7b36c08bfcf85","code_sha256_prefix":"42a7b36c08bfcf85","mcp_get_code":{"code_sha256":"42a7b36c08bfcf85"}},{"arxiv_id":"2010.04831","arxiv_id_is_arxiv":true,"paper":"/paper/improving-local-identifiability-in","title":"Improving Local Identifiability in Probabilistic Box Embeddings","date":"2020-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"iesl/geometric_graph_embedding","path":"src/graph_modeling/generate/generic.py","file_url":"https://github.com/iesl/geometric_graph_embedding/blob/HEAD/src/graph_modeling/generate/generic.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":"30dc892e2be52489","code_sha256_prefix":"30dc892e2be52489","mcp_get_code":{"code_sha256":"30dc892e2be52489"}},{"arxiv_id":"2002.10306","arxiv_id_is_arxiv":true,"paper":"/paper/adaptive-propagation-graph-convolutional","title":"Adaptive Propagation Graph Convolutional Network","date":"2020-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"spindro/AP-GCN","path":"sparsegraph.py","file_url":"https://github.com/spindro/AP-GCN/blob/HEAD/sparsegraph.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":"d22abf00bf0257bb","code_sha256_prefix":"d22abf00bf0257bb","mcp_get_code":{"code_sha256":"d22abf00bf0257bb"}},{"arxiv_id":"aaai_20388","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_20388","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"xuehansheng/RepBin","path":"utils.py","file_url":"https://github.com/xuehansheng/RepBin/blob/HEAD/utils.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":"e63b90a141267137","code_sha256_prefix":"e63b90a141267137","mcp_get_code":{"code_sha256":"e63b90a141267137"}}],"record_sha256":"a493fad501843d6dedaad95e156cc48ce7650dfd263c649af048f183641ee88d","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}