{"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/graphconv","entry":"GraphConv","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":6,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":0,"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":7,"n_samples_constructed":5,"n_samples_ran_checked":7,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":7,"n_places_pointer_only":5,"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":0,"ran_fixture":0,"ran":7,"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":"2601.12890","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-12890","title":"Efficient Code Analysis via Graph Representation Learning-Guided Large Language Models","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"Epiphaniespt/GMLLM","path":"GMLLM/GNNExplainer/model.py","file_url":"https://github.com/Epiphaniespt/GMLLM/blob/HEAD/GMLLM/GNNExplainer/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Epiphaniespt/GMLLM when it was checked","code_sha256":"970d2c464403c7fa","code_sha256_prefix":"970d2c464403c7fa","mcp_get_code":{"code_sha256":"970d2c464403c7fa"}},{"arxiv_id":"2305.08457","arxiv_id_is_arxiv":true,"paper":"/paper/molhf-a-hierarchical-normalizing-flow-for","title":"MolHF: A Hierarchical Normalizing Flow for Molecular Graph Generation","date":"2023-05-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"violet-sto/molhf","path":"models/MolHF.py","file_url":"https://github.com/violet-sto/molhf/blob/HEAD/models/MolHF.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2c475547db518beb","code_sha256_prefix":"2c475547db518beb","mcp_get_code":{"code_sha256":"2c475547db518beb"}},{"arxiv_id":"2103.13225","arxiv_id_is_arxiv":true,"paper":"/paper/structure-aware-face-clustering-on-a-large","title":"Structure-Aware Face Clustering on a Large-Scale Graph with $\\bf{10^{7}}$ Nodes","date":"2021-03-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sstzal/STAR-FC","path":"src/models/gcn.py","file_url":"https://github.com/sstzal/STAR-FC/blob/HEAD/src/models/gcn.py","status":"ran","verification_level":1,"contract_check":null,"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, sstzal/STAR-FC when it was checked","code_sha256":"405f616f233811c9","code_sha256_prefix":"405f616f233811c9","mcp_get_code":{"code_sha256":"405f616f233811c9"}},{"arxiv_id":"2103.07889","arxiv_id_is_arxiv":true,"paper":"/paper/learning-a-proposal-classifier-for-multiple","title":"Learning a Proposal Classifier for Multiple Object Tracking","date":"2021-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"daip13/LPC_MOT","path":"learnable_proposal_classifier/gcn_based_purity_network/dsgcn/models/dsgcn.py","file_url":"https://github.com/daip13/LPC_MOT/blob/HEAD/learnable_proposal_classifier/gcn_based_purity_network/dsgcn/models/dsgcn.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d9c4fcd2b20442d2","code_sha256_prefix":"d9c4fcd2b20442d2","mcp_get_code":{"code_sha256":"d9c4fcd2b20442d2"}},{"arxiv_id":"2102.01987","arxiv_id_is_arxiv":true,"paper":"/paper/learning-graph-embeddings-for-compositional","title":"Learning Graph Embeddings for Compositional Zero-shot Learning","date":"2021-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ExplainableML/czsl","path":"models/graph_method.py","file_url":"https://github.com/ExplainableML/czsl/blob/HEAD/models/graph_method.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, ExplainableML/czsl, is not in the permissive set Syntology serves inline","code_sha256":"f9aa365d6157d80a","code_sha256_prefix":"f9aa365d6157d80a","mcp_get_code":{"code_sha256":"f9aa365d6157d80a"}},{"arxiv_id":"1609.02907","arxiv_id_is_arxiv":true,"paper":"/paper/semi-supervised-classification-with-graph","title":"Semi-Supervised Classification with Graph Convolutional Networks","date":"2016-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"selmiss/gp-tlstgcn","path":"model/layers.py","file_url":"https://github.com/selmiss/gp-tlstgcn/blob/HEAD/model/layers.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"LGPL-2.1","inline_ok":false,"inline_ok_link":false,"withheld_clause":"LGPL-2.1, as GitHub detects it on this paper's repository, selmiss/gp-tlstgcn, is not in the permissive set Syntology serves inline","code_sha256":"b60e4872344aa92f","code_sha256_prefix":"b60e4872344aa92f","mcp_get_code":{"code_sha256":"b60e4872344aa92f"}},{"arxiv_id":"1609.02907","arxiv_id_is_arxiv":true,"paper":"/paper/semi-supervised-classification-with-graph","title":"Semi-Supervised Classification with Graph Convolutional Networks","date":"2016-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yCobanoglu/infinite-width-gnns","path":"gnn/models/node_classification/gcn.py","file_url":"https://github.com/yCobanoglu/infinite-width-gnns/blob/HEAD/gnn/models/node_classification/gcn.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, yCobanoglu/infinite-width-gnns when it was checked","code_sha256":"660520aacc4ae7f5","code_sha256_prefix":"660520aacc4ae7f5","mcp_get_code":{"code_sha256":"660520aacc4ae7f5"}}],"record_sha256":"62cf2430255afcfd68939ff80e723280674f808fad7e0d8b5756922f2635e80f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}