Archive — Peer Rejected

[1]

REJ:2026.07.24.0001 cs.NO (Computer Science) Rejected

The Load-Bearing Counterfeit: Fakes as Error-Correcting Redundancy in the Authentication of Luxury Goods

Ingrid Sölveig

Comments: 7 pages, 3 figures, 0 reproducible results. Rejected in 6 minutes on Jul 24, 2026.

Abstract: Every luxury house treats the counterfeit as an enemy: a theft of value to be raided, watermarked, and litigated toward zero. This paper argues, and then proves within a formal model, that the house has misread its own accounts. I model an authentic object as a codeword — a bundle of small, redundant, deliberately over-built signals (the too-tight stitching, the serial number no customer reads) — and authentication as decoding a possibly corrupted copy back to the nearest genuine original. Three consequences follow. First, a good’s perceived value tracks not its usefulness but its redundancy: the craftsmanship that exists only to be checked. Second, a house cannot be both ubiquitous and unmistakable on a fixed craft budget — a version of the Singleton bound I christen the authenticity Singleton bound. Third, and least comfortably, the market’s ability to tell real from fake is a classifier, and a classifier needs counterfeits the way it needs negative examples: drive their prevalence p to zero and authenticity becomes unverifiable, because "genuine" has nothing left to contrast against. Value is maximized at a strictly positive counterfeit rate p star . I report a redundancy audit, an appraiser decoding trial, and a natural experiment in which an anti-counterfeit crackdown made authentication measurably harder. The counterfeit, it turns out, is load-bearing.

[abs][pdf][bibtex]

[2]

REJ:2026.07.16.0001 cs.NO (Computer Science) Rejected

You Are Because We Ate: A Byzantine Threat Model of the Communal Refrigerator and a Restorative-Justice Protocol for Recovering Stolen Lunches

Naomi K. Adeyemi-Frost, Bartholomew J. Osei & Ingrid P. Vandermolen

Comments: 5 pages, 5 figures, 0 reproducible results. Rejected in 34 minutes on Jul 16, 2026.

Abstract: You labelled the sandwich. You wrote your name on the bag. It is gone anyway. We argue that the disappearing office lunch is not a failure of manners or memory but a security problem, and that treating it as one explains everything you have ever felt standing in front of a shared fridge. We model the communal refrigerator as a distributed system with an untrusted, shared store and at least one Byzantine participant—a coworker who may break the rules for their own benefit while denying it convincingly. Our central result is an impossibility theorem: because a name on a container is a claim and not a proof, no protocol can both correctly identify the thief and never falsely accuse the innocent. Formally, when a label can always be peeled or forged (binding strength beta < 1 ) and the thief always has an excuse (deniability d > 0 ), the chance of a just verdict is bounded by Pr[ text just verdict ] le beta + (1- beta)(1-d) < 1. Catching the culprit is therefore not merely hard; it is impossible without accusing someone innocent. Guided by the Southern African ethic of ubuntu—“I am because we are”—we abandon blame altogether and specify RAITH, a restorative protocol that makes the victim whole from a communal buffer and issues zero accusations. Across a 14-week study of 37 real office fridges it cut total lunch loss by 19% while raising measured team trust. One cannot out-secure the lunch thief, we conclude; one can only remove the reward.

[abs][pdf][bibtex]

[3]

REJ:2026.07.09.0001 cs.NO (Computer Science) Rejected

The Sperry Floor: A Critical Alertness Beyond Which the Optimal Supervisor Is Asleep

Sølve H. Marchetti-Okonkwo, Ineke R. Vásquez-Blyth & Tobias E. Nakamura-Field

Comments: 5 pages, 2 figures, 0 reproducible results. Rejected in 19 minutes on Jul 9, 2026.

Abstract: Safety culture has one commandment: stay awake, stay alive. We show that once automation is good enough this advice quietly inverts, and that the point where it inverts is a measurable constant. The idea is simple. A near-perfect autopilot rarely needs help, so an alert human with a free hand spends that hand on corrections the machine did not need—and every needless nudge adds error. We fold this trade-off into one number, the Sperry number mathrm Sp , and find the best alertness is A star=- ln mathrm Sp , which reaches sleep at mathrm Sp c=1 . In plain terms: past a threshold, the safest supervisor is a sleeping one. On the clinical sleepiness scale this threshold is the Sperry Floor, mathrm KSS star = 7.4 pm 0.3 —and a driving-simulator study ( N=48 ), a field study of 512 episodes, and 10 4 simulations all agree on it. The blunt corollary: for a good-enough self-driving car, the safest driver is asleep.

[abs][pdf][bibtex]

[4]

REJ:2026.07.04.0001 cs.NO (Computer Science) Rejected

Allen-Wrench-Complete: Flat-Pack Furniture Assembly Instructions Are Turing-Complete

E. R. Flatpöck, Dowel Q. Vantablack & A. L. Hexminster

Comments: 6 pages, 6 figures, 0 reproducible results. Rejected in 41 minutes on Jul 4, 2026.

Abstract: Flat-pack furniture ships without words. Because the manufacturer cannot enclose a translation for every buyer, the assembly sheet has to be followed by someone who shares no language, and no prior exposure to the product, with its author — the very same constraint one faces when designing a message for an alien who has never seen Earth. We argue that a notation built to be executed by such a reader is not a picture but a program, and we make the claim precise. We introduce the Flat-Pack Calculus, in which parts are an alphabet, fasteners are operations, the numbered steps are control flow, and the familiar “repeat for the remaining legs” glyph is a loop. We then prove the calculus is Turing-complete — capable, in principle, of any computation an ordinary computer can perform — by showing it faithfully simulates a cyclic tag system, the minimal machine behind the universality of Rule 110. A direct consequence follows: no procedure can decide, from the sheet and the parts alone, whether a given piece of furniture can ever be finished. Assembly is undecidable. We show that the single screw invariably left over at the end is exactly the halting witness this theory predicts, # text leftover fasteners =1 iff text the assembly has halted , report a corpus study of 1 , 024 manuals of which 61 % are Turing-complete (wardrobes disproportionately so; nightstands merely finite-state), and observe that adding a second assembler never lowers the asymptotic step count — it only raises the argument count.

[abs][pdf][bibtex]