{"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/log1mexp","entry":"log1mexp","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":11,"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":10,"n_samples_ran":4,"n_samples_fingerprinted":4,"n_places":11,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":1,"ran_draft_wrong":2,"ran_fixture":0,"ran":1,"unverified":6},"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":"2503.20083","paper":"/paper/cross-tokenizer-distillation-via-approximate","title":"Cross-Tokenizer Distillation via Approximate Likelihood Matching","date":"2025-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bminixhofer/alm","path":"tokenkit/training/losses.py","file_url":"https://github.com/bminixhofer/alm/blob/HEAD/tokenkit/training/losses.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"291bf36d858a5fae","mcp_get_code":{"code_sha256":"291bf36d858a5fae"}},{"arxiv_id":"2311.13718","paper":"/paper/a-unified-approach-to-count-based-weakly","title":"A Unified Approach to Count-Based Weakly-Supervised Learning","date":"2023-11-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ucla-starai/countloss","path":"PU/count_loss_funcs/loss_func.py","file_url":"https://github.com/ucla-starai/countloss/blob/HEAD/PU/count_loss_funcs/loss_func.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"fa12928489b0b771","mcp_get_code":{"code_sha256":"fa12928489b0b771"}},{"arxiv_id":"2306.11825","paper":"/paper/on-compositionality-and-improved-training-of","title":"DiNADO: Norm-Disentangled Neurally-Decomposed Oracles for Controlling Language Models","date":"2023-06-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pluslabnlp/dinado","path":"modeling_nado_gpt2.py","file_url":"https://github.com/pluslabnlp/dinado/blob/HEAD/modeling_nado_gpt2.py","status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8ba0f8f3e23a2d69","mcp_get_code":{"code_sha256":"8ba0f8f3e23a2d69"}},{"arxiv_id":"2305.15313","paper":"/paper/greedy-poisson-rejection-sampling","title":"Greedy Poisson Rejection Sampling","date":null,"month_inferred_from_arxiv_id":"2023-05","title_source":"archive","repo":"gergely-flamich/greedy-poisson-rejection-sampling","path":"greedy_poisson_rejection_sampling/util.py","file_url":"https://github.com/gergely-flamich/greedy-poisson-rejection-sampling/blob/HEAD/greedy_poisson_rejection_sampling/util.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"92c8e6cbc338e078","mcp_get_code":{"code_sha256":"92c8e6cbc338e078"}},{"arxiv_id":"2212.12393","paper":null,"title":"arXiv:2212.12393","date":null,"month_inferred_from_arxiv_id":"2022-12","title_source":null,"repo":"HEmile/a-nesi","path":"anesi/util.py","file_url":"https://github.com/HEmile/a-nesi/blob/HEAD/anesi/util.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":"e6d270b8b278238d","mcp_get_code":{"code_sha256":"e6d270b8b278238d"}},{"arxiv_id":"2206.07290","paper":"/paper/differentiable-top-k-classification-learning-1","title":"Differentiable Top-k Classification Learning","date":"2022-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"felix-petersen/difftopk","path":"difftopk/smooth_topk.py","file_url":"https://github.com/felix-petersen/difftopk/blob/HEAD/difftopk/smooth_topk.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b02fd556128a43d3","mcp_get_code":{"code_sha256":"b02fd556128a43d3"}},{"arxiv_id":"2206.00093","paper":"/paper/easy-variational-inference-for-categorical","title":"Easy Variational Inference for Categorical Models via an Independent Binary Approximation","date":"2022-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tufts-ml/categorical-from-binary","path":"src/categorical_from_binary/math.py","file_url":"https://github.com/tufts-ml/categorical-from-binary/blob/HEAD/src/categorical_from_binary/math.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3ab47a237d19109f","mcp_get_code":{"code_sha256":"3ab47a237d19109f"}},{"arxiv_id":"2205.13492","paper":"/paper/sparse-graph-learning-for-spatiotemporal-time","title":"Sparse Graph Learning from Spatiotemporal Time Series","date":"2022-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"andreacini/sparse-graph-learning","path":"lib/utils/distributions.py","file_url":"https://github.com/andreacini/sparse-graph-learning/blob/HEAD/lib/utils/distributions.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4b6920b87353639b","mcp_get_code":{"code_sha256":"4b6920b87353639b"}},{"arxiv_id":"2106.00901","paper":"/paper/a-differentiable-point-process-with-its","title":"A Differentiable Point Process with Its Application to Spiking Neural Networks","date":"2021-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ibm-research-tokyo/diffsnn","path":"src/diffsnn/diffpopp/base.py","file_url":"https://github.com/ibm-research-tokyo/diffsnn/blob/HEAD/src/diffsnn/diffpopp/base.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"97c36c49c9eaba81","mcp_get_code":{"code_sha256":"97c36c49c9eaba81"}},{"arxiv_id":"2010.03485","paper":"/paper/exact-symbolic-inference-in-probabilistic","title":"SPPL: Probabilistic Programming with Fast Exact Symbolic Inference","date":"2020-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"probcomp/sppl","path":"src/math_util.py","file_url":"https://github.com/probcomp/sppl/blob/HEAD/src/math_util.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":"27e10e42bf839bd7","mcp_get_code":{"code_sha256":"27e10e42bf839bd7"}},{"arxiv_id":"1802.07595","paper":"/paper/smooth-loss-functions-for-deep-top-k","title":"Smooth Loss Functions for Deep Top-k Classification","date":"2018-02-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"oval-group/smooth-topk","path":"topk/logarithm.py","file_url":"https://github.com/oval-group/smooth-topk/blob/HEAD/topk/logarithm.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b02fd556128a43d3","mcp_get_code":{"code_sha256":"b02fd556128a43d3"}}]}