{"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/compute-top-k","entry":"compute_top_k","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":7,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":6,"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":2,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":7,"n_places_pointer_only":4,"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":1,"ran_fixture":0,"ran":1,"unverified":0},"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":"2403.05897","arxiv_id_is_arxiv":true,"paper":"/paper/realnet-a-feature-selection-network-with","title":"RealNet: A Feature Selection Network with Realistic Synthetic Anomaly for Anomaly Detection","date":"2024-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cnulab/RealNet","path":"train_classifier.py","file_url":"https://github.com/cnulab/RealNet/blob/HEAD/train_classifier.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":"f85c45c8d1765da4","code_sha256_prefix":"f85c45c8d1765da4","mcp_get_code":{"code_sha256":"f85c45c8d1765da4"}},{"arxiv_id":"2401.03968","arxiv_id_is_arxiv":true,"paper":"/paper/scdiffusion-conditional-generation-of-high","title":"scDiffusion: conditional generation of high-quality single-cell data using diffusion model","date":"2024-01-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eperluo/scdiffusion","path":"classifier_train.py","file_url":"https://github.com/eperluo/scdiffusion/blob/HEAD/classifier_train.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"84d9dfb6a1fa75a6","code_sha256_prefix":"84d9dfb6a1fa75a6","mcp_get_code":{"code_sha256":"84d9dfb6a1fa75a6"}},{"arxiv_id":"2307.02770","arxiv_id_is_arxiv":true,"paper":"/paper/censored-sampling-of-diffusion-models-using-3-1","title":"Censored Sampling of Diffusion Models Using 3 Minutes of Human Feedback","date":"2023-07-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"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":"84d9dfb6a1fa75a6","code_sha256_prefix":"84d9dfb6a1fa75a6","mcp_get_code":{"code_sha256":"84d9dfb6a1fa75a6"}},{"arxiv_id":"2301.13622","arxiv_id_is_arxiv":true,"paper":"/paper/learning-data-representations-with-joint","title":"Learning Data Representations with Joint Diffusion Models","date":"2023-01-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"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":"84d9dfb6a1fa75a6","code_sha256_prefix":"84d9dfb6a1fa75a6","mcp_get_code":{"code_sha256":"84d9dfb6a1fa75a6"}},{"arxiv_id":"2301.12334","arxiv_id_is_arxiv":true,"paper":"/paper/don-t-play-favorites-minority-guidance-for","title":"Don't Play Favorites: Minority Guidance for Diffusion Models","date":"2023-01-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"soobin-um/minority-guidance","path":"classifier_train.py","file_url":"https://github.com/soobin-um/minority-guidance/blob/HEAD/classifier_train.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"84d9dfb6a1fa75a6","code_sha256_prefix":"84d9dfb6a1fa75a6","mcp_get_code":{"code_sha256":"84d9dfb6a1fa75a6"}},{"arxiv_id":"2208.08664","arxiv_id_is_arxiv":true,"paper":"/paper/enhancing-diffusion-based-image-synthesis","title":"Enhancing Diffusion-Based Image Synthesis with Robust Classifier Guidance","date":"2022-08-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"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":"84d9dfb6a1fa75a6","code_sha256_prefix":"84d9dfb6a1fa75a6","mcp_get_code":{"code_sha256":"84d9dfb6a1fa75a6"}},{"arxiv_id":"2203.04306","arxiv_id_is_arxiv":true,"paper":"/paper/diffusion-models-for-medical-anomaly","title":"Diffusion Models for Medical Anomaly Detection","date":"2022-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"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":"84d9dfb6a1fa75a6","code_sha256_prefix":"84d9dfb6a1fa75a6","mcp_get_code":{"code_sha256":"84d9dfb6a1fa75a6"}}],"record_sha256":"e96aee02a3c6bd6cd3d09adcbca3b460ff1b32fac16afa0d091f8788088ad074","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}