{"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/make-batches","entry":"make_batches","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":5,"n_papers_ran_instrument_only":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":7,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":4,"n_places":8,"n_places_pointer_only":4,"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":3,"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":"2605.15572","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-15572","title":"Measuring Maximum Activations in Open Large Language Models","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"clx1415926/Max_act_llm","path":"analyze_model.py","file_url":"https://github.com/clx1415926/Max_act_llm/blob/HEAD/analyze_model.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, clx1415926/Max_act_llm when it was checked","code_sha256":"15709f2d55fc50f5","code_sha256_prefix":"15709f2d55fc50f5","mcp_get_code":{"code_sha256":"15709f2d55fc50f5"}},{"arxiv_id":"2605.15572","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-15572","title":"Measuring Maximum Activations in Open Large Language Models","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"clx1415926/Max_act_llm","path":"quant_sanity_check.py","file_url":"https://github.com/clx1415926/Max_act_llm/blob/HEAD/quant_sanity_check.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, clx1415926/Max_act_llm when it was checked","code_sha256":"2714cd87a61e3a1a","code_sha256_prefix":"2714cd87a61e3a1a","mcp_get_code":{"code_sha256":"2714cd87a61e3a1a"}},{"arxiv_id":"2010.11465","arxiv_id_is_arxiv":true,"paper":"/paper/beta-embeddings-for-multi-hop-logical","title":"Beta Embeddings for Multi-Hop Logical Reasoning in Knowledge Graphs","date":"2020-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uclnlp/cqd","path":"kbc/models.py","file_url":"https://github.com/uclnlp/cqd/blob/HEAD/kbc/models.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b602fff455d94358","code_sha256_prefix":"b602fff455d94358","mcp_get_code":{"code_sha256":"b602fff455d94358"}},{"arxiv_id":"1905.12724","arxiv_id_is_arxiv":true,"paper":"/paper/diffusion-variational-autoencoders-1","title":"Variational Diffusion Autoencoders with Random Walk Sampling","date":"2019-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lihenryhfl/SpectralVAEGAN","path":"vdae/util.py","file_url":"https://github.com/lihenryhfl/SpectralVAEGAN/blob/HEAD/vdae/util.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":"e135919e9b27c8de","code_sha256_prefix":"e135919e9b27c8de","mcp_get_code":{"code_sha256":"e135919e9b27c8de"}},{"arxiv_id":"1812.01739","arxiv_id_is_arxiv":true,"paper":"/paper/benchmarking-keyword-spotting-efficiency-on","title":"Benchmarking Keyword Spotting Efficiency on Neuromorphic Hardware","date":"2018-12-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"abr/power_benchmarks","path":"run_benchmark.py","file_url":"https://github.com/abr/power_benchmarks/blob/HEAD/run_benchmark.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, abr/power_benchmarks when it was checked","code_sha256":"0c14dde5fe14c3e9","code_sha256_prefix":"0c14dde5fe14c3e9","mcp_get_code":{"code_sha256":"0c14dde5fe14c3e9"}},{"arxiv_id":"1804.00891","arxiv_id_is_arxiv":true,"paper":"/paper/hyperspherical-variational-auto-encoders","title":"Hyperspherical Variational Auto-Encoders","date":"2018-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"acr42/Neural-Variational-Knowledge-Graphs","path":"vkge/training/util.py","file_url":"https://github.com/acr42/Neural-Variational-Knowledge-Graphs/blob/HEAD/vkge/training/util.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":"da8dad1ae4e89d2f","code_sha256_prefix":"da8dad1ae4e89d2f","mcp_get_code":{"code_sha256":"da8dad1ae4e89d2f"}},{"arxiv_id":"1602.02311","arxiv_id_is_arxiv":true,"paper":"/paper/renyi-divergence-variational-inference","title":"Rényi Divergence Variational Inference","date":"2016-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YingzhenLi/VRbound","path":"BayesianNN/black_box_alphamax.py","file_url":"https://github.com/YingzhenLi/VRbound/blob/HEAD/BayesianNN/black_box_alphamax.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, YingzhenLi/VRbound when it was checked","code_sha256":"bdb00138ee82e7da","code_sha256_prefix":"bdb00138ee82e7da","mcp_get_code":{"code_sha256":"bdb00138ee82e7da"}},{"arxiv_id":"aaai_25868","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_25868","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"KlugerLab/SpectralNet","path":"src/core/util.py","file_url":"https://github.com/KlugerLab/SpectralNet/blob/HEAD/src/core/util.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":"e135919e9b27c8de","code_sha256_prefix":"e135919e9b27c8de","mcp_get_code":{"code_sha256":"e135919e9b27c8de"}}],"record_sha256":"8c5832cbdd9abf07b78725b0d4c4365ba7c2e11aa861e92d4df0a546efa302ab","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}