{"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/show","entry":"show","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":0,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":3,"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":2,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"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.05136","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-05136","title":"The Loss Does Not See the Basis, but Adam Does","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"idevender/loss-basis-adam","path":"experiments/attention_gauge_multiseed.py","file_url":"https://github.com/idevender/loss-basis-adam/blob/HEAD/experiments/attention_gauge_multiseed.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":"fc60bf0c32f8e050","code_sha256_prefix":"fc60bf0c32f8e050","mcp_get_code":{"code_sha256":"fc60bf0c32f8e050"}},{"arxiv_id":"2608.05136","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-05136","title":"The Loss Does Not See the Basis, but Adam Does","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"idevender/loss-basis-adam","path":"experiments/flowadam_upgrade_rms.py","file_url":"https://github.com/idevender/loss-basis-adam/blob/HEAD/experiments/flowadam_upgrade_rms.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"98475bbe62dca29c","code_sha256_prefix":"98475bbe62dca29c","mcp_get_code":{"code_sha256":"98475bbe62dca29c"}},{"arxiv_id":"2408.15205","arxiv_id_is_arxiv":true,"paper":"/paper/leveraging-hallucinations-to-reduce-manual","title":"Leveraging Hallucinations to Reduce Manual Prompt Dependency in Promptable Segmentation","date":"2024-08-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lwpyh/ProMaC_code","path":"utils_mllm.py","file_url":"https://github.com/lwpyh/ProMaC_code/blob/HEAD/utils_mllm.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":"03c001cd5ce7f974","code_sha256_prefix":"03c001cd5ce7f974","mcp_get_code":{"code_sha256":"03c001cd5ce7f974"}},{"arxiv_id":"2404.18539","arxiv_id_is_arxiv":true,"paper":"/paper/enhancing-boundary-segmentation-for","title":"Enhancing Boundary Segmentation for Topological Accuracy with Skeleton-based Methods","date":"2024-04-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"clovermini/skea_topo","path":"model/losses/loss.py","file_url":"https://github.com/clovermini/skea_topo/blob/HEAD/model/losses/loss.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, clovermini/skea_topo when it was checked","code_sha256":"b30427670952b4ca","code_sha256_prefix":"b30427670952b4ca","mcp_get_code":{"code_sha256":"b30427670952b4ca"}},{"arxiv_id":"2306.04848","arxiv_id_is_arxiv":true,"paper":"/paper/interpreting-and-improving-diffusion-models","title":"Interpreting and Improving Diffusion Models from an Optimization Perspective","date":"2023-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ToyotaResearchInstitute/gradient-estimation-sampler","path":"experiments/experiment_utils.py","file_url":"https://github.com/ToyotaResearchInstitute/gradient-estimation-sampler/blob/HEAD/experiments/experiment_utils.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":"4a2eec11353e2317","code_sha256_prefix":"4a2eec11353e2317","mcp_get_code":{"code_sha256":"4a2eec11353e2317"}},{"arxiv_id":"2006.10876","arxiv_id_is_arxiv":true,"paper":"/paper/beware-the-black-box-on-the-robustness-of","title":"Beware the Black-Box: on the Robustness of Recent Defenses to Adversarial Examples","date":"2020-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiaxiaojunQAQ/Comdefend","path":"Train_comdefend_TF.py","file_url":"https://github.com/jiaxiaojunQAQ/Comdefend/blob/HEAD/Train_comdefend_TF.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, jiaxiaojunQAQ/Comdefend when it was checked","code_sha256":"9433deaa44a0d29b","code_sha256_prefix":"9433deaa44a0d29b","mcp_get_code":{"code_sha256":"9433deaa44a0d29b"}},{"arxiv_id":"1811.12673","arxiv_id_is_arxiv":true,"paper":"/paper/comdefend-an-efficient-image-compression","title":"ComDefend: An Efficient Image Compression Model to Defend Adversarial Examples","date":"2018-11-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"9433deaa44a0d29b","code_sha256_prefix":"9433deaa44a0d29b","mcp_get_code":{"code_sha256":"9433deaa44a0d29b"}}],"record_sha256":"5ecddcb2baed5098d49f5a1b11276e5c6c6487818a2b1eef34b15e07a1c52924","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}