{"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/count","entry":"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":10,"n_papers_ran":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":9,"n_samples_ran":4,"n_samples_fingerprinted":2,"n_places":10,"n_places_pointer_only":4,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":1,"ran":3,"unverified":5},"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":"2512.07100","paper":"/paper/arxiv-2512-07100","title":"Dual Refinement Cycle Learning: Unsupervised Text Classification of Mamba and Community Detection on Text Attributed Graph","date":null,"month_inferred_from_arxiv_id":"2025-12","title_source":"syntology","repo":"wuanghoong/DRCL","path":"GCNtrain.py","file_url":"https://github.com/wuanghoong/DRCL/blob/HEAD/GCNtrain.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d606fef33d646563","mcp_get_code":{"code_sha256":"d606fef33d646563"}},{"arxiv_id":"2411.04975","paper":"/paper/suffixdecoding-a-model-free-approach-to","title":"SuffixDecoding: Extreme Speculative Decoding for Emerging AI Applications","date":"2024-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"snowflakedb/ArcticInference","path":"arctic_inference/dynasor/entropy.py","file_url":"https://github.com/snowflakedb/ArcticInference/blob/HEAD/arctic_inference/dynasor/entropy.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":"a5020ff014095b56","mcp_get_code":{"code_sha256":"a5020ff014095b56"}},{"arxiv_id":"2410.20274","paper":"/paper/library-learning-doesn-t-the-curious-case-of","title":"Library Learning Doesn't: The Curious Case of the Single-Use \"Library\"","date":"2024-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ikb-a/curious-case","path":"trove/ablation_experiment_results/other_runs/base_count_ablat1_run1/tmp_exec_math-counting2024-09-20T12:41:14,939404299-04:00.py","file_url":"https://github.com/ikb-a/curious-case/blob/HEAD/trove/ablation_experiment_results/other_runs/base_count_ablat1_run1/tmp_exec_math-counting2024-09-20T12%3A41%3A14%2C939404299-04%3A00.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"be0c7b5ae497c20e","mcp_get_code":{"code_sha256":"be0c7b5ae497c20e"}},{"arxiv_id":"2404.08973","paper":"/paper/praffl-a-preference-aware-scheme-in-fair","title":"PraFFL: A Preference-Aware Scheme in Fair Federated Learning","date":"2024-04-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rg223/praffl","path":"compas/truth_tables.py","file_url":"https://github.com/rg223/praffl/blob/HEAD/compas/truth_tables.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d58e104f92c4e0d1","mcp_get_code":{"code_sha256":"d58e104f92c4e0d1"}},{"arxiv_id":"2312.11023","paper":"/paper/frequency-spectrum-is-more-effective-for","title":"Frequency Spectrum is More Effective for Multimodal Representation and Fusion: A Multimodal Spectrum Rumor Detector","date":"2023-12-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dm4m/fsru","path":"data_loader.py","file_url":"https://github.com/dm4m/fsru/blob/HEAD/data_loader.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"48c1999cebb59fdd","mcp_get_code":{"code_sha256":"48c1999cebb59fdd"}},{"arxiv_id":"2310.05597","paper":"/paper/can-language-models-learn-analogical","title":"Can language models learn analogical reasoning? Investigating training objectives and comparisons to human performance","date":"2023-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kudkudak/word-embeddings-benchmarks","path":"web/vocabulary.py","file_url":"https://github.com/kudkudak/word-embeddings-benchmarks/blob/HEAD/web/vocabulary.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"dfdbeb9cc00ba5f0","mcp_get_code":{"code_sha256":"dfdbeb9cc00ba5f0"}},{"arxiv_id":"2305.08377","paper":"/paper/text-classification-via-large-language-models","title":"Text Classification via Large Language Models","date":"2023-05-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shannonai/gpt-cls-carp","path":"utils/count_nearest_neighbor.py","file_url":"https://github.com/shannonai/gpt-cls-carp/blob/HEAD/utils/count_nearest_neighbor.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":"6828e4c47cd02b57","mcp_get_code":{"code_sha256":"6828e4c47cd02b57"}},{"arxiv_id":"2212.11672","paper":"/paper/trustworthy-social-bias-measurement","title":"Trustworthy Social Bias Measurement","date":"2022-12-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rishibommasani/biasmeasures","path":"convergent_validity.py","file_url":"https://github.com/rishibommasani/biasmeasures/blob/HEAD/convergent_validity.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e106ef1ddf609e33","mcp_get_code":{"code_sha256":"e106ef1ddf609e33"}},{"arxiv_id":"1511.08060","paper":"/paper/an-open-access-repository-of-images-on-plant","title":"An open access repository of images on plant health to enable the development of mobile disease diagnostics","date":null,"month_inferred_from_arxiv_id":"2015-11","title_source":"archive","repo":"attaullah/downsampled-plant-disease-dataset","path":"downsample_script.py","file_url":"https://github.com/attaullah/downsampled-plant-disease-dataset/blob/HEAD/downsample_script.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"CC0-1.0","inline_ok":true,"code_sha256_prefix":"4905f03364b64d09","mcp_get_code":{"code_sha256":"4905f03364b64d09"}},{"arxiv_id":"2023.findings-emnlp.603","paper":null,"title":"arXiv:2023.findings-emnlp.603","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"ShannonAI/GPT-CLS-CARP","path":"utils/count_nearest_neighbor.py","file_url":"https://github.com/ShannonAI/GPT-CLS-CARP/blob/HEAD/utils/count_nearest_neighbor.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":"6828e4c47cd02b57","mcp_get_code":{"code_sha256":"6828e4c47cd02b57"}}]}