{"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/ce","entry":"CE","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":7,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":5,"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":5,"n_samples_constructed":2,"n_samples_ran_checked":4,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":3,"n_places":7,"n_places_pointer_only":4,"n_places_pointer_only_link_open":1,"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":4,"unverified":1},"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":"2606.05675","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-05675","title":"Two-Way Is Better Than One: Bidirectional Alignment with Cycle Consistency for Exemplar-Free Class-Incremental Learning","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"HXuSz11/BiCyc_ICLR2026","path":"src/approach/bicyc.py","file_url":"https://github.com/HXuSz11/BiCyc_ICLR2026/blob/HEAD/src/approach/bicyc.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, HXuSz11/BiCyc_ICLR2026 when it was checked","code_sha256":"f7ffc7c8671ac840","code_sha256_prefix":"f7ffc7c8671ac840","mcp_get_code":{"code_sha256":"f7ffc7c8671ac840"}},{"arxiv_id":"2407.12292","arxiv_id_is_arxiv":true,"paper":"/paper/any-target-can-be-offense-adversarial-example","title":"Any Target Can be Offense: Adversarial Example Generation via Generalized Latent Infection","date":"2024-07-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VL-Group/GAKer","path":"utils/metrics.py","file_url":"https://github.com/VL-Group/GAKer/blob/HEAD/utils/metrics.py","status":"ran","verification_level":1,"contract_check":null,"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, VL-Group/GAKer when it was checked","code_sha256":"0daa5f9fe5b85ae3","code_sha256_prefix":"0daa5f9fe5b85ae3","mcp_get_code":{"code_sha256":"0daa5f9fe5b85ae3"}},{"arxiv_id":"2308.07026","arxiv_id_is_arxiv":true,"paper":"/paper/advclip-downstream-agnostic-adversarial","title":"AdvCLIP: Downstream-agnostic Adversarial Examples in Multimodal Contrastive Learning","date":"2023-08-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cgcl-codes/advclip","path":"utils/metrics.py","file_url":"https://github.com/cgcl-codes/advclip/blob/HEAD/utils/metrics.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"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 VL-Group/GAKer, and GitHub detected no licence in that repository when it was checked","code_sha256":"0daa5f9fe5b85ae3","code_sha256_prefix":"0daa5f9fe5b85ae3","mcp_get_code":{"code_sha256":"0daa5f9fe5b85ae3"}},{"arxiv_id":"2305.06024","arxiv_id_is_arxiv":true,"paper":"/paper/the-robustness-of-computer-vision-models","title":"A Survey on the Robustness of Computer Vision Models against Common Corruptions","date":"2023-05-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nis-research/corruptionbenchcv","path":"metric.py","file_url":"https://github.com/nis-research/corruptionbenchcv/blob/HEAD/metric.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ecdb67236a56d7d0","code_sha256_prefix":"ecdb67236a56d7d0","mcp_get_code":{"code_sha256":"ecdb67236a56d7d0"}},{"arxiv_id":"2207.07859","arxiv_id_is_arxiv":true,"paper":"/paper/deep-learning-and-its-applications-to-wifi","title":"SenseFi: A Library and Benchmark on Deep-Learning-Empowered WiFi Human Sensing","date":"2022-07-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xyanchen/wifi-csi-sensing-benchmark","path":"self_supervised.py","file_url":"https://github.com/xyanchen/wifi-csi-sensing-benchmark/blob/HEAD/self_supervised.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a0acdeb9e2825a25","code_sha256_prefix":"a0acdeb9e2825a25","mcp_get_code":{"code_sha256":"a0acdeb9e2825a25"}},{"arxiv_id":"2110.07402","arxiv_id_is_arxiv":true,"paper":"/paper/self-supervised-learning-by-estimating-twin-1","title":"Self-Supervised Learning by Estimating Twin Class Distributions","date":"2021-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bytedance/TWIST","path":"objective.py","file_url":"https://github.com/bytedance/TWIST/blob/HEAD/objective.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":"5067fd3e4ebe3111","code_sha256_prefix":"5067fd3e4ebe3111","mcp_get_code":{"code_sha256":"5067fd3e4ebe3111"}},{"arxiv_id":"2109.06620","arxiv_id_is_arxiv":true,"paper":"/paper/dynamic-attentive-graph-learning-for-image","title":"Dynamic Attentive Graph Learning for Image Restoration","date":"2021-09-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jianzhangcs/DAGL","path":"CAR/model/dagl.py","file_url":"https://github.com/jianzhangcs/DAGL/blob/HEAD/CAR/model/dagl.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, jianzhangcs/DAGL when it was checked","code_sha256":"caccd3545cc230de","code_sha256_prefix":"caccd3545cc230de","mcp_get_code":{"code_sha256":"caccd3545cc230de"}}],"record_sha256":"4cd12a1423f9d31cb3ce512967cbd6872fcce5b8527f6b0d5a39ce76e52133bf","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}