{"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/export","entry":"export","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":10,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":7,"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":4,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":1,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":10,"n_places_pointer_only":7,"n_places_pointer_only_link_open":6,"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":1,"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":"2405.14854","arxiv_id_is_arxiv":true,"paper":"/paper/terdit-ternary-diffusion-models-with","title":"TerDiT: Ternary Diffusion Models with Transformers","date":"2024-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Lucky-Lance/TerDiT","path":"models.py","file_url":"https://github.com/Lucky-Lance/TerDiT/blob/HEAD/models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"84d035114dad12a2","code_sha256_prefix":"84d035114dad12a2","mcp_get_code":{"code_sha256":"84d035114dad12a2"}},{"arxiv_id":"2308.00279","arxiv_id_is_arxiv":true,"paper":"/paper/robust-positive-unlabeled-learning-via-noise","title":"Robust Positive-Unlabeled Learning via Noise Negative Sample Self-correction","date":"2023-08-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"woriazzc/robust-pu","path":"helpers.py","file_url":"https://github.com/woriazzc/robust-pu/blob/HEAD/helpers.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, woriazzc/robust-pu when it was checked","code_sha256":"2660b9d52e1de712","code_sha256_prefix":"2660b9d52e1de712","mcp_get_code":{"code_sha256":"2660b9d52e1de712"}},{"arxiv_id":"2306.06327","arxiv_id_is_arxiv":true,"paper":"/paper/any-dimensional-equivariant-neural-networks","title":"Any-dimensional equivariant neural networks","date":"2023-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mateodd25/free-nets","path":"emlp/utils.py","file_url":"https://github.com/mateodd25/free-nets/blob/HEAD/emlp/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from woriazzc/robust-pu, and GitHub detected no licence in that repository when it was checked","code_sha256":"2660b9d52e1de712","code_sha256_prefix":"2660b9d52e1de712","mcp_get_code":{"code_sha256":"2660b9d52e1de712"}},{"arxiv_id":"2305.17284","arxiv_id_is_arxiv":true,"paper":"/paper/gc-flow-a-graph-based-flow-network-for","title":"GC-Flow: A Graph-Based Flow Network for Effective Clustering","date":"2023-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xztcwang/GCFlow","path":"flow_ssl/utils.py","file_url":"https://github.com/xztcwang/GCFlow/blob/HEAD/flow_ssl/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from woriazzc/robust-pu, and GitHub detected no licence in that repository when it was checked","code_sha256":"2660b9d52e1de712","code_sha256_prefix":"2660b9d52e1de712","mcp_get_code":{"code_sha256":"2660b9d52e1de712"}},{"arxiv_id":"2204.00887","arxiv_id_is_arxiv":true,"paper":"/paper/dimensionless-machine-learning-imposing-exact","title":"Dimensionless machine learning: Imposing exact units equivariance","date":"2022-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"weichiyao/scalaremlp","path":"scalaremlp/utils.py","file_url":"https://github.com/weichiyao/scalaremlp/blob/HEAD/scalaremlp/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from woriazzc/robust-pu, and GitHub detected no licence in that repository when it was checked","code_sha256":"2660b9d52e1de712","code_sha256_prefix":"2660b9d52e1de712","mcp_get_code":{"code_sha256":"2660b9d52e1de712"}},{"arxiv_id":"2106.06610","arxiv_id_is_arxiv":true,"paper":"/paper/scalars-are-universal-gauge-equivariant","title":"Scalars are universal: Equivariant machine learning, structured like classical physics","date":"2021-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"researchworking/scalaremlp","path":"scalaremlp/utils.py","file_url":"https://github.com/researchworking/scalaremlp/blob/HEAD/scalaremlp/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from woriazzc/robust-pu, and GitHub detected no licence in that repository when it was checked","code_sha256":"2660b9d52e1de712","code_sha256_prefix":"2660b9d52e1de712","mcp_get_code":{"code_sha256":"2660b9d52e1de712"}},{"arxiv_id":"2104.09459","arxiv_id_is_arxiv":true,"paper":"/paper/a-practical-method-for-constructing","title":"A Practical Method for Constructing Equivariant Multilayer Perceptrons for Arbitrary Matrix Groups","date":"2021-04-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mfinzi/equivariant-MLP","path":"emlp/utils.py","file_url":"https://github.com/mfinzi/equivariant-MLP/blob/HEAD/emlp/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from woriazzc/robust-pu, and GitHub detected no licence in that repository when it was checked","code_sha256":"2660b9d52e1de712","code_sha256_prefix":"2660b9d52e1de712","mcp_get_code":{"code_sha256":"2660b9d52e1de712"}},{"arxiv_id":"1904.04717","arxiv_id_is_arxiv":true,"paper":"/paper/label-propagation-for-deep-semi-supervised","title":"Label Propagation for Deep Semi-supervised Learning","date":"2019-04-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ahmetius/LP-DeepSSL","path":"mean_teacher/utils.py","file_url":"https://github.com/ahmetius/LP-DeepSSL/blob/HEAD/mean_teacher/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from woriazzc/robust-pu, and GitHub detected no licence in that repository when it was checked","code_sha256":"2660b9d52e1de712","code_sha256_prefix":"2660b9d52e1de712","mcp_get_code":{"code_sha256":"2660b9d52e1de712"}},{"arxiv_id":"1904.02877","arxiv_id_is_arxiv":true,"paper":"/paper/single-path-nas-designing-hardware-efficient","title":"Single-Path NAS: Designing Hardware-Efficient ConvNets in less than 4 Hours","date":"2019-04-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dstamoulis/single-path-nas","path":"nas-search/search_main.py","file_url":"https://github.com/dstamoulis/single-path-nas/blob/HEAD/nas-search/search_main.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":"e75aa2c199a09405","code_sha256_prefix":"e75aa2c199a09405","mcp_get_code":{"code_sha256":"e75aa2c199a09405"}},{"arxiv_id":"1807.10439","arxiv_id_is_arxiv":true,"paper":"/paper/symbolic-execution-for-deep-neural-networks","title":"Symbolic Execution for Deep Neural Networks","date":null,"month_inferred_from_arxiv_id":"2018-07","title_source":"archive","repo":"Koukyosyumei/Gymbo","path":"src/gymbo/export.py","file_url":"https://github.com/Koukyosyumei/Gymbo/blob/HEAD/src/gymbo/export.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":"745a93abf29fa660","code_sha256_prefix":"745a93abf29fa660","mcp_get_code":{"code_sha256":"745a93abf29fa660"}}],"record_sha256":"818c93c036b94e31f53b71d6230687ac27a29059f1bded44971dae2db9c4a00d","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}