{"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/where","entry":"where","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":9,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":3,"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":9,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":3,"n_samples_unverified":2,"n_samples_fingerprinted":4,"n_places":9,"n_places_pointer_only":1,"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":1,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":0,"ran":3,"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":"2603.08824","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-08824","title":"SoftJAX & SoftTorch: Empowering Automatic Differentiation Libraries with Informative Gradients","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"a-paulus/softtorch","path":"src/softtorch/functions.py","file_url":"https://github.com/a-paulus/softtorch/blob/HEAD/src/softtorch/functions.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f8a16211e1f3cce6","code_sha256_prefix":"f8a16211e1f3cce6","mcp_get_code":{"code_sha256":"f8a16211e1f3cce6"}},{"arxiv_id":"2406.19298","arxiv_id_is_arxiv":true,"paper":"/paper/compositional-image-decomposition-with","title":"Compositional Image Decomposition with Diffusion Models","date":"2024-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"1Konny/Beta-VAE","path":"utils.py","file_url":"https://github.com/1Konny/Beta-VAE/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"748ecd3b20613687","code_sha256_prefix":"748ecd3b20613687","mcp_get_code":{"code_sha256":"748ecd3b20613687"}},{"arxiv_id":"2108.10252","arxiv_id_is_arxiv":true,"paper":"/paper/federated-multi-task-learning-under-a-mixture","title":"Federated Multi-Task Learning under a Mixture of Distributions","date":"2021-08-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tj-kim/pfeddef_v1","path":"transfer_attacks/TA_utils.py","file_url":"https://github.com/tj-kim/pfeddef_v1/blob/HEAD/transfer_attacks/TA_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f5f8985f740c045e","code_sha256_prefix":"f5f8985f740c045e","mcp_get_code":{"code_sha256":"f5f8985f740c045e"}},{"arxiv_id":"2102.07818","arxiv_id_is_arxiv":true,"paper":"/paper/certified-robustness-to-programmable","title":"Certified Robustness to Programmable Transformations in LSTMs","date":"2021-02-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"foreverzyh/certified_lstms","path":"src/ibp.py","file_url":"https://github.com/foreverzyh/certified_lstms/blob/HEAD/src/ibp.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":"92963ee5c7b16174","code_sha256_prefix":"92963ee5c7b16174","mcp_get_code":{"code_sha256":"92963ee5c7b16174"}},{"arxiv_id":"2008.07298","arxiv_id_is_arxiv":true,"paper":"/paper/waffle-watermarking-in-federated-learning","title":"WAFFLE: Watermarking in Federated Learning","date":"2020-08-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ssg-research/WAFFLE","path":"src/SBP_utils.py","file_url":"https://github.com/ssg-research/WAFFLE/blob/HEAD/src/SBP_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"57dfc664d187900b","code_sha256_prefix":"57dfc664d187900b","mcp_get_code":{"code_sha256":"57dfc664d187900b"}},{"arxiv_id":"2007.10587","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-compose-hypercolumns-for-visual","title":"Learning to Compose Hypercolumns for Visual Correspondence","date":"2020-07-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"juhongm999/dhpf","path":"common/utils.py","file_url":"https://github.com/juhongm999/dhpf/blob/HEAD/common/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":"80d6ded0c77a9a43","code_sha256_prefix":"80d6ded0c77a9a43","mcp_get_code":{"code_sha256":"80d6ded0c77a9a43"}},{"arxiv_id":"1908.06537","arxiv_id_is_arxiv":true,"paper":"/paper/hyperpixel-flow-semantic-correspondence-with","title":"Hyperpixel Flow: Semantic Correspondence with Multi-layer Neural Features","date":"2019-08-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"juhongm999/hpf","path":"model/util.py","file_url":"https://github.com/juhongm999/hpf/blob/HEAD/model/util.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":"d874287e132f420c","code_sha256_prefix":"d874287e132f420c","mcp_get_code":{"code_sha256":"d874287e132f420c"}},{"arxiv_id":"1805.11090","arxiv_id_is_arxiv":true,"paper":"/paper/genattack-practical-black-box-attacks-with","title":"GenAttack: Practical Black-box Attacks with Gradient-Free Optimization","date":"2018-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"maremun/GenAttackMCS2018","path":"genattack.py","file_url":"https://github.com/maremun/GenAttackMCS2018/blob/HEAD/genattack.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":"23e2e9ee651bbb83","code_sha256_prefix":"23e2e9ee651bbb83","mcp_get_code":{"code_sha256":"23e2e9ee651bbb83"}},{"arxiv_id":"1706.03762","arxiv_id_is_arxiv":true,"paper":"/paper/attention-is-all-you-need","title":"Attention Is All You Need","date":"2017-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DevSinghSachan/multilingual_nmt","path":"models/transformer.py","file_url":"https://github.com/DevSinghSachan/multilingual_nmt/blob/HEAD/models/transformer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, DevSinghSachan/multilingual_nmt when it was checked","code_sha256":"7cfc4c98b7f87608","code_sha256_prefix":"7cfc4c98b7f87608","mcp_get_code":{"code_sha256":"7cfc4c98b7f87608"}}],"record_sha256":"1b4c9565af8ed46b0cce41e28571b7cc6644ef87d0c13513add1996d1892004d","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}