{"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","entry":"fetch","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":11,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":7,"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":12,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":0,"n_samples_unverified":5,"n_samples_fingerprinted":0,"n_places":12,"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":0,"ran_fixture":0,"ran":7,"unverified":5},"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":"2609.01147","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-01147","title":"On the Design Fundamentals of Pixel Text Representation Learning","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"Pixel-Linguist/Pixel-Linguist-II","path":"training/download_font_lib.py","file_url":"https://github.com/Pixel-Linguist/Pixel-Linguist-II/blob/HEAD/training/download_font_lib.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":"9a899a58e1d1bcd5","code_sha256_prefix":"9a899a58e1d1bcd5","mcp_get_code":{"code_sha256":"9a899a58e1d1bcd5"}},{"arxiv_id":"2603.11456","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-11456","title":"UniHetCO: A Unified Heterogeneous Representation for Multi-Problem Learning in Unsupervised Neural Combinatorial Optimization","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"drdarshan/ssgetpy","path":"ssgetpy/query.py","file_url":"https://github.com/drdarshan/ssgetpy/blob/HEAD/ssgetpy/query.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, drdarshan/ssgetpy when it was checked","code_sha256":"e86fc63fdfc1bec9","code_sha256_prefix":"e86fc63fdfc1bec9","mcp_get_code":{"code_sha256":"e86fc63fdfc1bec9"}},{"arxiv_id":"2410.13185","arxiv_id_is_arxiv":true,"paper":"/paper/chain-of-ideas-revolutionizing-research-in","title":"Chain of Ideas: Revolutionizing Research Via Novel Idea Development with LLM Agents","date":"2024-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"damo-nlp-sg/coi-agent","path":"searcher/sementic_search.py","file_url":"https://github.com/damo-nlp-sg/coi-agent/blob/HEAD/searcher/sementic_search.py","status":"ran","verification_level":1,"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":"4872fb8c1582e598","code_sha256_prefix":"4872fb8c1582e598","mcp_get_code":{"code_sha256":"4872fb8c1582e598"}},{"arxiv_id":"2401.05064","arxiv_id_is_arxiv":true,"paper":"/paper/singer-identity-representation-learning-using-1","title":"Singer Identity Representation Learning using Self-Supervised Techniques","date":"2024-01-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SonyCSLParis/ssl-singer-identity","path":"singer_identity/utils/fetch_pretrained.py","file_url":"https://github.com/SonyCSLParis/ssl-singer-identity/blob/HEAD/singer_identity/utils/fetch_pretrained.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":"1160558ca3846ea8","code_sha256_prefix":"1160558ca3846ea8","mcp_get_code":{"code_sha256":"1160558ca3846ea8"}},{"arxiv_id":"2312.11575","arxiv_id_is_arxiv":true,"paper":"/paper/blind-touch-homomorphic-encryption-based","title":"Blind-Touch: Homomorphic Encryption-Based Distributed Neural Network Inference for Privacy-Preserving Fingerprint Authentication","date":null,"month_inferred_from_arxiv_id":"2023-12","title_source":"archive","repo":"hm-choi/blind-touch","path":"server/main/service.py","file_url":"https://github.com/hm-choi/blind-touch/blob/HEAD/server/main/service.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, hm-choi/blind-touch when it was checked","code_sha256":"81e224f43d24d0d8","code_sha256_prefix":"81e224f43d24d0d8","mcp_get_code":{"code_sha256":"81e224f43d24d0d8"}},{"arxiv_id":"2301.03962","arxiv_id_is_arxiv":true,"paper":"/paper/a-unified-theory-of-diversity-in-ensemble","title":"A Unified Theory of Diversity in Ensemble Learning","date":"2023-01-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"echostatements/decompose","path":"datasets/mnist_download_script.py","file_url":"https://github.com/echostatements/decompose/blob/HEAD/datasets/mnist_download_script.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":"ee877a81ad4c64cb","code_sha256_prefix":"ee877a81ad4c64cb","mcp_get_code":{"code_sha256":"ee877a81ad4c64cb"}},{"arxiv_id":"2212.09387","arxiv_id_is_arxiv":true,"paper":"/paper/prompt-gating-a-parameter-efficient-tuning","title":"An Extensible Plug-and-Play Method for Multi-Aspect Controllable Text Generation","date":"2022-12-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thunlp-mt/promptgating4mctg","path":"codes/exp_tense/tense_detector_t.py","file_url":"https://github.com/thunlp-mt/promptgating4mctg/blob/HEAD/codes/exp_tense/tense_detector_t.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cb76fc23dc68c244","code_sha256_prefix":"cb76fc23dc68c244","mcp_get_code":{"code_sha256":"cb76fc23dc68c244"}},{"arxiv_id":"2105.05233","arxiv_id_is_arxiv":true,"paper":"/paper/diffusion-models-beat-gans-on-image-synthesis","title":"Diffusion Models Beat GANs on Image Synthesis","date":"2021-05-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"afiaka87/clip-guided-diffusion","path":"cgd/script_util.py","file_url":"https://github.com/afiaka87/clip-guided-diffusion/blob/HEAD/cgd/script_util.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":"9f95b3f3132f00a1","code_sha256_prefix":"9f95b3f3132f00a1","mcp_get_code":{"code_sha256":"9f95b3f3132f00a1"}},{"arxiv_id":"1904.03345","arxiv_id_is_arxiv":true,"paper":"/paper/semantic-graph-convolutional-networks-for-3d","title":"Semantic Graph Convolutional Networks for 3D Human Pose Regression","date":"2019-04-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"garyzhao/SemGCN","path":"common/data_utils.py","file_url":"https://github.com/garyzhao/SemGCN/blob/HEAD/common/data_utils.py","status":"ran","verification_level":1,"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":"a01e37bb132ecaf4","code_sha256_prefix":"a01e37bb132ecaf4","mcp_get_code":{"code_sha256":"a01e37bb132ecaf4"}},{"arxiv_id":"1803.07612","arxiv_id_is_arxiv":true,"paper":"/paper/generating-multi-agent-trajectories-using","title":"Generating Multi-Agent Trajectories using Programmatic Weak Supervision","date":"2018-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ezhan94/gen-MA-BC","path":"datasets/boids/core.py","file_url":"https://github.com/ezhan94/gen-MA-BC/blob/HEAD/datasets/boids/core.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":"18bdadd5a50960c1","code_sha256_prefix":"18bdadd5a50960c1","mcp_get_code":{"code_sha256":"18bdadd5a50960c1"}},{"arxiv_id":"1803.07612","arxiv_id_is_arxiv":true,"paper":"/paper/generating-multi-agent-trajectories-using","title":"Generating Multi-Agent Trajectories using Programmatic Weak Supervision","date":"2018-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ezhan94/gen-MA-BC","path":"datasets/bball/core.py","file_url":"https://github.com/ezhan94/gen-MA-BC/blob/HEAD/datasets/bball/core.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":"7c3eb3c1c81a189b","code_sha256_prefix":"7c3eb3c1c81a189b","mcp_get_code":{"code_sha256":"7c3eb3c1c81a189b"}},{"arxiv_id":"1605.06640","arxiv_id_is_arxiv":true,"paper":"/paper/programming-with-a-differentiable-forth","title":"Programming with a Differentiable Forth Interpreter","date":"2016-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uclmr/d4","path":"d4/dsm/symbolic_dsm.py","file_url":"https://github.com/uclmr/d4/blob/HEAD/d4/dsm/symbolic_dsm.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":"61b326e16068cc59","code_sha256_prefix":"61b326e16068cc59","mcp_get_code":{"code_sha256":"61b326e16068cc59"}}],"record_sha256":"10b85f03d9bcf85d876f2e5e2ae184e6d3d20e68293e74e1a22ffc544814fb0a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}