On the public citation graph

Lines in Higgledy-Piggledy Arrangement

0 signed · 21 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/s10623-014-9941-9openalex-snapshot
Search problems in vector spaces

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/jcd.21934openalex-snapshot
Geometric dual and sum‐rank minimal codes
inferred← citeshttps://doi.org/10.1007/s00493-026-00202-5openalex-snapshot
Explicit Constructions of Optimal Blocking Sets and Minimal Codes
inferred← citeshttps://doi.org/10.1007/s10623-016-0189-4openalex-snapshot
Higgledy-piggledy subspaces and uniform subspace designs
inferred← citeshttps://doi.org/10.1007/s10623-025-01628-6openalex-snapshot
The geometry of covering codes in the sum–rank metric
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113603openalex-snapshot
A higgledy-piggledy set of planes based on the ABB-representation of linear sets
inferred← citeshttps://doi.org/10.1016/j.exco.2022.100097openalex-snapshot
All minimal [9,4]2 -codes are hyperbolic quadrics
inferred← citeshttps://doi.org/10.1016/j.ffa.2020.101723openalex-snapshot
Resolving sets for higher dimensional projective spaces
inferred← citeshttps://doi.org/10.1016/j.jcta.2022.105658openalex-snapshot
Linear cutting blocking sets and minimal codes in the rank metric
inferred← citeshttps://doi.org/10.1016/j.jcta.2025.106023openalex-snapshot
The geometry of intersecting codes and applications to additive combinatorics and factorization theory
inferred← citeshttps://doi.org/10.1090/tran/9205openalex-snapshot
Strong blocking sets and minimal codes from expander graphs
inferred← citeshttps://doi.org/10.1109/tit.2021.3070377openalex-snapshot
Full Characterization of Minimal Linear Codes as Cutting Blocking Sets
inferred← citeshttps://doi.org/10.1109/tit.2021.3123730openalex-snapshot
Short Minimal Codes and Covering Codes via Strong Blocking Sets in Projective Spaces
inferred← citeshttps://doi.org/10.1112/jlms.12938openalex-snapshot
Blocking sets, minimal codes and trifferent codes
inferred← citeshttps://doi.org/10.1137/21m1391493openalex-snapshot
Three Combinatorial Perspectives on Minimal Codes
inferred← citeshttps://doi.org/10.1137/21m145032xopenalex-snapshot
Small Strong Blocking Sets by Concatenation
inferred← citeshttps://doi.org/10.1515/forum-2020-0338openalex-snapshot
On cutting blocking sets and their codes
inferred← citeshttps://doi.org/10.26493/1855-3974.2125.7b0openalex-snapshot
On resolving sets in the point-line incidence graph of PG(n, q)
inferred← citeshttps://doi.org/10.37236/10736openalex-snapshot
Higgledy-Piggledy Sets in Projective Spaces of Small Dimension
inferred← citeshttps://doi.org/10.37236/12046openalex-snapshot
Outer Strong Blocking Sets
inferred← citeshttps://doi.org/10.5817/cz.muni.eurocomb23-003openalex-snapshot
Expander graphs, strong blocking sets and minimal codes
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.