{"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/percentile","entry":"percentile","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":12,"n_papers_ran":12,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":9,"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":9,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":7,"n_samples_unverified":0,"n_samples_fingerprinted":6,"n_places":12,"n_places_pointer_only":8,"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":3,"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":"2609.04105","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-04105","title":"Hardware-Aware FP4 FlashAttention-4","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"MrHuff/fp4-fa4","path":"results/fp4_fa4_technical_report_v2_20260819/export_llama8b_b4_snapshot.py","file_url":"https://github.com/MrHuff/fp4-fa4/blob/HEAD/results/fp4_fa4_technical_report_v2_20260819/export_llama8b_b4_snapshot.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5284c9d8206ffe40","code_sha256_prefix":"5284c9d8206ffe40","mcp_get_code":{"code_sha256":"5284c9d8206ffe40"}},{"arxiv_id":"2606.30560","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-30560","title":"TraceLab: Characterizing Coding Agent Workloads for LLM Serving","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"uw-syfi/TraceLab","path":"artifacts/utils/growth.py","file_url":"https://github.com/uw-syfi/TraceLab/blob/HEAD/artifacts/utils/growth.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f5d51d90d1032ddd","code_sha256_prefix":"f5d51d90d1032ddd","mcp_get_code":{"code_sha256":"f5d51d90d1032ddd"}},{"arxiv_id":"2510.13451","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-13451","title":"Toward Efficient Inference Attacks: Shadow Model Sharing via Mixture-of-Experts","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"BaiLibl/ShadowPool","path":"models/resnet_moe.py","file_url":"https://github.com/BaiLibl/ShadowPool/blob/HEAD/models/resnet_moe.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, BaiLibl/ShadowPool when it was checked","code_sha256":"3b99baf0c1a4b7f2","code_sha256_prefix":"3b99baf0c1a4b7f2","mcp_get_code":{"code_sha256":"3b99baf0c1a4b7f2"}},{"arxiv_id":"2410.08893","arxiv_id_is_arxiv":true,"paper":"/paper/drama-mamba-enabled-model-based-reinforcement","title":"Drama: Mamba-Enabled Model-Based Reinforcement Learning Is Sample and Parameter Efficient","date":"2024-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"realwenlongwang/Drama","path":"agents.py","file_url":"https://github.com/realwenlongwang/Drama/blob/HEAD/agents.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, realwenlongwang/Drama when it was checked","code_sha256":"adce9ddcc08da8dc","code_sha256_prefix":"adce9ddcc08da8dc","mcp_get_code":{"code_sha256":"adce9ddcc08da8dc"}},{"arxiv_id":"2403.09274","arxiv_id_is_arxiv":true,"paper":"/paper/eventrpg-event-data-augmentation-with","title":"EventRPG: Event Data Augmentation with Relevance Propagation Guidance","date":"2024-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"myuansun/eventrpg","path":"utils/RelCAM.py","file_url":"https://github.com/myuansun/eventrpg/blob/HEAD/utils/RelCAM.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1b03542f209fada4","code_sha256_prefix":"1b03542f209fada4","mcp_get_code":{"code_sha256":"1b03542f209fada4"}},{"arxiv_id":"2312.11973","arxiv_id_is_arxiv":true,"paper":"/paper/continual-learning-forget-free-winning","title":"Continual Learning: Forget-free Winning Subnetworks for Video Representations","date":"2023-12-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ihaeyong/pnr","path":"model/subnet.py","file_url":"https://github.com/ihaeyong/pnr/blob/HEAD/model/subnet.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from ihaeyong/SoftNet-3DLS, and GitHub detected no licence in that repository when it was checked","code_sha256":"913e2d426938c7d4","code_sha256_prefix":"913e2d426938c7d4","mcp_get_code":{"code_sha256":"913e2d426938c7d4"}},{"arxiv_id":"2310.09615","arxiv_id_is_arxiv":true,"paper":"/paper/storm-efficient-stochastic-transformer-based-1","title":"STORM: Efficient Stochastic Transformer based World Models for Reinforcement Learning","date":"2023-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"weipu-zhang/storm","path":"agents.py","file_url":"https://github.com/weipu-zhang/storm/blob/HEAD/agents.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, weipu-zhang/storm when it was checked","code_sha256":"adce9ddcc08da8dc","code_sha256_prefix":"adce9ddcc08da8dc","mcp_get_code":{"code_sha256":"adce9ddcc08da8dc"}},{"arxiv_id":"2308.10110","arxiv_id_is_arxiv":true,"paper":"/paper/robust-mixture-of-expert-training-for","title":"Robust Mixture-of-Expert Training for Convolutional Neural Networks","date":"2023-08-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"optml-group/robust-moe-cnn","path":"models/resnet_cifar_moe.py","file_url":"https://github.com/optml-group/robust-moe-cnn/blob/HEAD/models/resnet_cifar_moe.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, optml-group/robust-moe-cnn when it was checked","code_sha256":"3b99baf0c1a4b7f2","code_sha256_prefix":"3b99baf0c1a4b7f2","mcp_get_code":{"code_sha256":"3b99baf0c1a4b7f2"}},{"arxiv_id":"2209.07529","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-soft-subnetwork-for-few-shot-class","title":"On the Soft-Subnetwork for Few-shot Class Incremental Learning","date":"2022-09-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ihaeyong/SoftNet-3DLS","path":"subnet.py","file_url":"https://github.com/ihaeyong/SoftNet-3DLS/blob/HEAD/subnet.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ihaeyong/SoftNet-3DLS when it was checked","code_sha256":"913e2d426938c7d4","code_sha256_prefix":"913e2d426938c7d4","mcp_get_code":{"code_sha256":"913e2d426938c7d4"}},{"arxiv_id":"2010.01795","arxiv_id_is_arxiv":true,"paper":"/paper/dct-snn-using-dct-to-distribute-spatial-1","title":"DCT-SNN: Using DCT to Distribute Spatial Information over Time for Learning Low-Latency Spiking Neural Networks","date":"2020-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SayeedChowdhury/dct-snn","path":"spike_model_cifar.py","file_url":"https://github.com/SayeedChowdhury/dct-snn/blob/HEAD/spike_model_cifar.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, SayeedChowdhury/dct-snn when it was checked","code_sha256":"cc175be6213cc918","code_sha256_prefix":"cc175be6213cc918","mcp_get_code":{"code_sha256":"cc175be6213cc918"}},{"arxiv_id":"2008.01998","arxiv_id_is_arxiv":true,"paper":"/paper/optimal-variance-control-of-the-score","title":"Optimal Variance Control of the Score Function Gradient Estimator for Importance Weighted Bounds","date":"2020-08-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vlievin/ovis","path":"ovis/analysis/utils.py","file_url":"https://github.com/vlievin/ovis/blob/HEAD/ovis/analysis/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"290d2878c24757d5","code_sha256_prefix":"290d2878c24757d5","mcp_get_code":{"code_sha256":"290d2878c24757d5"}},{"arxiv_id":"2004.05923","arxiv_id_is_arxiv":true,"paper":"/paper/adversarial-robustness-guarantees-for-random","title":"Adversarial Robustness Guarantees for Random Deep Neural Networks","date":"2020-04-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bkiani/Adversarial-robustness-guarantees-for-random-deep-neural-networks","path":"analyze_csv.py","file_url":"https://github.com/bkiani/Adversarial-robustness-guarantees-for-random-deep-neural-networks/blob/HEAD/analyze_csv.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, bkiani/Adversarial-robustness-guarantees-for-random-deep-neural-networks when it was checked","code_sha256":"02e692988a2d9b6c","code_sha256_prefix":"02e692988a2d9b6c","mcp_get_code":{"code_sha256":"02e692988a2d9b6c"}}],"record_sha256":"eb44b87abda304c799ec0fdd6b225f55a2dab9b9e92c40c7c414085cc0f1e9b5","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}