{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/word-count","entry":"word_count","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":7,"n_papers_ran":2,"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":2,"n_samples_fingerprinted":2,"n_places":7,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":2},"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.31048","paper":"/paper/arxiv-2606-31048","title":"Knowledge Distillation from Large Reasoning Models to Compact Student Models: A Case Study on the John O'Bryan Mathematics Competition","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"TempGaurab/Distillation.John-O-Bryan","path":"average_words.py","file_url":"https://github.com/TempGaurab/Distillation.John-O-Bryan/blob/HEAD/average_words.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"747f4d0d010adab8","mcp_get_code":{"code_sha256":"747f4d0d010adab8"}},{"arxiv_id":"2603.00077","paper":"/paper/arxiv-2603-00077","title":"Autorubric: A Unifying Framework for Rubric-Based LLM Evaluation on Non-Verifiable Tasks","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"delip/autorubric","path":"src/autorubric/utils.py","file_url":"https://github.com/delip/autorubric/blob/HEAD/src/autorubric/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"4bbc967e91c65e68","mcp_get_code":{"code_sha256":"4bbc967e91c65e68"}},{"arxiv_id":"2310.00647","paper":"/paper/beyond-task-performance-evaluating-and","title":"Beyond Task Performance: Evaluating and Reducing the Flaws of Large Multimodal Models with In-Context Learning","date":"2023-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mshukor/EvALign-ICL","path":"open_flamingo/eval/eval_datasets.py","file_url":"https://github.com/mshukor/EvALign-ICL/blob/HEAD/open_flamingo/eval/eval_datasets.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"86f1da2d2e3774cd","mcp_get_code":{"code_sha256":"86f1da2d2e3774cd"}},{"arxiv_id":"2204.05125","paper":"/paper/escm-2-entire-space-counterfactual-multi-task","title":"ESCM$^2$: Entire Space Counterfactual Multi-Task Model for Post-Click Conversion Rate Estimation","date":"2022-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PaddlePaddle/PaddleRec","path":"datasets/ag_news/text2paddle.py","file_url":"https://github.com/PaddlePaddle/PaddleRec/blob/HEAD/datasets/ag_news/text2paddle.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"5d079a1802fd6cb9","mcp_get_code":{"code_sha256":"5d079a1802fd6cb9"}},{"arxiv_id":"2106.03760","paper":"/paper/dselect-k-differentiable-selection-in-the","title":"DSelect-k: Differentiable Selection in the Mixture of Experts with Applications to Multi-Task Learning","date":"2021-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Andy1314Chen/PaddleRec","path":"datasets/ag_news/text2paddle.py","file_url":"https://github.com/Andy1314Chen/PaddleRec/blob/HEAD/datasets/ag_news/text2paddle.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"5d079a1802fd6cb9","mcp_get_code":{"code_sha256":"5d079a1802fd6cb9"}},{"arxiv_id":"2008.13535","paper":"/paper/dcn-m-improved-deep-cross-network-for-feature","title":"DCN V2: Improved Deep & Cross Network and Practical Lessons for Web-scale Learning to Rank Systems","date":"2020-08-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LinJayan/DCN_V2_Paddle","path":"datasets/ag_news/text2paddle.py","file_url":"https://github.com/LinJayan/DCN_V2_Paddle/blob/HEAD/datasets/ag_news/text2paddle.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"5d079a1802fd6cb9","mcp_get_code":{"code_sha256":"5d079a1802fd6cb9"}},{"arxiv_id":"2003.11235","paper":"/paper/autofis-automatic-feature-interaction","title":"AutoFIS: Automatic Feature Interaction Selection in Factorization Models for Click-Through Rate Prediction","date":"2020-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"renmada/PaddleRec","path":"datasets/ag_news/text2paddle.py","file_url":"https://github.com/renmada/PaddleRec/blob/HEAD/datasets/ag_news/text2paddle.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"5d079a1802fd6cb9","mcp_get_code":{"code_sha256":"5d079a1802fd6cb9"}}]}