{"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/fetch-data","entry":"fetch_data","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":3,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":1,"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":6,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":1,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":2,"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":1,"ran_fixture":0,"ran":2,"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":"2409.05208","arxiv_id_is_arxiv":true,"paper":"/paper/influence-based-attributions-can-be","title":"Influence-based Attributions can be Manipulated","date":"2024-09-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"infinite-pursuits/influence-based-attributions-can-be-manipulated","path":"fairness_manipulation/dataset.py","file_url":"https://github.com/infinite-pursuits/influence-based-attributions-can-be-manipulated/blob/HEAD/fairness_manipulation/dataset.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, infinite-pursuits/influence-based-attributions-can-be-manipulated when it was checked","code_sha256":"4c7fbcfed8667b92","code_sha256_prefix":"4c7fbcfed8667b92","mcp_get_code":{"code_sha256":"4c7fbcfed8667b92"}},{"arxiv_id":"2202.00787","arxiv_id_is_arxiv":true,"paper":"/paper/achieving-fairness-at-no-utility-cost-via","title":"Achieving Fairness at No Utility Cost via Data Reweighing with Influence","date":"2022-02-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"brandeis-machine-learning/influence-fairness","path":"dataset.py","file_url":"https://github.com/brandeis-machine-learning/influence-fairness/blob/HEAD/dataset.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":"4c7fbcfed8667b92","code_sha256_prefix":"4c7fbcfed8667b92","mcp_get_code":{"code_sha256":"4c7fbcfed8667b92"}},{"arxiv_id":"2105.00956","arxiv_id_is_arxiv":true,"paper":"/paper/unignn-a-unified-framework-for-graph-and","title":"UniGNN: a Unified Framework for Graph and Hypergraph Neural Networks","date":"2021-05-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"OneForward/UniGNN","path":"prepare.py","file_url":"https://github.com/OneForward/UniGNN/blob/HEAD/prepare.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":"5c22a845d8303e27","code_sha256_prefix":"5c22a845d8303e27","mcp_get_code":{"code_sha256":"5c22a845d8303e27"}},{"arxiv_id":"1905.06292","arxiv_id_is_arxiv":true,"paper":"/paper/3d-point-cloud-generative-adversarial-network","title":"3D Point Cloud Generative Adversarial Network Based on Tree Structured Graph Convolutions","date":"2019-05-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"prajwalsingh/TreeGCN-ED","path":"utils.py","file_url":"https://github.com/prajwalsingh/TreeGCN-ED/blob/HEAD/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":"fa73af0144d9c1c5","code_sha256_prefix":"fa73af0144d9c1c5","mcp_get_code":{"code_sha256":"fa73af0144d9c1c5"}},{"arxiv_id":"1905.06292","arxiv_id_is_arxiv":true,"paper":"/paper/3d-point-cloud-generative-adversarial-network","title":"3D Point Cloud Generative Adversarial Network Based on Tree Structured Graph Convolutions","date":"2019-05-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"prajwalsingh/TreeGCN-GAN","path":"utils.py","file_url":"https://github.com/prajwalsingh/TreeGCN-GAN/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":"03ad94b765c74aa7","code_sha256_prefix":"03ad94b765c74aa7","mcp_get_code":{"code_sha256":"03ad94b765c74aa7"}},{"arxiv_id":"1803.01328","arxiv_id_is_arxiv":true,"paper":"/paper/whai-weibull-hybrid-autoencoding-inference","title":"WHAI: Weibull Hybrid Autoencoding Inference for Deep Topic Modeling","date":"2018-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sophieburkhardt/dirichlet-vae-topic-models","path":"utils.py","file_url":"https://github.com/sophieburkhardt/dirichlet-vae-topic-models/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, sophieburkhardt/dirichlet-vae-topic-models when it was checked","code_sha256":"f43b57089e6b9fb0","code_sha256_prefix":"f43b57089e6b9fb0","mcp_get_code":{"code_sha256":"f43b57089e6b9fb0"}},{"arxiv_id":"1703.00512","arxiv_id_is_arxiv":true,"paper":"/paper/pmlb-a-large-benchmark-suite-for-machine","title":"PMLB: A Large Benchmark Suite for Machine Learning Evaluation and Comparison","date":"2017-03-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"EpistasisLab/penn-ml-benchmarks","path":"pmlb/pmlb.py","file_url":"https://github.com/EpistasisLab/penn-ml-benchmarks/blob/HEAD/pmlb/pmlb.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":"2e35baa597c65d68","code_sha256_prefix":"2e35baa597c65d68","mcp_get_code":{"code_sha256":"2e35baa597c65d68"}}],"record_sha256":"a2f68b79493490bff0f710627283b52a458e24cad00f544dd932e02f57b4cad4","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}