Topics — What a work is about. Nucleation holds whatever reading the owner files here, whether or not an Anthology of the SOTA topic could also hold it; instruction for ML practice belongs to the anthology (ADR-048). The words are seeded from the clusters the reading-time triage of 2026-09-25 found, and grow by decision.
Information retrieval — finding what is relevant to a need — document and query representation, relevance and aboutness, ranking and feedback, and the geometric, probabilistic and logical models of retrieval.
7 of 547 CLAIM documents. Back to the full index.
| # | Title | Summary | Status |
|---|---|---|---|
| CLAIM-292 | Retrieval that depends on current belief is not a bias in itself: adaptive search can be rational when inference accounts for how the evidence was selected, and calling a search biased needs a standard outside the search | Granted against CLAIM-301, as A21 insisted (“That counter is essential. Without it, we’d be using ‘anchoring’ as a blanket criticism of adaptive search.”), and said again at A20 §5, A21 §4 and A23 V.E. Sequential experimental design chooses its next observation by its current belief and is not thereby biased. | Active |
| CLAIM-298 v2 | A frame can change a judgement by changing which of an interpreter’s stored distinctions are reachable, without supplying any evidence about what is being judged | A20’s proposed claim, after the owner tied addressing to anchoring at U20, and A19’s “addressing conditions”. Its psychological form is the selective-accessibility account of anchoring, and the readings of 2026-10-15 weaken it: Strack and Mussweiler (1997, read) infer accessibility from moderations and latencies without measuring it, and their model lets the same retrieved knowledge push a judgement either way; Harris et al. (2019, read) find the most direct measure of the accessibility step does not replicate and cannot detect priming at all. The retrieval step is inferred, not shown. The mechanism the record holds, attention as sparse distributed memory (LIT-269), is a model, not evidence about judges. The extension to communication in general is the record’s and is not shown. | Proposed |
| CLAIM-301 v2 | Iterative retrieval can turn a provisional interpretation into a premise: a framing selects what is encountered, what is encountered reinforces the framing, and the question being investigated drifts as well as the queries | A21’s proposed claim, from the owner’s U21 link between retrieval-mediated anchoring, agent harnesses and older information retrieval. Classical IR named query drift (LIT-1079). An agent that rewrites its own task adds TERM-056, which A21 judged “arguably more consequential”. The exchange did this itself between A2 and A13. | Proposed |
| CLAIM-307 | Retrieval pressure and evidence are different criteria for carving a category, and they move in opposite directions with copy count: evidence that a distinction exists grows with its copies, the search a bin saves shrinks with them, so the bins a deadline forces are often the ones the data least supports | From MOM-CLM-166, which reads the owner’s LEGO parable (CASE-094) against a formalism that cited it with the sign reversed. CLAIM-154 says when a distinction is real enough to name. Its evidence grows with the number of copies. The parable says when a distinction must be built to act in time: a single brick among similar ones. Expected search falls as copies grow. The two answer different questions, “is it there?” and “can it be reached in time?”, and come apart in both directions. MOM’s table was re-run here and reproduced, and a simulation of the search agrees. | Active |
| CLAIM-310 v2 | Sorting schemes over objects with determinate properties never conflict as descriptions, since the product of any sortings refines them all; they conflict as arrangements, since a fixed number of bins realizes one partition when each item is stored once, and which costs least depends on what is searched for and on what stands out within a bin | What is directionally right in the owner’s LEGO monograph, as Mathematics of Meaning graded it. Its contextuality claim is empty: any sortings of bricks share a joint refinement (MOM-CLM-137), and the events they generate stay Boolean (MOM-ARG-047). Its intuition that builders cannot share a sorting is true of arrangements. One set of bins realizes one partition, the product may need more bins than there are, and the cheapest choice depends on what each builder searches for and on what stands out within a bin (CASE-095). The disagreement is a trade, not a failure of global truth. Sorting on one attribute also turns a search for a combination of features into a search for one feature within each bin, which Treisman and Gelade (LIT-1082, read) show is the difference between a serial scan and one found at a glance. | Active |
| CLAIM-311 | A search cut off before an exhaustive pass can establish absence when the arrangement certifies that the unsearched remainder cannot hold the item: a sorted table answers non-membership in a logarithmic number of probes, and the Threshold Algorithm stops early with its answer proved, so absence needs a certificate about the remainder, not exhaustion; similarity search in high dimension is where no such certificate exists | Filed at the owner’s request, from the database readings set against CLAIM-306’s asymmetry: presence by one find, absence “only by exhausting the collection”. Sorted order and the Threshold Algorithm each establish absence from part of the collection, because the arrangement bounds what the rest can hold. That meets CLAIM-306’s own defeat condition, and the claim is conceded: CLAIM-312 restates it. Where the arrangement gives no bound, as in similarity search in high dimension, CLAIM-306’s asymmetry stands. | Active |
| CLAIM-313 v2 | A fixed number of bins realizes one partition only when each item is stored once: with copies, overlapping partitions coexist, as hashing-based similarity search stores each item in many partitions and pays for it in space, so sortings conflict as arrangements only under a one-copy constraint, which binds bricks but not index entries | Filed at the owner’s request, from the readings on locality-sensitive hashing (Indyk and Motwani 1998; Andoni, Laarhoven, Razenshteyn and Waingarten 2017) set against CLAIM-310’s premise that “a set of k bins realizes one partition of the collection at a time”. That holds when each item is in one place. An index can hold many copies, and hashing-based similarity indexes do exactly that, trading the space of the copies against query time on an exact curve. It narrows CLAIM-310 to collections whose items cannot be copied, which includes the LEGO case; it does not touch the claim about descriptions. | Active |