Christopher Musco, Majid Daliri
7 of 8 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (0 of them constructed an object rather than computing a result; 0 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 7 failures of our instrument; 1 no recorded run), measured 2026-11-22; repository links from the Papers with Code archive attributed under CC BY-SA, no affiliation; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.
"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/2408.07978.json · badge: /api/ran/2408.07978.svg
Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.
| Repository | Role | Ran |
|---|---|---|
| majid-daliri/disd | canonical (classifier label) classifier basis: classifier_2025 |
5 ran · 1 no recorded run |
| majid-daliri/DISD | canonical (classifier label) classifier basis: census |
2 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| d_tv | Ran ran; our contract draft was wrong, not the code |
majid-daliri/disd/plot_coupling_bounds.py pointer only (licence: NONE) · get_code("f911f9bd006825c6") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, majid-daliri/disd when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded. |
| d_tv | Ran ran; our contract draft was wrong, not the code |
majid-daliri/DISD/plot_coupling_bounds.py pointer only (licence: NONE) · get_code("291c879b8fd6bbe7") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, majid-daliri/DISD when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded. |
| gumbel_simulation | Ran ran; our contract draft was wrong, not the code |
majid-daliri/disd/plot_coupling_bounds.py pointer only (licence: NONE) · get_code("c749caa1397e26a9") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, majid-daliri/disd when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded. |
| gumbel_simulation | Ran ran; our contract draft was wrong, not the code |
majid-daliri/DISD/plot_coupling_bounds.py pointer only (licence: NONE) · get_code("eeea95f2937975c2") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, majid-daliri/DISD when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded. |
| log_probs | Ran ran; our contract draft was wrong, not the code |
majid-daliri/disd/generate_model_distribution.py pointer only (licence: NONE) · get_code("b60831067ed1c850") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, majid-daliri/disd when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded. |
| sanitize_filename | Ran ran; our contract draft was wrong, not the code |
majid-daliri/disd/generate_model_distribution.py pointer only (licence: NONE) · get_code("586b27e651101c24") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, majid-daliri/disd when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded. |
| sanitize_filename | Ran ran; our contract draft was wrong, not the code |
majid-daliri/disd/plot_coupling_bounds.py pointer only (licence: NONE) · get_code("ea80be6ad6e47a5d") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, majid-daliri/disd when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded. |
| generate | Not yet run unverified (harvested, no recorded run) |
majid-daliri/disd/generate_model_distribution.py pointer only (licence: NONE) · get_code("d753515a5d74670c") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, majid-daliri/disd when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded. |
Of 8 samples lifted from this paper's linked repositories, 8 carry a function identity and 0 do not. Of the 6 distinct functions with an identity, 0 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 0 later) and 6 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).
Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.
Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-22.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Suppose Alice has a distribution P and Bob has a distribution Q. Alice wants to draw a sample a ∼ P and Bob a sample b ∼ Q such that a = b with as high of probability as possible. It is wellknown that, by sampling from an optimal coupling between the distributions, Alice and Bob can achieve Pr[a = b] = 1 -DTV(P, Q), where DTV(P, Q) is the total variation distance between P and Q. What if Alice and Bob must solve this same problem without communicating at all? Perhaps surprisingly, with access to public randomness, they can still achieve Pr[a = b] ≥ 1-D TV (P,Q) 1+D TV (P,Q) ≥ 1 -2DTV(P, Q) using a simple protocol based on the Weighted MinHash algorithm. This bound was shown to be optimal in the worst-case by Bavarian, Ghazi, Haramaty, Kamath, Rivest, and Sudan [ToC 2020]. In this work, we revisit the "communication-free coupling" problem. We provide a simpler proof of the optimality result from [Bavarian et al., 2020]. Moreover we show that, while the worst-case success probability of Weighted MinHash cannot be improved, an equally simple protocol based on Gumbel sampling offers a Pareto improvement: for every pair of distributions P and Q, Gumbel sampling achieves an equal or higher value of Pr[a = b] than Weighted MinHash. Importantly, this improvement translates to practice. We demonstrate an application of communicationfree coupling to speculative decoding, a recent method for accelerating autoregressive large language models [Leviathan, Kalman, Matias, ICML 2023]. We show that communication-free protocols can be used to contruct Drafter-Invariant Speculative Decoding schemes, which have the desirable property that their output is fixed given a fixed random seed, regardless of what drafter is used for speculation. In experiments on a language generation task, Gumbel sampling outperforms Weighted MinHash. Code is available at https://github.com/majid-daliri/DISD. Finally, we study the coupling problem in the setting where communication is bounded, rather than completely eliminated. We describe a protocol that uses just O(log(n/ϵ)) bits of communication to achieve Pr[a = b] = 1 -DTV(P, Q) -ϵ, i.e. to essentially match optimal coupling. . We thank Cheuk Ting Li for bringing several related prior works to our attention after we initially published this paper. Angel and Spinka [2021] prove the same result that we do on the Gumbel sampling method, showing that it offers a Pareto improvement over Weighted MinHash. Moreover, in addition to our work and the cited work by Bavarian et al. [2020], Li and Anantharam [2019, 2021] also prove that 1-D TV (P,Q) 1+D TV (P,Q) is optimal in the worst-case for communication-free coupling.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2408.07978")
get_code_for_paper("2408.07978")
have("2408.07978")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2408.07978.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2408.07978)
Connect an agent — have() is free.