{"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/format-name","entry":"format_name","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":5,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":5,"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":4,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":4,"n_samples_unverified":0,"n_samples_fingerprinted":4,"n_places":5,"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":4,"ran_fixture":0,"ran":0,"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":"2603.22213","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-22213","title":"SPA: A Simple but Tough-to-Beat Baseline for Knowledge Injection","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"Tangkexian/SPA","path":"src/utils_tools/prompt_utils.py","file_url":"https://github.com/Tangkexian/SPA/blob/HEAD/src/utils_tools/prompt_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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, Tangkexian/SPA when it was checked","code_sha256":"a6ce1f529ec84c5d","code_sha256_prefix":"a6ce1f529ec84c5d","mcp_get_code":{"code_sha256":"a6ce1f529ec84c5d"}},{"arxiv_id":"2409.07431","arxiv_id_is_arxiv":true,"paper":"/paper/synthetic-continued-pretraining","title":"Synthetic continued pretraining","date":"2024-09-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zitongyang/synthetic_continued_pretraining","path":"utils/prompt_utils.py","file_url":"https://github.com/zitongyang/synthetic_continued_pretraining/blob/HEAD/utils/prompt_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from Tangkexian/SPA, and GitHub detected no licence in that repository when it was checked","code_sha256":"a6ce1f529ec84c5d","code_sha256_prefix":"a6ce1f529ec84c5d","mcp_get_code":{"code_sha256":"a6ce1f529ec84c5d"}},{"arxiv_id":"2403.19600","arxiv_id_is_arxiv":true,"paper":"/paper/enhance-image-classification-via-inter-class","title":"Enhance Image Classification via Inter-Class Image Mixup with Diffusion Model","date":"2024-03-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhicaiwww/diff-mix","path":"augmentation/diff_mix.py","file_url":"https://github.com/zhicaiwww/diff-mix/blob/HEAD/augmentation/diff_mix.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4f5c62de73d1d6ea","code_sha256_prefix":"4f5c62de73d1d6ea","mcp_get_code":{"code_sha256":"4f5c62de73d1d6ea"}},{"arxiv_id":"2403.13679","arxiv_id_is_arxiv":true,"paper":"/paper/roleinteract-evaluating-the-social","title":"SocialBench: Sociality Evaluation of Role-Playing Conversational Agents","date":"2024-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"x-plug/roleinteract","path":"dataset.py","file_url":"https://github.com/x-plug/roleinteract/blob/HEAD/dataset.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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, x-plug/roleinteract when it was checked","code_sha256":"9e20b00486307eb3","code_sha256_prefix":"9e20b00486307eb3","mcp_get_code":{"code_sha256":"9e20b00486307eb3"}},{"arxiv_id":"1806.06266","arxiv_id_is_arxiv":true,"paper":"/paper/on-strategyproof-conference-peer-review","title":"On Strategyproof Conference Peer Review","date":"2018-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xycforgithub/StrategyProof_Conference_Review","path":"DivideClusters/compare_sim.py","file_url":"https://github.com/xycforgithub/StrategyProof_Conference_Review/blob/HEAD/DivideClusters/compare_sim.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"27ddea40e326122d","code_sha256_prefix":"27ddea40e326122d","mcp_get_code":{"code_sha256":"27ddea40e326122d"}}],"record_sha256":"247da10d74158400e874c975bcb7e0813101bfca41d8ea8a8cd0ef1dc8a7c295","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}