{"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/dataset-split","entry":"dataset_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":12,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":8,"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":13,"n_samples_ran":9,"n_samples_constructed":0,"n_samples_ran_checked":9,"n_samples_instrument":0,"n_samples_unverified":4,"n_samples_fingerprinted":1,"n_places":13,"n_places_pointer_only":4,"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":9,"unverified":4},"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":"2412.08128","arxiv_id_is_arxiv":true,"paper":"/paper/why-does-dropping-edges-usually-outperform","title":"Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning?","date":"2024-12-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hyzhang98/epagcl","path":"Linear_evaluation.py","file_url":"https://github.com/hyzhang98/epagcl/blob/HEAD/Linear_evaluation.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, hyzhang98/epagcl when it was checked","code_sha256":"506aca657ecef682","code_sha256_prefix":"506aca657ecef682","mcp_get_code":{"code_sha256":"506aca657ecef682"}},{"arxiv_id":"2308.13862","arxiv_id_is_arxiv":true,"paper":"/paper/late-stopping-avoiding-confidently-learning","title":"Late Stopping: Avoiding Confidently Learning from Mislabeled Examples","date":"2023-08-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tmllab/2023_ICCV_LateStopping","path":"LateStopping/noise_build.py","file_url":"https://github.com/tmllab/2023_ICCV_LateStopping/blob/HEAD/LateStopping/noise_build.py","status":"unverified","verification_level":0,"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, tmllab/2023_ICCV_LateStopping when it was checked","code_sha256":"ac932dc1df220546","code_sha256_prefix":"ac932dc1df220546","mcp_get_code":{"code_sha256":"ac932dc1df220546"}},{"arxiv_id":"2307.09858","arxiv_id_is_arxiv":true,"paper":"/paper/towards-reliable-rare-category-analysis-on","title":"Towards Reliable Rare Category Analysis on Graphs via Individual Calibration","date":"2023-07-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wulongfeng/calirare","path":"utils/preprocessing.py","file_url":"https://github.com/wulongfeng/calirare/blob/HEAD/utils/preprocessing.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, wulongfeng/calirare when it was checked","code_sha256":"af00d6498d03d141","code_sha256_prefix":"af00d6498d03d141","mcp_get_code":{"code_sha256":"af00d6498d03d141"}},{"arxiv_id":"2202.13251","arxiv_id_is_arxiv":true,"paper":"/paper/supervising-remote-sensing-change-detection","title":"Supervising Remote Sensing Change Detection Models with 3D Surface Semantics","date":"2022-02-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"isaaccorley/contrastive-surface-image-pretraining","path":"csip/datasets/utils.py","file_url":"https://github.com/isaaccorley/contrastive-surface-image-pretraining/blob/HEAD/csip/datasets/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":"87da6a465ac9f270","code_sha256_prefix":"87da6a465ac9f270","mcp_get_code":{"code_sha256":"87da6a465ac9f270"}},{"arxiv_id":"2202.10261","arxiv_id_is_arxiv":true,"paper":"/paper/a-self-supervised-descriptor-for-image-copy","title":"A Self-Supervised Descriptor for Image Copy Detection","date":"2022-02-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/sscd-copy-detection","path":"sscd/disc_eval.py","file_url":"https://github.com/facebookresearch/sscd-copy-detection/blob/HEAD/sscd/disc_eval.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, facebookresearch/sscd-copy-detection, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"9dc49fcf121100bb","code_sha256_prefix":"9dc49fcf121100bb","mcp_get_code":{"code_sha256":"9dc49fcf121100bb"}},{"arxiv_id":"2101.09465","arxiv_id_is_arxiv":true,"paper":"/paper/websrc-a-dataset-for-web-based-structural","title":"WebSRC: A Dataset for Web-Based Structural Reading Comprehension","date":"2021-01-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"X-LANCE/WebSRC-Baseline","path":"src/dataset_generation.py","file_url":"https://github.com/X-LANCE/WebSRC-Baseline/blob/HEAD/src/dataset_generation.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":"25cc7305c47dc14a","code_sha256_prefix":"25cc7305c47dc14a","mcp_get_code":{"code_sha256":"25cc7305c47dc14a"}},{"arxiv_id":"1905.11946","arxiv_id_is_arxiv":true,"paper":"/paper/efficientnet-rethinking-model-scaling-for","title":"EfficientNet: Rethinking Model Scaling for Convolutional Neural Networks","date":"2019-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wangyi111/international-archaeology-ai-challenge","path":"datasets/IAAI_dataset.py","file_url":"https://github.com/wangyi111/international-archaeology-ai-challenge/blob/HEAD/datasets/IAAI_dataset.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":"fe7d84b7019b5acb","code_sha256_prefix":"fe7d84b7019b5acb","mcp_get_code":{"code_sha256":"fe7d84b7019b5acb"}},{"arxiv_id":"1905.04413","arxiv_id_is_arxiv":true,"paper":"/paper/knowledge-graph-convolutional-networks-for","title":"Knowledge-aware Graph Neural Networks with Label Smoothness Regularization for Recommender Systems","date":"2019-05-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YuTesla/KGNN-LS-learn","path":"src/data_loader.py","file_url":"https://github.com/YuTesla/KGNN-LS-learn/blob/HEAD/src/data_loader.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":"fc7c69d4b057c9e2","code_sha256_prefix":"fc7c69d4b057c9e2","mcp_get_code":{"code_sha256":"fc7c69d4b057c9e2"}},{"arxiv_id":"1904.12575","arxiv_id_is_arxiv":true,"paper":"/paper/190412575","title":"Knowledge Graph Convolutional Networks for Recommender Systems","date":"2019-03-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hwwang55/KGCN","path":"src/data_loader.py","file_url":"https://github.com/hwwang55/KGCN/blob/HEAD/src/data_loader.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":"65918cd1d6b5d811","code_sha256_prefix":"65918cd1d6b5d811","mcp_get_code":{"code_sha256":"65918cd1d6b5d811"}},{"arxiv_id":"1901.08907","arxiv_id_is_arxiv":true,"paper":"/paper/multi-task-feature-learning-for-knowledge","title":"Multi-Task Feature Learning for Knowledge Graph Enhanced Recommendation","date":"2019-01-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hwwang55/MKR","path":"src/data_loader.py","file_url":"https://github.com/hwwang55/MKR/blob/HEAD/src/data_loader.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"00773b90aacb7b2d","code_sha256_prefix":"00773b90aacb7b2d","mcp_get_code":{"code_sha256":"00773b90aacb7b2d"}},{"arxiv_id":"1803.03467","arxiv_id_is_arxiv":true,"paper":"/paper/ripplenet-propagating-user-preferences-on-the","title":"RippleNet: Propagating User Preferences on the Knowledge Graph for Recommender Systems","date":"2018-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hwwang55/RippleNet","path":"src/data_loader.py","file_url":"https://github.com/hwwang55/RippleNet/blob/HEAD/src/data_loader.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":"3807a263b7505930","code_sha256_prefix":"3807a263b7505930","mcp_get_code":{"code_sha256":"3807a263b7505930"}},{"arxiv_id":"1803.03467","arxiv_id_is_arxiv":true,"paper":"/paper/ripplenet-propagating-user-preferences-on-the","title":"RippleNet: Propagating User Preferences on the Knowledge Graph for Recommender Systems","date":"2018-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sdu-wjh/icws2020","path":"src/data_loader.py","file_url":"https://github.com/sdu-wjh/icws2020/blob/HEAD/src/data_loader.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":"cfb25fac458f2b48","code_sha256_prefix":"cfb25fac458f2b48","mcp_get_code":{"code_sha256":"cfb25fac458f2b48"}},{"arxiv_id":"aaai_29648","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_29648","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"haibin65535/ICL","path":"datasets.py","file_url":"https://github.com/haibin65535/ICL/blob/HEAD/datasets.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":"5a966043953f5d0f","code_sha256_prefix":"5a966043953f5d0f","mcp_get_code":{"code_sha256":"5a966043953f5d0f"}}],"record_sha256":"d0061a32f5c2a8784aa4528d744e01b560aa191c2d04aeb26d2348bea0c3dad6","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}