{"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/testdataset","entry":"TestDataset","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":4,"n_papers_ran_no_instrument_failure":4,"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":6,"n_samples_ran":4,"n_samples_constructed":4,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":6,"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":4,"unverified":2},"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":"2608.12219","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-12219","title":"ScreenShot: A Foundation Model for Few-Shot Combination Drug Screening","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"tansey-lab/screenshot","path":"screenshot/screenshot.py","file_url":"https://github.com/tansey-lab/screenshot/blob/HEAD/screenshot/screenshot.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, tansey-lab/screenshot when it was checked","code_sha256":"1904cbefdef57a58","code_sha256_prefix":"1904cbefdef57a58","mcp_get_code":{"code_sha256":"1904cbefdef57a58"}},{"arxiv_id":"2405.08540","arxiv_id_is_arxiv":true,"paper":"/paper/generalizing-knowledge-graph-embedding-with","title":"Generalizing Knowledge Graph Embedding with Universal Orthogonal Parameterization","date":"2024-05-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xxrep/golde","path":"codes/model.py","file_url":"https://github.com/xxrep/golde/blob/HEAD/codes/model.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, xxrep/golde when it was checked","code_sha256":"82a269d33cccaa1d","code_sha256_prefix":"82a269d33cccaa1d","mcp_get_code":{"code_sha256":"82a269d33cccaa1d"}},{"arxiv_id":"2305.14126","arxiv_id_is_arxiv":true,"paper":"/paper/to-copy-rather-than-memorize-a-vertical","title":"To Copy Rather Than Memorize: A Vertical Learning Paradigm for Knowledge Graph Completion","date":"2023-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rui9812/VLP","path":"codes/model.py","file_url":"https://github.com/rui9812/VLP/blob/HEAD/codes/model.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, rui9812/VLP when it was checked","code_sha256":"3ddbccd537a3a76d","code_sha256_prefix":"3ddbccd537a3a76d","mcp_get_code":{"code_sha256":"3ddbccd537a3a76d"}},{"arxiv_id":"2204.13221","arxiv_id_is_arxiv":true,"paper":"/paper/transher-translating-knowledge-graph","title":"TranSHER: Translating Knowledge Graph Embedding with Hyper-Ellipsoidal Restriction","date":"2022-04-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yizhilll/TranSHER","path":"codes/model.py","file_url":"https://github.com/yizhilll/TranSHER/blob/HEAD/codes/model.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, yizhilll/TranSHER when it was checked","code_sha256":"ec535956bec28d4f","code_sha256_prefix":"ec535956bec28d4f","mcp_get_code":{"code_sha256":"ec535956bec28d4f"}},{"arxiv_id":"2202.07919","arxiv_id_is_arxiv":true,"paper":"/paper/house-knowledge-graph-embedding-with","title":"HousE: Knowledge Graph Embedding with Householder Parameterization","date":"2022-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anrep/house","path":"codes/model.py","file_url":"https://github.com/anrep/house/blob/HEAD/codes/model.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, anrep/house when it was checked","code_sha256":"68db55eb4268f790","code_sha256_prefix":"68db55eb4268f790","mcp_get_code":{"code_sha256":"68db55eb4268f790"}},{"arxiv_id":"2104.07869","arxiv_id_is_arxiv":true,"paper":"/paper/faithfully-explainable-recommendation-via","title":"Faithfully Explainable Recommendation via Neural Logic Reasoning","date":"2021-04-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"orcax/LOGER","path":"kge/model.py","file_url":"https://github.com/orcax/LOGER/blob/HEAD/kge/model.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, orcax/LOGER when it was checked","code_sha256":"6f56a2264f4ed1ba","code_sha256_prefix":"6f56a2264f4ed1ba","mcp_get_code":{"code_sha256":"6f56a2264f4ed1ba"}}],"record_sha256":"2f8ec98bff3f4b91b9aa44ab0b1a337c7355e58da8cb767c3ba093bda4a405ee","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}