A Verbatim-Grounded, Field-Neutral Tag Layer for Cross-Disciplinary Reading of Academic Literature: A Proof of Format

Shir Sivroni

Department of Mathematics and Computer Science, The Open University of Israel · shirsivroni@gmail.com · Preprint, August 2026 · v21, the definition-scoring revision

How to read this. Every long paragraph and every long numbered point has been replaced by one sentence saying what it argues. Those sentences carry a read the paragraph tag on the right — click one to open the text behind it, and click again to fold it back. Blocks with no tag are already short and are shown in full. The figures and their legends are always shown. Nothing is omitted: the whole paper is here, one click deep. Press Ctrl+E to open everything.
Download: summary PDF, 14 pp · full PDF, 23 pp · read the whole thing on one page

In four sentences. Researchers cannot find the work in other fields that studies the same thing as their own, because each field calls it by a different name. This paper describes a tag layer that gives every paper the same small set of tags and forces each tag to quote the exact sentence it came from — then reports honestly what that does and does not buy: free-text names for a phenomenon almost never collide across fields, while a controlled vocabulary of statistical terms does create real cross-field joins. The same instrument, read in reverse, can point at regions of concept space that the literature occupies but has never named. The same machinery, pointed at a contested concept instead of a corpus, scores rival published definitions of art and of game against cases the literature itself decides — and finds that the control which calibrates one concept is not a control for the other.

A note on two numbers. The audited proof-of-format below is the frozen 126-paper corpus; the working corpus has since grown to 165 tagged papers across 39 disciplines, including a digital-humanities batch added as a deliberate stress test (§9.1). A further 27 records are held as citations only — works the priming manuscript cites, whose text we do not hold, so they carry metadata and no tags, and they are counted in no figure here. Audited figures are not restated for the larger set, because they would have to be re-audited to be true.

1. Motivation
Researchers cannot find the work in other fields that studies the same thing as their own, because each field calls it by a different name.
section

1. Motivation

2. The idea
Describe every paper with the same small set of tags, and require each tag to quote the sentence it came from.
section

2. The idea

2.1 The data structure: one property graph over a grounded tag layer
One graph: papers and tags as nodes, each tag-to-paper edge carrying the exact words that justify it.
section

2.1 The data structure: one property graph over a grounded tag layer

LAYER 3 · PROPERTY GRAPH — the queryable structure nodes: Paper · Tag · Discipline · Canonical phenomenon implemented: IN · HAS_CLAIM · HAS_PHENOMENON · HAS_STATISTIC proposed, not implemented: ALIAS_OF · CONGRUENT_TO · projected links index + canonicalise LAYER 2 · GROUNDED TAG LAYER — field-neutral facets claim-type phenomenon statistic feature: A · S · M replication-status every non-trivial tag stores the exact verbatim sentence that licenses it extract + verbatim-ground LAYER 1 · CORPUS — raw natural-language text 126 papers · 39 disciplines · 1866–2023 · each stored as one record
Fig. 1. The data structure: one property graph in three layers. A corpus of raw text (Layer 1) carries a grounded tag layer (Layer 2), which is read as a graph of nodes and edges (Layer 3) over which verification becomes a query. Full specification in the project's GRAPH_SCHEMA.
① one paper = one record  (document store — a dict)
{
  "id": "newman2003-complex-networks",
  "discipline": "network-science", "year": 2003, "license": "arxiv-open",
  "title": "The Structure and Function of Complex Networks",
  "phenomenon": "complex networks (shared structure of real networks)",
  "content_tags": {
    "statistics": [{ "term":"correlation", "symbol":"r",
        "evidence":"For the data of Table III we find r = 0.621." }],
    "key_terms":  ["networks","degree","clustering","vertices","edges"] } }
② inverted index  (facet → sorted postings) — expected O(1) key lookup
"statistic:correlation"      → [ 7, 12, 18, ... ] (39 papers · 22 disciplines)
"claim:method"               → [ 1, 3, 6, ... ]                         (55 papers)
"discipline:network-science" → [ 83, 84 ]                               (2 papers)
ALL = intersect; ANY = union; complement = universe difference
merge cost = Θ(Σ|Pi|) + output; worst case Θ(N)
③ implemented adjacency export  (node → typed neighbours)
paper:newman2003 → [ IN:discipline:network-science,
                         HAS_STATISTIC:statistic:correlation, ... ]
not exported: ALIAS_OF · CONGRUENT_TO · projected links
Fig. 2. Implemented data structures. Each paper is one canonical JSON record. The build derives sorted postings and lazy metadata shards for search, plus a typed adjacency export. Dictionary lookup is expected O(1), but merging postings depends on their lengths and can be Θ(N); no corpus-size-independent complexity is claimed.
3. Corpus and method
A curated corpus spanning dozens of disciplines, tagged to one schema — with the grounding of each tag recorded as an explicit, auditable state rather than assumed.
section

3. Corpus and method

Colour-tagged reading view of a paper
Fig. 3. The colour-tagged reading view (Newman 2003, an open-access paper): a colour legend plus the paper's own text with inline, type-labelled tags (persName, date, title, key-term, statistic…), each auditable against its sentence. Click the figure for the live page: shir-openu.github.io/meta-tagging-showcase/papers/newman2003….
4. Results
The honest null result: free-text phenomenon names almost never collide across fields, so as join keys they fail.
section

4. Results

116 papers across 38 disciplines were fully faceted.

Table — claim-type, replication-status, grounded relations · 2 rows
claim-typemethod 55 · existence 42 · mechanism 9 · critique 8 · prediction 2 · null-result 0
replication-statusuntested 113 · replicated 3 · (failed/contested 0 — see §8)
grounded relations127 claim-relations, 87 limitations — all substring-verified
5. Audited statistical terms as cross-field join keys
What does work as a cross-field join key is statistical vocabulary: audited terms recur in 37 of 39 disciplines, joining papers that share nothing else.
section

5. Audited statistical terms as cross-field join keys

Across the full accepted set, at least one statistical key occurs in 100 of 126 papers and 37 of 39 disciplines. The strict exact-local-body subset contains 272 assignments in 77 papers across 32 disciplines. The recalculated term-level results are:

Table — join key, accepted: papers / disciplines, exact local body: papers / disciplines · 6 rows
join keyaccepted: papers / disciplinesexact local body: papers / disciplines
mean59 / 3139 / 25
standard-deviation34 / 2423 / 15
correlation39 / 2223 / 15
regression33 / 1924 / 16
statistical-significance27 / 1918 / 13
p-value24 / 1710 / 9
Priming cross-field cluster in the interactive graph viewer
Fig. 4. The priming cross-field cluster in the interactive graph viewer (real data): one canonical priming (A·S·M) node at the centre links to 16 papers, coloured by discipline, wired out to their eight fields (neuroscience, cognitive and social psychology, economics, behavioral economics, marketing, education, linguistics) — though each field names it differently (interference, automaticity, nudge, money-priming, syntactic priming). 25 nodes · 32 edges. Click the figure for the live interactive graph: shir-openu.github.io/meta-tagging-showcase/GRAPH.html (opens locally as GRAPH.html).

We are careful about the claim: a shared method vocabulary is a weaker signal than a shared substantive finding — it marks where a connection may lie, consistent with the compass framing (§6), not a discovery.

5.1 A grounded test: does each field's priming actually carry the three features?
Tested on 16 priming papers across eight disciplines: association and modulation hold in all 16, and only secondariness fails — twice, and informatively.
section

5.1 A grounded test: does each field's priming actually carry the three features?

A · association 16/16 S · secondariness 14/16 M · modulation 16/16 2 secondariness exceptions (education · neuroscience) = boundary findings, not errors.
Fig. 5. Grounded A·S·M verification of the 16-paper priming cluster. Association and modulation are read from the structural slots (16/16); secondariness is a textual test that can fail (14/16). Live interactive version (per-paper evidence, drill-down): shir-openu.github.io/meta-tagging-showcase/PRIMING_SCALE.html.
Priming A·S·M verification at scale (illustrative projection)
Fig. 6. The same A·S·M verification as an illustrative projection to a thousands-paper corpus (24 fields): one canonical priming node wired to its three features, each field turquoise if all three hold or red-wine if one is under-met (an exception to investigate). The eight bold fields carry the real audit numbers; the rest illustrate what a large run would surface — not measured data. Click the figure for the live interactive version: shir-openu.github.io/meta-tagging-showcase/PRIMING_SCALE.html.
5.2 Querying the layer: an implemented static, client-side search
A search over the tag layer that runs in the browser against static files, with no application server and no query-time database behind it.
section

5.2 Querying the layer: an implemented static, client-side search

The static client-side search interface
Fig. 7. The static, client-side search. The reader intersects field-neutral tags — statistics join-keys (grouped), claim-type, discipline, free text — with an ALL/ANY switch; results are papers from any field, each with its matched tags, key terms, and a link to the colour-tagged evidence. No application server; static HTTP hosting is required. Click the figure for the live search: shir-openu.github.io/meta-tagging-showcase/SEARCH.html.
5.3 The negative space: locating terms the literature lacks
The same instrument that fails to find shared names can locate regions the literature occupies but never named — demonstrated for short-term implicit memory.
section

5.3 The negative space: locating terms the literature lacks

Table — Term, Works, Status · 13 rows
TermWorksStatus
short-term memory155,238established axis
working memory112,772established axis
implicit memory4,083established axis
candidate unifying term for the cell
short-term implicit memory12≈52 works in total
implicit short-term memory21
implicit working memory19
the same cell, under local names
repetition priming1,876≈4,350 works in total
masked priming1,478
perceptual priming457
echoic memory367
short-term priming172
6. Framing: a compass, not an answer
This is a compass, not an answer: it points at where to look, and does not claim to settle what is found there.
section

6. Framing: a compass, not an answer

6.1 Why a grounded layer, rather than reading on demand
Because reading on demand does not scale, and an ungrounded summary cannot be checked by the person who did not do the reading.
section

6.1 Why a grounded layer, rather than reading on demand

7. A second component: scoring rival definitions of a concept
The same discipline turned on a contested concept: rival published definitions scored as classifiers over cases the literature itself decides — run on two concepts, because the control that calibrates one of them fails on the other.
section

7. A second component: scoring rival definitions of a concept

8. Limitations
Stated plainly: a curated corpus, single-coder tagging in places, a measured κ of 0.767 on the statistical layer only, and facets that are not all grounded.
section

8. Limitations

9. Relation to prior work
TEI, Web Annotation, nanopublications and distant reading each do part of this; what is new is requiring all of it at once.
section

9. Relation to prior work

9.1 The same operation across languages and across disciplines
A gazetteer reconciles a place name across languages; this layer reconciles a sentence across disciplines — the same operation, so the same standards fit.
section

9.1 The same operation across languages and across disciplines

10. Availability
Everything is public and rebuildable: corpus, code, vocabulary, annotations, and a rights manifest saying what may be redistributed and what may not.
section

10. Availability

References

  1. F. Moretti, Distant Reading, 2013 — the "distant reading" framing this work adapts as "far reading."
  2. W3C, Web Annotation Data Model, Recommendation, 2017 — stand-off annotation with explicit targets.
  3. P. Groth, A. Gibson, J. Velterop, "The anatomy of a nanopublication," 2010 — minimal machine-readable assertions.
  4. S. Rusinek, T. Sagi, M. Zaga, E. Lev, M. Lavee, "MEHDIE: The Middle East Heritage Data Integration Endeavor," Digital Humanities 2023, Graz (CC BY 4.0); extended as T. Sagi et al., Digital Scholarship in the Humanities 41(Suppl. 1), i238–i246, 2026, doi:10.1093/llc/fqaf111 — reconciliation across languages rather than disciplines.
  5. S. Isaj, E. Zimányi, T. B. Pedersen, "Multi-Source Spatial Entity Linkage," SSDBM, 2019, doi:10.1145/3340964.3340979 — entity linkage scored against labelled data, the contrast case for §9.1.
  6. W3C, SKOS Simple Knowledge Organization System Reference, Recommendation, 2009 — the concept-scheme model used for the vocabulary export.
  7. O. Münz-Manor, I. Marienberg-Milikowsky, "Visualization of Categorization: How to See the Wood and the Trees," Digital Humanities Quarterly 17(3), 2023 — a tagset that emerged from the analysis rather than preceding it.
  8. Y. Dekel, I. Marienberg-Milikowsky, "From Distant to Public Reading. The (Hebrew) Novel in the Eyes of Many," magazén 2(2), 225–252, 2021, doi:10.30687/mag/2724-3923/2021/01/003 — distant reading without the authoritative history.

Preprint · v21, the definition-scoring revision · August 2026 · licensed CC BY 4.0 · DOI: 10.5281/zenodo.21432188 (the deposited v19 record — v20 is deposited separately) · cite via CITATION.cff in the project repository. The v8 audit re-audited all 519 legacy statistical assignments, recalculated §5, separated semantic acceptance from exact-local-body grounding, implemented a sharded sorted-postings search and reproducible build pipeline, exported only supported graph relations, and corrected the architecture and complexity claims. v9 adds a per-paper redistribution-rights manifest, states the audit method (rule-based with LLM-assisted adjudication) and the absence of an inter-rater study, and reconciles all release metadata. Earlier versions introduced the priming A·S·M analysis and the statistical join-key experiment. v11 reconciles the controlled vocabularies to Wikidata, publishes the layer as SKOS and W3C Web Annotation (§9.1), re-verifies 99.4% of verbatim spans by anchoring them as TextQuoteSelectors, adds nine digital-humanities papers as a facet stress test, adds a grounded study-location facet, and reduces the §5.3 negative-space claim to what the papers' own words support. v17 tags five papers from the digital-humanities summer school this work comes out of, and records a methodological disagreement with one of them rather than smoothing it over: their tagset emerged from the analysis, ours is frozen in advance, and §9.1 states what each choice buys and costs. v19 replaces every paragraph with one sentence written to say what that paragraph argues, and puts the paragraph itself one click behind it; the figures and their legends are always shown, tables open on request, and the summaries are kept in a separate file so that a paragraph whose text changes loses its summary rather than keeping a stale one. v20 adds §7, the definition-scoring component, and reports what running it on a second concept exposed: a calibration control does not transfer between concepts, abstention has to be scored as a position rather than a gap, and a corpus can grow larger and less discriminating at once. It also replaces the estimated figure for judge-to-judge drift with a measured one — two independent scorings of the same board agree on 0.911 of 392 judgements (§8).