{"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/setup-custom-logger","entry":"setup_custom_logger","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":6,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":4,"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":5,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":3,"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":3,"ran_fixture":0,"ran":2,"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":"2510.15346","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-15346","title":"When to Ensemble: Identifying Token-Level Points for Stable and Fast LLM Ensembling WHEN TO ENSEMBLE: IDENTIFYING TOKEN-LEVEL POINTS FOR STABLE AND FAST LLM ENSEMBLING","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"yoon6503/SAFE","path":"logger.py","file_url":"https://github.com/yoon6503/SAFE/blob/HEAD/logger.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, yoon6503/SAFE when it was checked","code_sha256":"e008364719672578","code_sha256_prefix":"e008364719672578","mcp_get_code":{"code_sha256":"e008364719672578"}},{"arxiv_id":"2409.11355","arxiv_id_is_arxiv":true,"paper":"/paper/fine-tuning-image-conditional-diffusion","title":"Fine-Tuning Image-Conditional Diffusion Models is Easier than You Think","date":"2024-09-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VisualComputingInstitute/diffusion-e2e-ft","path":"DSINE/utils/utils.py","file_url":"https://github.com/VisualComputingInstitute/diffusion-e2e-ft/blob/HEAD/DSINE/utils/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, VisualComputingInstitute/diffusion-e2e-ft when it was checked","code_sha256":"dc4ca4a94df3d89e","code_sha256_prefix":"dc4ca4a94df3d89e","mcp_get_code":{"code_sha256":"dc4ca4a94df3d89e"}},{"arxiv_id":"2406.12585","arxiv_id_is_arxiv":true,"paper":"/paper/breaking-the-ceiling-of-the-llm-community-by","title":"Breaking the Ceiling of the LLM Community by Treating Token Generation as a Classification for Ensembling","date":"2024-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yaoching0/gac","path":"utils/logger.py","file_url":"https://github.com/yaoching0/gac/blob/HEAD/utils/logger.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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 yoon6503/SAFE, and GitHub detected no licence in that repository when it was checked","code_sha256":"e008364719672578","code_sha256_prefix":"e008364719672578","mcp_get_code":{"code_sha256":"e008364719672578"}},{"arxiv_id":"2402.18789","arxiv_id_is_arxiv":true,"paper":"/paper/flexllm-a-system-for-co-serving-large","title":"FlexLLM: A System for Co-Serving Large Language Model Inference and Parameter-Efficient Finetuning","date":"2024-02-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"flexflow/flexflow","path":"bindings/python/old/flexflow/core/flexflow_logger.py","file_url":"https://github.com/flexflow/flexflow/blob/HEAD/bindings/python/old/flexflow/core/flexflow_logger.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"66e8b9c310140433","code_sha256_prefix":"66e8b9c310140433","mcp_get_code":{"code_sha256":"66e8b9c310140433"}},{"arxiv_id":"2104.08453","arxiv_id_is_arxiv":true,"paper":"/paper/attacking-text-classifiers-via-sentence","title":"R&R: Metric-guided Adversarial Sentence Generation","date":"2021-04-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DAI-Lab/fibber","path":"fibber/log.py","file_url":"https://github.com/DAI-Lab/fibber/blob/HEAD/fibber/log.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":"0e00c66a59122b8e","code_sha256_prefix":"0e00c66a59122b8e","mcp_get_code":{"code_sha256":"0e00c66a59122b8e"}},{"arxiv_id":"1701.03551","arxiv_id_is_arxiv":true,"paper":"/paper/cost-effective-active-learning-for-deep-image","title":"Cost-Effective Active Learning for Deep Image Classification","date":"2017-01-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tueboesen/Active-Learning","path":"src/log.py","file_url":"https://github.com/tueboesen/Active-Learning/blob/HEAD/src/log.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":"3360b4747085c822","code_sha256_prefix":"3360b4747085c822","mcp_get_code":{"code_sha256":"3360b4747085c822"}}],"record_sha256":"aa5429d66470ec9e9c6e85dddd8219c61e952efd5d35ba6d6aabdf951e6333db","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}