{"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/drop-nodes","entry":"drop_nodes","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":3,"n_papers_ran_instrument_only":3,"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":5,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":6,"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":2,"ran_fixture":0,"ran":3,"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":"2411.15206","arxiv_id_is_arxiv":true,"paper":"/paper/self-supervised-conditional-distribution","title":"Conditional Distribution Learning on Graphs","date":"2024-11-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chenjie20/SSCDL","path":"augument.py","file_url":"https://github.com/chenjie20/SSCDL/blob/HEAD/augument.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, chenjie20/SSCDL when it was checked","code_sha256":"8c03efec876c64b5","code_sha256_prefix":"8c03efec876c64b5","mcp_get_code":{"code_sha256":"8c03efec876c64b5"}},{"arxiv_id":"2402.09834","arxiv_id_is_arxiv":true,"paper":"/paper/all-in-one-and-one-for-all-a-simple-yet","title":"All in One and One for All: A Simple yet Effective Method towards Cross-domain Graph Pretraining","date":"2024-02-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cshhzhao/gcope","path":"src/algorithm/graph_augment.py","file_url":"https://github.com/cshhzhao/gcope/blob/HEAD/src/algorithm/graph_augment.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, cshhzhao/gcope when it was checked","code_sha256":"00f2465672e87462","code_sha256_prefix":"00f2465672e87462","mcp_get_code":{"code_sha256":"00f2465672e87462"}},{"arxiv_id":"2312.10401","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-dimensional-rationale-in-graph","title":"Rethinking Dimensional Rationale in Graph Contrastive Learning from Causal Perspective","date":"2023-12-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"byronji/drgcl","path":"unsupervised_TU/aug.py","file_url":"https://github.com/byronji/drgcl/blob/HEAD/unsupervised_TU/aug.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, byronji/drgcl when it was checked","code_sha256":"33da216971e030f9","code_sha256_prefix":"33da216971e030f9","mcp_get_code":{"code_sha256":"33da216971e030f9"}},{"arxiv_id":"2310.14753","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-tokenizer-and-decoder-in-masked-1","title":"Rethinking Tokenizer and Decoder in Masked Graph Modeling for Molecules","date":"2023-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"syr-cn/simsgt","path":"chem/dataloader.py","file_url":"https://github.com/syr-cn/simsgt/blob/HEAD/chem/dataloader.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, syr-cn/simsgt when it was checked","code_sha256":"bacb3b25951416fd","code_sha256_prefix":"bacb3b25951416fd","mcp_get_code":{"code_sha256":"bacb3b25951416fd"}},{"arxiv_id":"2305.04501","arxiv_id_is_arxiv":true,"paper":"/paper/sega-structural-entropy-guided-anchor-view","title":"SEGA: Structural Entropy Guided Anchor View for Graph Contrastive Learning","date":"2023-05-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wu-junran/sega","path":"unsupervised_TU/aug.py","file_url":"https://github.com/wu-junran/sega/blob/HEAD/unsupervised_TU/aug.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"33da216971e030f9","code_sha256_prefix":"33da216971e030f9","mcp_get_code":{"code_sha256":"33da216971e030f9"}},{"arxiv_id":"2010.13902","arxiv_id_is_arxiv":true,"paper":"/paper/graph-contrastive-learning-with-augmentations","title":"Graph Contrastive Learning with Augmentations","date":"2020-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Shen-Lab/GraphCL_Automated","path":"unsupervised_TU/aug.py","file_url":"https://github.com/Shen-Lab/GraphCL_Automated/blob/HEAD/unsupervised_TU/aug.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, Shen-Lab/GraphCL_Automated when it was checked","code_sha256":"9d6cd266e78dc80f","code_sha256_prefix":"9d6cd266e78dc80f","mcp_get_code":{"code_sha256":"9d6cd266e78dc80f"}}],"record_sha256":"3564eed7bdeb73409ad4b0749e2698ff6b6d7895d720f8081f9056010ea542c3","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}