Amin Karbasi, Mike Gartrell, Insu Han, Elvis Dohmatob, Jennifer Gillenwater
3 of 4 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; 3 failures of our instrument; 1 no recorded run), measured 2026-11-21; 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/2201.08417.json · badge: /api/ran/2201.08417.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 |
|---|---|---|
| insuhan/nonsymmetric-dpp-sampling | canonical (classifier label) classifier basis: classifier_2025 |
3 ran · 0 no recorded run |
| cgartrel/scalable-nonsymmetric-DPPs | community Papers with Code archive |
0 ran · 1 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| rejection_sampling_ndpp | Ran ran; our contract draft was wrong, not the code |
insuhan/nonsymmetric-dpp-sampling/sampling/rejection_sampling.py code served (permissive licence) · get_code("bc29204cbb1f28dd") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1) and returned tuple. The image it ran in was not recorded. If your copy returns the same type on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| tree_sampling_dpp | Ran ran; our contract draft was wrong, not the code |
insuhan/nonsymmetric-dpp-sampling/sampling/rejection_sampling.py code served (permissive licence) · get_code("7ef05ef3700151b8") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned list, ndim 1, dtype family float; no output shape is stated. The image it ran in was not recorded. If your copy returns the same type and ndim on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| update_query_matrix | Ran ran; our contract draft was wrong, not the code |
insuhan/nonsymmetric-dpp-sampling/sampling/rejection_sampling.py code served (permissive licence) · get_code("b2d09fcf4adc9005") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned Tensor, ndim 2, dtype family float, shape (4, 4) as a later run recorded it. The image it ran in was not recorded. If your copy returns the same type, ndim and shape on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| NonSymmetricDPPSampler | Not yet run unverified (harvested, no recorded run) |
cgartrel/scalable-nonsymmetric-DPPs/src/nonsymmetric_dpp_sampling.py code served (permissive licence) · get_code("e516066bb6b946e8") How it ranno invocation recorded. |
Of 4 samples lifted from this paper's linked repositories, 4 carry a function identity and 0 do not. Of the 4 distinct functions with an identity, 1 are also present in other papers whose code we hold (1 with at least one paper dated earlier, 0 the same month, 0 later) and 3 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.
| Function | Also present in | Earliest-dated | Others named |
|---|---|---|---|
| NonSymmetricDPPSampler brick of this paper's assembly: entry |
1 other paper 1 dated earlier |
2006.09862 (2020-06) Scalable Learning and MAP Inference for Nonsymmetric Determinantal Point Processes |
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-21.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
A determinantal point process (DPP) on a collection of M items is a model, parameterized by a symmetric kernel matrix, that assigns a probability to every subset of those items. Recent work shows that removing the kernel symmetry constraint, yielding nonsymmetric DPPs (NDPPs), can lead to significant predictive performance gains for machine learning applications. However, existing work leaves open the question of scalable NDPP sampling. There is only one known DPP sampling algorithm, based on Cholesky decomposition, that can directly apply to NDPPs as well. Unfortunately, its runtime is cubic in M , and thus does not scale to large item collections. In this work, we first note that this algorithm can be transformed into a linear-time one for kernels with low-rank structure. Furthermore, we develop a scalable sublinear-time rejection sampling algorithm by constructing a novel proposal distribution. Additionally, we show that imposing certain structural constraints on the NDPP kernel enables us to bound the rejection rate in a way that depends only on the kernel rank. In our experiments we compare the speed of all of these samplers for a variety of real-world tasks.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2201.08417")
get_code_for_paper("2201.08417")
have("2201.08417")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2201.08417.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2201.08417)
Connect an agent — have() is free.