{"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/log1mexp","entry":"log1mexp","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":11,"n_papers_ran":11,"n_papers_ran_no_instrument_failure":9,"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":10,"n_samples_ran":10,"n_samples_constructed":0,"n_samples_ran_checked":8,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":9,"n_places":11,"n_places_pointer_only":1,"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":1,"ran_draft_wrong":2,"ran_fixture":0,"ran":7,"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":"2503.20083","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"291bf36d858a5fae","code_sha256_prefix":"291bf36d858a5fae","mcp_get_code":{"code_sha256":"291bf36d858a5fae"}},{"arxiv_id":"2311.13718","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ucla-starai/countloss when it was checked","code_sha256":"fa12928489b0b771","code_sha256_prefix":"fa12928489b0b771","mcp_get_code":{"code_sha256":"fa12928489b0b771"}},{"arxiv_id":"2306.11825","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8ba0f8f3e23a2d69","code_sha256_prefix":"8ba0f8f3e23a2d69","mcp_get_code":{"code_sha256":"8ba0f8f3e23a2d69"}},{"arxiv_id":"2305.15313","arxiv_id_is_arxiv":true,"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":"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":"92c8e6cbc338e078","code_sha256_prefix":"92c8e6cbc338e078","mcp_get_code":{"code_sha256":"92c8e6cbc338e078"}},{"arxiv_id":"2212.12393","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e6d270b8b278238d","code_sha256_prefix":"e6d270b8b278238d","mcp_get_code":{"code_sha256":"e6d270b8b278238d"}},{"arxiv_id":"2206.07290","arxiv_id_is_arxiv":true,"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":"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":"b02fd556128a43d3","code_sha256_prefix":"b02fd556128a43d3","mcp_get_code":{"code_sha256":"b02fd556128a43d3"}},{"arxiv_id":"2206.00093","arxiv_id_is_arxiv":true,"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":"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":"3ab47a237d19109f","code_sha256_prefix":"3ab47a237d19109f","mcp_get_code":{"code_sha256":"3ab47a237d19109f"}},{"arxiv_id":"2205.13492","arxiv_id_is_arxiv":true,"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":"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":"4b6920b87353639b","code_sha256_prefix":"4b6920b87353639b","mcp_get_code":{"code_sha256":"4b6920b87353639b"}},{"arxiv_id":"2106.00901","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"97c36c49c9eaba81","code_sha256_prefix":"97c36c49c9eaba81","mcp_get_code":{"code_sha256":"97c36c49c9eaba81"}},{"arxiv_id":"2010.03485","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"27e10e42bf839bd7","code_sha256_prefix":"27e10e42bf839bd7","mcp_get_code":{"code_sha256":"27e10e42bf839bd7"}},{"arxiv_id":"1802.07595","arxiv_id_is_arxiv":true,"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":"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":"b02fd556128a43d3","code_sha256_prefix":"b02fd556128a43d3","mcp_get_code":{"code_sha256":"b02fd556128a43d3"}}],"record_sha256":"a06117dec41460343e1f301e6a28e4633a677f1d8a544cf9b75ec09a27868b82","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}