{"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/generate-split","entry":"generate_split","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":9,"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":9,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":0,"n_samples_unverified":3,"n_samples_fingerprinted":0,"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":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":6,"unverified":3},"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":"2405.16405","arxiv_id_is_arxiv":true,"paper":"/paper/intruding-with-words-towards-understanding","title":"Intruding with Words: Towards Understanding Graph Injection Attacks at the Text Level","date":"2024-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Leirunlin/Text-level-Graph-Attack","path":"load_graph.py","file_url":"https://github.com/Leirunlin/Text-level-Graph-Attack/blob/HEAD/load_graph.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, Leirunlin/Text-level-Graph-Attack when it was checked","code_sha256":"9ed828c70754da92","code_sha256_prefix":"9ed828c70754da92","mcp_get_code":{"code_sha256":"9ed828c70754da92"}},{"arxiv_id":"2309.13944","arxiv_id_is_arxiv":true,"paper":"/paper/provable-training-for-graph-contrastive-1","title":"Provable Training for Graph Contrastive Learning","date":"2023-09-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VoidHaruhi/POT-GCL","path":"GRACE/my_utils.py","file_url":"https://github.com/VoidHaruhi/POT-GCL/blob/HEAD/GRACE/my_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":"b6b75b8c990299ac","code_sha256_prefix":"b6b75b8c990299ac","mcp_get_code":{"code_sha256":"b6b75b8c990299ac"}},{"arxiv_id":"2306.02732","arxiv_id_is_arxiv":true,"paper":"/paper/conformal-prediction-with-missing-values","title":"Conformal Prediction with Missing Values","date":"2023-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mzaffran/conformalpredictionmissingvalues","path":"generation.py","file_url":"https://github.com/mzaffran/conformalpredictionmissingvalues/blob/HEAD/generation.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":"58e912048123bae6","code_sha256_prefix":"58e912048123bae6","mcp_get_code":{"code_sha256":"58e912048123bae6"}},{"arxiv_id":"2305.04658","arxiv_id_is_arxiv":true,"paper":"/paper/csgcl-community-strength-enhanced-graph","title":"CSGCL: Community-Strength-Enhanced Graph Contrastive Learning","date":"2023-05-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hanchen-hust/csgcl","path":"src/utils.py","file_url":"https://github.com/hanchen-hust/csgcl/blob/HEAD/src/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":"b41011cae64fab39","code_sha256_prefix":"b41011cae64fab39","mcp_get_code":{"code_sha256":"b41011cae64fab39"}},{"arxiv_id":"2212.10560","arxiv_id_is_arxiv":true,"paper":"/paper/self-instruct-aligning-language-model-with","title":"Self-Instruct: Aligning Language Models with Self-Generated Instructions","date":"2022-12-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"imoneoi/openchat","path":"ochat/experimental/generate_dataset_old.py","file_url":"https://github.com/imoneoi/openchat/blob/HEAD/ochat/experimental/generate_dataset_old.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":"a4fc9157b8751af4","code_sha256_prefix":"a4fc9157b8751af4","mcp_get_code":{"code_sha256":"a4fc9157b8751af4"}},{"arxiv_id":"2111.07337","arxiv_id_is_arxiv":true,"paper":"/paper/p-laplacian-based-graph-neural-networks-1","title":"$p$-Laplacian Based Graph Neural Networks","date":"2021-11-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"guoji-fu/pGNNs","path":"data_proc.py","file_url":"https://github.com/guoji-fu/pGNNs/blob/HEAD/data_proc.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":"7e43b77d6fc59c07","code_sha256_prefix":"7e43b77d6fc59c07","mcp_get_code":{"code_sha256":"7e43b77d6fc59c07"}},{"arxiv_id":"2106.09708","arxiv_id_is_arxiv":true,"paper":"/paper/multi-label-learning-from-single-positive","title":"Multi-Label Learning from Single Positive Labels","date":"2021-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"elijahcole/single-positive-multi-label","path":"datasets.py","file_url":"https://github.com/elijahcole/single-positive-multi-label/blob/HEAD/datasets.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":"710fec7dc17f5069","code_sha256_prefix":"710fec7dc17f5069","mcp_get_code":{"code_sha256":"710fec7dc17f5069"}},{"arxiv_id":"2002.07518","arxiv_id_is_arxiv":true,"paper":"/paper/self-enhanced-gnn-improving-graph-neural","title":"Self-Enhanced GNN: Improving Graph Neural Networks Using Model Outputs","date":"2020-02-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yang-han/Self-Enhanced_GNN","path":"utils.py","file_url":"https://github.com/yang-han/Self-Enhanced_GNN/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":"d4df4403ecfd91fa","code_sha256_prefix":"d4df4403ecfd91fa","mcp_get_code":{"code_sha256":"d4df4403ecfd91fa"}},{"arxiv_id":"1905.12052","arxiv_id_is_arxiv":true,"paper":"/paper/a-new-distribution-on-the-simplex-with-auto","title":"A New Distribution on the Simplex with Auto-Encoding Applications","date":"2019-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"astirn/MV-Kumaraswamy","path":"model_utils.py","file_url":"https://github.com/astirn/MV-Kumaraswamy/blob/HEAD/model_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":"4e82b547f317148c","code_sha256_prefix":"4e82b547f317148c","mcp_get_code":{"code_sha256":"4e82b547f317148c"}}],"record_sha256":"414eccef645c44caab7c73a0a860ed1e4ff54525f5c82b5fa96c4cf484eb4a77","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}