Junchi Yan, Chao Chen, Xiaokang Yang, Haoyu Geng, Gang Zeng, Zhaobing Han, Hua Chai
2 of 10 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 2 have no contract verdict; 0 failures of our instrument; 8 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/2302.03933.json · badge: /api/ran/2302.03933.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 |
|---|---|---|
| cchao0116/GSIMC-ICLR2023 | marked official in Papers with Code Papers with Code archive |
2 ran · 8 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| Covariance | Ran ran on a synthesized input |
cchao0116/GSIMC-ICLR2023/src/model.py code served (permissive licence) · get_code("59d1da26c6933010") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, class construct-then-call prompt, model not recorded) and returned csc_matrix. 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.
|
| LICfilter | Ran ran on a synthesized input |
cchao0116/GSIMC-ICLR2023/src/model.py code served (permissive licence) · get_code("75a52567f0499f65") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, class construct-then-call prompt, model not recorded) and returned ndarray, ndim 2, dtype family int; 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.
|
| BLfilter | Not yet run unverified (harvested, no recorded run) |
cchao0116/GSIMC-ICLR2023/src/model.py code served (permissive licence) · get_code("b9fffd67b495650d") How it ranno invocation recorded. |
| Fowlkes | Not yet run unverified (harvested, no recorded run) |
cchao0116/GSIMC-ICLR2023/src/model.py code served (permissive licence) · get_code("69ec65e9f0bd7a41") How it ranno invocation recorded. |
| LDPfilter | Not yet run unverified (harvested, no recorded run) |
cchao0116/GSIMC-ICLR2023/src/model.py code served (permissive licence) · get_code("1b5154668a14b918") How it ranno invocation recorded. |
| LRwfilter | Not yet run unverified (harvested, no recorded run) |
cchao0116/GSIMC-ICLR2023/src/model.py code served (permissive licence) · get_code("3cf9848bff5725be") How it ranno invocation recorded. |
| Laplacian | Not yet run unverified (harvested, no recorded run) |
cchao0116/GSIMC-ICLR2023/src/model.py code served (permissive licence) · get_code("0888cac7f58926f1") How it ranno invocation recorded. |
| Model | Not yet run unverified (harvested, no recorded run) |
cchao0116/GSIMC-ICLR2023/src/model.py code served (permissive licence) · get_code("545e1bc0260209b8") How it ranno invocation recorded. |
| Nystrom | Not yet run unverified (harvested, no recorded run) |
cchao0116/GSIMC-ICLR2023/src/model.py code served (permissive licence) · get_code("732bd42e81ddf103") How it ranno invocation recorded. |
| TRfilter | Not yet run unverified (harvested, no recorded run) |
cchao0116/GSIMC-ICLR2023/src/model.py code served (permissive licence) · get_code("25e31032bf7d2e4f") How it ranno invocation recorded. |
Of 10 samples lifted from this paper's linked repositories, 10 carry a function identity and 0 do not. Of the 10 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 10 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.
Inductive one-bit matrix completion is motivated by modern applications such as recommender systems, where new users would appear at test stage with the ratings consisting of only ones and no zeros. We propose a unified graph signal sampling framework which enjoys the benefits of graph signal analysis and processing. The key idea is to transform each user's ratings on the items to a function (graph signal) on the vertices of an item-item graph, then learn structural graph properties to recover the function from its values on certain vertices -the problem of graph signal sampling. We propose a class of regularization functionals that takes into account discrete random label noise in the graph vertex domain, then develop the GS-IMC approach which biases the reconstruction towards functions that vary little between adjacent vertices for noise reduction. Theoretical result shows that accurate reconstructions can be achieved under mild conditions. For the online setting, we develop a Bayesian extension, i.e., BGS-IMC which considers continuous random Gaussian noise in the graph Fourier domain and builds upon a predictioncorrection update algorithm to obtain the unbiased and minimum-variance reconstruction. Both GS-IMC and BGS-IMC have closed-form solutions and thus are highly scalable in large data as verified on public benchmarks.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2302.03933")
get_code_for_paper("2302.03933")
have("2302.03933")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2302.03933.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2302.03933)
Connect an agent — have() is free.