{"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/num-graphs","entry":"num_graphs","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":10,"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":1,"n_samples_ran":1,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":10,"n_places_pointer_only":10,"n_places_pointer_only_link_open":3,"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":0,"ran_fixture":0,"ran":0,"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":"2507.00440","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2507.00440","date":null,"month_inferred_from_arxiv_id":"2025-07","title_source":null,"repo":"causal-graph/CGR","path":"train_cal.py","file_url":"https://github.com/causal-graph/CGR/blob/HEAD/train_cal.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, causal-graph/CGR when it was checked","code_sha256":"9da87b0b1605a660","code_sha256_prefix":"9da87b0b1605a660","mcp_get_code":{"code_sha256":"9da87b0b1605a660"}},{"arxiv_id":"2410.06746","arxiv_id_is_arxiv":true,"paper":"/paper/cluster-wise-graph-transformer-with-dual","title":"Cluster-wise Graph Transformer with Dual-granularity Kernelized Attention","date":"2024-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LUMIA-Group/Cluster-wise-Graph-Transformer","path":"data.py","file_url":"https://github.com/LUMIA-Group/Cluster-wise-Graph-Transformer/blob/HEAD/data.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, LUMIA-Group/Cluster-wise-Graph-Transformer when it was checked","code_sha256":"9da87b0b1605a660","code_sha256_prefix":"9da87b0b1605a660","mcp_get_code":{"code_sha256":"9da87b0b1605a660"}},{"arxiv_id":"2310.19906","arxiv_id_is_arxiv":true,"paper":"/paper/interpretable-prototype-based-graph-1","title":"Interpretable Prototype-based Graph Information Bottleneck","date":"2023-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"9da87b0b1605a660","code_sha256_prefix":"9da87b0b1605a660","mcp_get_code":{"code_sha256":"9da87b0b1605a660"}},{"arxiv_id":"2110.00684","arxiv_id_is_arxiv":true,"paper":"/paper/learning-compact-representations-of-neural","title":"Learning Compact Representations of Neural Networks using DiscriminAtive Masking (DAM)","date":"2021-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"9da87b0b1605a660","code_sha256_prefix":"9da87b0b1605a660","mcp_get_code":{"code_sha256":"9da87b0b1605a660"}},{"arxiv_id":"2106.05469","arxiv_id_is_arxiv":true,"paper":"/paper/variational-information-bottleneck-for-2","title":"Variational Information Bottleneck for Effective Low-Resource Fine-Tuning","date":"2021-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RingBDStack/VIB-GSL","path":"train_eval.py","file_url":"https://github.com/RingBDStack/VIB-GSL/blob/HEAD/train_eval.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, RingBDStack/VIB-GSL when it was checked","code_sha256":"9da87b0b1605a660","code_sha256_prefix":"9da87b0b1605a660","mcp_get_code":{"code_sha256":"9da87b0b1605a660"}},{"arxiv_id":"2010.12811","arxiv_id_is_arxiv":true,"paper":"/paper/graph-information-bottleneck","title":"Graph Information Bottleneck","date":"2020-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"9da87b0b1605a660","code_sha256_prefix":"9da87b0b1605a660","mcp_get_code":{"code_sha256":"9da87b0b1605a660"}},{"arxiv_id":"2010.05563","arxiv_id_is_arxiv":true,"paper":"/paper/graph-information-bottleneck-for-subgraph-1","title":"Graph Information Bottleneck for Subgraph Recognition","date":"2020-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Samyu0304/graph-information-bottleneck-for-Subgraph-Recognition","path":"graph-classfication/ours_train_eval.py","file_url":"https://github.com/Samyu0304/graph-information-bottleneck-for-Subgraph-Recognition/blob/HEAD/graph-classfication/ours_train_eval.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from RingBDStack/VIB-GSL, and GitHub detected no licence in that repository when it was checked","code_sha256":"9da87b0b1605a660","code_sha256_prefix":"9da87b0b1605a660","mcp_get_code":{"code_sha256":"9da87b0b1605a660"}},{"arxiv_id":"2002.06757","arxiv_id_is_arxiv":true,"paper":"/paper/entity-context-and-relational-paths-for","title":"Relational Message Passing for Knowledge Graph Completion","date":"2020-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"muhanzhang/IGMC","path":"train_eval.py","file_url":"https://github.com/muhanzhang/IGMC/blob/HEAD/train_eval.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from RingBDStack/VIB-GSL, and GitHub detected no licence in that repository when it was checked","code_sha256":"9da87b0b1605a660","code_sha256_prefix":"9da87b0b1605a660","mcp_get_code":{"code_sha256":"9da87b0b1605a660"}},{"arxiv_id":"1904.12058","arxiv_id_is_arxiv":true,"paper":"/paper/inductive-graph-pattern-learning-for","title":"Inductive Matrix Completion Based on Graph Neural Networks","date":"2019-04-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"9da87b0b1605a660","code_sha256_prefix":"9da87b0b1605a660","mcp_get_code":{"code_sha256":"9da87b0b1605a660"}},{"arxiv_id":"aaai_17268","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_17268","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"uta-smile/HGCN","path":"train_eval.py","file_url":"https://github.com/uta-smile/HGCN/blob/HEAD/train_eval.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from RingBDStack/VIB-GSL, and GitHub detected no licence in that repository when it was checked","code_sha256":"9da87b0b1605a660","code_sha256_prefix":"9da87b0b1605a660","mcp_get_code":{"code_sha256":"9da87b0b1605a660"}}],"record_sha256":"11523ddf8f84a7b5cfa7f3454265c04a4f07927ede0b42b264d61e53353718de","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}