{"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/calculate-flops","entry":"calculate_flops","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":10,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":8,"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":2,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":10,"n_places_pointer_only":6,"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":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":2},"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.28743","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-28743","title":"Rethinking Language Model Scaling under Transferable Hypersphere Optimization","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"microsoft/ArchScale","path":"plot_flops_scaling.py","file_url":"https://github.com/microsoft/ArchScale/blob/HEAD/plot_flops_scaling.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":"e2e4134ae510653b","code_sha256_prefix":"e2e4134ae510653b","mcp_get_code":{"code_sha256":"e2e4134ae510653b"}},{"arxiv_id":"2410.21662","arxiv_id_is_arxiv":true,"paper":"/paper/f-po-generalizing-preference-optimization","title":"$f$-PO: Generalizing Preference Optimization with $f$-divergence Minimization","date":"2024-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"minkaixu/fpo","path":"src/utils/perf.py","file_url":"https://github.com/minkaixu/fpo/blob/HEAD/src/utils/perf.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":"069f56cb00324e10","code_sha256_prefix":"069f56cb00324e10","mcp_get_code":{"code_sha256":"069f56cb00324e10"}},{"arxiv_id":"2410.16843","arxiv_id_is_arxiv":true,"paper":"/paper/trustworthy-alignment-of-retrieval-augmented","title":"Trustworthy Alignment of Retrieval-Augmented Large Language Models via Reinforcement Learning","date":"2024-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zmzhang2000/trustworthy-alignment","path":"dschat/utils/perf.py","file_url":"https://github.com/zmzhang2000/trustworthy-alignment/blob/HEAD/dschat/utils/perf.py","status":"ran","verification_level":1,"contract_check":null,"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, zmzhang2000/trustworthy-alignment when it was checked","code_sha256":"069f56cb00324e10","code_sha256_prefix":"069f56cb00324e10","mcp_get_code":{"code_sha256":"069f56cb00324e10"}},{"arxiv_id":"2406.16635","arxiv_id_is_arxiv":true,"paper":"/paper/shadowllm-predictor-based-contextual-sparsity","title":"ShadowLLM: Predictor-based Contextual Sparsity for Large Language Models","date":"2024-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"abdelfattah-lab/shadow_llm","path":"llm-interpret/lm-evaluation-harness/ablation_studies/ablation_predmodel_bleb1eseq/perf_model.py","file_url":"https://github.com/abdelfattah-lab/shadow_llm/blob/HEAD/llm-interpret/lm-evaluation-harness/ablation_studies/ablation_predmodel_bleb1eseq/perf_model.py","status":"unverified","verification_level":0,"contract_check":null,"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, abdelfattah-lab/shadow_llm when it was checked","code_sha256":"ddfb29c47d101337","code_sha256_prefix":"ddfb29c47d101337","mcp_get_code":{"code_sha256":"ddfb29c47d101337"}},{"arxiv_id":"2406.11030","arxiv_id_is_arxiv":true,"paper":"/paper/foodieqa-a-multimodal-dataset-for-fine","title":"FoodieQA: A Multimodal Dataset for Fine-Grained Understanding of Chinese Food Culture","date":"2024-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lyan62/FoodieQA","path":"Yi/finetune/utils/perf.py","file_url":"https://github.com/lyan62/FoodieQA/blob/HEAD/Yi/finetune/utils/perf.py","status":"ran","verification_level":1,"contract_check":null,"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, lyan62/FoodieQA when it was checked","code_sha256":"069f56cb00324e10","code_sha256_prefix":"069f56cb00324e10","mcp_get_code":{"code_sha256":"069f56cb00324e10"}},{"arxiv_id":"2405.16455","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-algorithmic-bias-of-aligning-large","title":"On the Algorithmic Bias of Aligning Large Language Models with RLHF: Preference Collapse and Matching Regularization","date":"2024-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JiancongXiao/PM_RLHF","path":"dschat/utils/perf.py","file_url":"https://github.com/JiancongXiao/PM_RLHF/blob/HEAD/dschat/utils/perf.py","status":"ran","verification_level":1,"contract_check":null,"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, JiancongXiao/PM_RLHF when it was checked","code_sha256":"069f56cb00324e10","code_sha256_prefix":"069f56cb00324e10","mcp_get_code":{"code_sha256":"069f56cb00324e10"}},{"arxiv_id":"2403.14112","arxiv_id_is_arxiv":true,"paper":"/paper/benchmarking-chinese-commonsense-reasoning-of","title":"Benchmarking Chinese Commonsense Reasoning of LLMs: From Chinese-Specifics to Reasoning-Memorization Correlations","date":"2024-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"01-ai/Yi","path":"finetune/utils/perf.py","file_url":"https://github.com/01-ai/Yi/blob/HEAD/finetune/utils/perf.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":"069f56cb00324e10","code_sha256_prefix":"069f56cb00324e10","mcp_get_code":{"code_sha256":"069f56cb00324e10"}},{"arxiv_id":"2402.05808","arxiv_id_is_arxiv":true,"paper":"/paper/training-large-language-models-for-reasoning","title":"Training Large Language Models for Reasoning through Reverse Curriculum Reinforcement Learning","date":"2024-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"woooodyy/llm-reverse-curriculum-rl","path":"R3_others/dschat/utils/perf.py","file_url":"https://github.com/woooodyy/llm-reverse-curriculum-rl/blob/HEAD/R3_others/dschat/utils/perf.py","status":"ran","verification_level":1,"contract_check":null,"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, woooodyy/llm-reverse-curriculum-rl when it was checked","code_sha256":"069f56cb00324e10","code_sha256_prefix":"069f56cb00324e10","mcp_get_code":{"code_sha256":"069f56cb00324e10"}},{"arxiv_id":"2310.10505","arxiv_id_is_arxiv":true,"paper":"/paper/remax-a-simple-effective-and-efficient-method","title":"ReMax: A Simple, Effective, and Efficient Reinforcement Learning Method for Aligning Large Language Models","date":"2023-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liziniu/ReMax","path":"utils/perf.py","file_url":"https://github.com/liziniu/ReMax/blob/HEAD/utils/perf.py","status":"ran","verification_level":1,"contract_check":null,"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, liziniu/ReMax when it was checked","code_sha256":"069f56cb00324e10","code_sha256_prefix":"069f56cb00324e10","mcp_get_code":{"code_sha256":"069f56cb00324e10"}},{"arxiv_id":"2304.08177","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-and-effective-text-encoding-for","title":"Efficient and Effective Text Encoding for Chinese LLaMA and Alpaca","date":"2023-04-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mryxj/calculate-flops.pytorch","path":"calflops/flops_counter.py","file_url":"https://github.com/mryxj/calculate-flops.pytorch/blob/HEAD/calflops/flops_counter.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e9d40620ba06c476","code_sha256_prefix":"e9d40620ba06c476","mcp_get_code":{"code_sha256":"e9d40620ba06c476"}}],"record_sha256":"773202740a49fdbeba5d2d5a8bcc3f336361a0fe1d457f9a412bdd787e33c4ac","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}