{"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/word-count","entry":"word_count","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":7,"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":4,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":3,"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":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":"2606.31048","arxiv_id_is_arxiv":true,"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_honours","verification_level":1,"contract_check":"HONOURS","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, TempGaurab/Distillation.John-O-Bryan when it was checked","code_sha256":"747f4d0d010adab8","code_sha256_prefix":"747f4d0d010adab8","mcp_get_code":{"code_sha256":"747f4d0d010adab8"}},{"arxiv_id":"2603.00077","arxiv_id_is_arxiv":true,"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":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, delip/autorubric (NOASSERTION)","code_sha256":"4bbc967e91c65e68","code_sha256_prefix":"4bbc967e91c65e68","mcp_get_code":{"code_sha256":"4bbc967e91c65e68"}},{"arxiv_id":"2310.00647","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, mshukor/EvALign-ICL when it was checked","code_sha256":"86f1da2d2e3774cd","code_sha256_prefix":"86f1da2d2e3774cd","mcp_get_code":{"code_sha256":"86f1da2d2e3774cd"}},{"arxiv_id":"2204.05125","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5d079a1802fd6cb9","code_sha256_prefix":"5d079a1802fd6cb9","mcp_get_code":{"code_sha256":"5d079a1802fd6cb9"}},{"arxiv_id":"2106.03760","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5d079a1802fd6cb9","code_sha256_prefix":"5d079a1802fd6cb9","mcp_get_code":{"code_sha256":"5d079a1802fd6cb9"}},{"arxiv_id":"2008.13535","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5d079a1802fd6cb9","code_sha256_prefix":"5d079a1802fd6cb9","mcp_get_code":{"code_sha256":"5d079a1802fd6cb9"}},{"arxiv_id":"2003.11235","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5d079a1802fd6cb9","code_sha256_prefix":"5d079a1802fd6cb9","mcp_get_code":{"code_sha256":"5d079a1802fd6cb9"}}],"record_sha256":"2f5e5eb8e00a512720faa92f1c55d85309b0a24d4268474a400b68e2f5576ff4","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}