Pradeep Ravikumar, Biswajit Paria, Chih-Kuan Yeh, Ian Yen, Ning Xu, Barnabás Póczos, † Carnegie, Moffett Ai
1 of 3 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; 1 failure of our instrument; 2 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/2004.05665.json · badge: /api/ran/2004.05665.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 |
|---|---|---|
| biswajitsc/sparse-embed | canonical (classifier label) classifier basis: classifier_2025 |
1 ran · 2 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| compute_recall | Ran ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT) |
biswajitsc/sparse-embed/evaluate_mfacenet_reranking.py pointer only (licence: NONE) · get_code("4b4213b3b4b974ad") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, biswajitsc/sparse-embed 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. |
| get_recall_k | Not yet run unverified (harvested, no recorded run) |
biswajitsc/sparse-embed/evaluate_mfacenet_reranking.py pointer only (licence: NONE) · get_code("360e7dbaff4e1e33") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, biswajitsc/sparse-embed 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. |
| get_top_k_idx | Not yet run unverified (harvested, no recorded run) |
biswajitsc/sparse-embed/evaluate_mfacenet_reranking.py pointer only (licence: NONE) · get_code("ce8ea708bd49418c") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, biswajitsc/sparse-embed 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 3 samples lifted from this paper's linked repositories, 3 carry a function identity and 0 do not. Of the 3 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 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.
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.
Deep representation learning has become one of the most widely adopted approaches for visual search, recommendation, and identification. Retrieval of such representations from a large database is however computationally challenging. Approximate methods based on learning compact representations, have been widely explored for this problem, such as locality sensitive hashing, product quantization, and PCA. In this work, in contrast to learning compact representations, we propose to learn high dimensional and sparse representations that have similar representational capacity as dense embeddings while being more efficient due to sparse matrix multiplication operations which can be much faster than dense multiplication. Following the key insight that the number of operations decreases quadratically with the sparsity of embeddings provided the non-zero entries are distributed uniformly across dimensions, we propose a novel approach to learn such distributed sparse embeddings via the use of a carefully constructed regularization function that directly minimizes a continuous relaxation of the number of floating-point operations (FLOPs) incurred during retrieval. Our experiments show that our approach is competitive to the other baselines and yields a similar or better speed-vs-accuracy tradeoff on practical datasets 1 .
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2004.05665")
get_code_for_paper("2004.05665")
have("2004.05665")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2004.05665.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2004.05665)
Connect an agent — have() is free.