phenomenon · claim-type · cross-domain-transfer · mechanism · claim-relation · replication-status · limitation — grounded in the full text| phenomenon | scale-free degree distribution in large networks— “A common property of many large networks is that the vertex connectivities follow a scale-free power-law distribution.” | |
| claim-type | mechanism— “This feature is found to be a consequence of the two generic mechanisms that networks expand continuously by the addition of new vertices, and new vertices attach preferentially to already well connected sites.” | |
| method — evidence | — “To verify that both ingredients are necessary, we investigated two variants of the model.” | |
| object of study — evidence | — “Exploring several large databases describing the topology of large networks that span as diverse fields as the www or the citation patterns in science” | |
| research question — evidence | — “A common feature of the ER and WS models is that the probability of finding a highly connected vertex (that is, a large k) decreases exponentially with k, thus vertices with large connectivity are practically absent.” | |
| contribution — evidence | — “While these and other system-specific features could modify the exponent γ, our model offers the first successful mechanism accounting for the scale-invariant nature of real networks.” | |
| transfer | from mathematics (the random graph theory of Erdos and Renyi): the Erdos-Renyi random graph as the incumbent model of complex network topology, taken up and then shown to be the wrong model because real networks grow and attach preferentially— “Traditionally, networks of complex topology have been described using the random graph theory of Erd˝os and R´enyi (ER) (7), but in the absence of data on large networks the predictions of the ER theory were rarely tested in the real world.” | transfers[0] |
| mechanism | network growth with preferential attachment (new nodes attach preferentially to already-highly-connected nodes; a rich-gets-richer process) generates the scale-free power law— “incorporate growth and preferential attachment” | mechanisms[0] |
| mechanism | growth - the network is open and gains vertices continuously, so N is not fixed— “In contrast, most real world networks are open, they form by the continuous addition of new vertices to the system, thus the… [checked against the archived source, not this rendering] | mechanisms[1] |
| mechanism | preferential attachment - a new vertex attaches with probability proportional to a vertex's existing connectivity | mechanisms[2] |
| mechanism | compounding: an early advantage in connectivity widens as the network grows, so old vertices become hubs Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | mechanisms[3] |
| contradicts | existing random-network models Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | claim_relations[0] |
| contradicts | the Erdos-Renyi random graph model and the Watts-Strogatz small-world model (refs 7 and 10) Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | claim_relations[1] |
| builds-on | Redner (11), on the power-law distribution of citation counts Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | claim_relations[2] |
| contradicts | the Erdős-Rényi random graph model (7) Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | claim_relations[3] |
| builds-on | Redner's measurement of citation counts (11) Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | claim_relations[4] |
| contradicts | the Watts-Strogatz small world model (10) Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | claim_relations[5] |
| sense | network - a genetic network, where the vertices are proteins and genes and the edges are chemical interactions Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | senses[0] |
| sense | network - the nervous system, where the vertices are nerve cells and the edges are axons Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | senses[1] |
| sense | network - a social network, where the vertices are individuals or organizations and the edges are social interactions Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | senses[2] |
| sense | network - the world wide web, where the vertices are HTML documents and the edges are links between pages Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | senses[3] |
| sense | network - a citation network, where the vertices are published papers and the edges are the references between them Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | senses[4] |
| sense | network - a collaboration graph, where the vertices are film actors and two are joined if they appeared in the same film Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | senses[5] |
| control | two VARIANTS of the model were built, each dropping one of the two ingredients — held — rules out that only one of growth and preferential attachment is doing the work - an ablation, so the scale-free degree distribution cannot be attributed to the wrong mechanism Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | controls[0] |
| differs in | the Erdos-Renyi random graph model and the Watts-Strogatz small-world model (refs 7 and 10) — the functional form of P(k): THE PROBABILITY OF FINDING A HIGHLY CONNECTED VERTEX (THAT IS, A LARGE k) DECREASES EXPONENTIALLY WITH k in the ER and WS models, against the power-law tail measured here Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | claim_relations[1] |
| differs in | the Erdős-Rényi random graph model (7) — the functional form of P(k) - exponential decay in ER, so VERTICES WITH LARGE CONNECTIVITY ARE PRACTICALLY ABSENT, against a power law in which they dominate Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | claim_relations[3] |
| differs in | the Watts-Strogatz small world model (10) — exponential against power law: IN CONTRAST, THE POWER-LAW TAIL CHARACTERIZING P(k) FOR THE STUDIED NETWORKS INDICATES THAT HIGHLY CONNECTED (LARGE k) VERTICES HAVE A LARGE CHANCE OF OCCURRING, DOMINATING THE CONNECTIVITY Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | claim_relations[5] |
| edge | genetic network —is-a→ network Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | concept_edges[0] |
| edge | world wide web —is-a→ network Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | concept_edges[1] |
| edge | small world —same-as→ six degrees of separation Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | concept_edges[2] |
| edge | preferential attachment —causes→ scale-free Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | concept_edges[3] |
| edge | scale-free —operationalised-as→ power-law Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | concept_edges[5] |
| edge | vertex —part-of→ network Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | concept_edges[6] |
| outcome (stated by the tagger, no quotation) | control — held | controls[0] |
| for which use | limitation — every application of the model beyond the degree distribution: IT CANNOT BE EXPECTED TO ACCOUNT FOR ALL ASPECTS OF THE STUDIED NETWORKS Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | limitations[0] |
| for which use | limitation — the same scope as limitations[0] Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | limitations[1] |
| for which use | limitation — the empirical support for the whole claim: DETAILED TOPOLOGICAL DATA IS AVAILABLE ONLY FOR A FEW of the systems that form complex networks Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | limitations[2] |
| for which use | limitation — every result derived from the model: IN THE MODEL WE ASSUMED LINEAR PREFERENTIAL ATTACHMENT - an assumption, not a measurement Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | limitations[3] |
| for which use | limitation — the predicted exponent specifically: THE EXPONENTS OBTAINED FOR THE DIFFERENT NETWORKS ARE SCATTERED BETWEEN 2.1 AND 4, while the model gives a single value Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | limitations[4] |
| duplicate of | limitation — limitations[1] Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | limitations[5] |
| for which use | limitation — the same scope as limitations[0] Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | limitations[5] |
| for which use | limitation — the scale-free result itself, which survives at one parameter value only: SIMULATIONS INDICATE THAT SCALING IS PRESENT ONLY FOR alpha = 1 Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | limitations[6] |
| for which use | limitation — the same scope as limitations[4] - the central prediction against the measured spread Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | limitations[7] |
| for which use | limitation — the dynamic growth prediction, which is untested here: A SCALING PROPERTY THAT COULD BE DIRECTLY TESTED ONCE TIME-RESOLVED DATA ON NETWORK CONNECTIVITY BECOMES AVAILABLE Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | limitations[8] |
| for which use | limitation — the power-grid case only: DUE TO THE RELATIVELY MODEST SIZE OF THE NETWORK, CONTAINING ONLY 4941 VERTICES, THE SCALING REGION IS LESS PROMINENT Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | limitations[9] |
| replication | untested | |
| limitation | the model reproduces the scale-free degree distribution but cannot account for all aspects of real networks Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | limitations[0] |
| limitation | The model is not expected to capture everything about the networks it is fitted to. Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | limitations[1] |
| limitation | Only a few real networks have detailed topological data available to test against. Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | limitations[2] |
| limitation | The model assumes strictly linear preferential attachment. Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | limitations[3] |
| limitation | The single model exponent does not match the spread of exponents measured across the real networks. Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | limitations[4] |
| limitation | The model is not offered as a full account of the systems it is fitted to. Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | limitations[5] |
| limitation | Attachment is assumed linear; scaling survives only at that exponent, which is a strong assumption rather than a result. Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | limitations[6] |
| limitation | The model gives γ = 3 while the measured exponents run from 2.1 to 4, so the central prediction does not match any of the four datasets exactly. Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | limitations[7] |
| limitation | The paper's dynamic prediction about how a vertex accumulates edges over time could not be tested with the data available. Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | limitations[8] |
| limitation | The power-law region for the power grid is weak, and the paper says so rather than fitting it anyway. Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | limitations[9] |
finding · quantity · variable · definition · key-term — grounded in the full text| finding | The probability P(k) that a vertex interacts with k other vertices decays as a power law, P(k) ~ k^-γ. Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | content_tags.findings[0] |
| finding | Scale-free structure emerges from two generic mechanisms: continuous growth by adding vertices, and preferential attachment to already well-connected sites. Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | content_tags.findings[1] |
| finding | These systems share a scale-free distribution of local connectivity, following a power law for large k with an exponent γ between 2.1 and 4. Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | content_tags.findings[2] |
| finding | Both ingredients, growth and preferential attachment, are needed for the stationary power-law distribution to develop. Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | content_tags.findings[3] |
| finding | The model's connectivity distribution P(k) is independent of time, and so of system size. Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | content_tags.findings[4] |
| finding | Solved analytically, the model gives an exponent of 3 that does not depend on how many edges each new vertex brings. Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | content_tags.findings[5] |
| quantity | γ_www = 2.1 ± 0.1 — power-law exponent of the World Wide Web link distribution Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | content_tags.quantities[0] |
| quantity | γ_model = 2.9 ± 0.1 — power-law exponent produced by the preferential-attachment model Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | content_tags.quantities[1] |
| quantity | γ_cite = 3 — power-law exponent of the scientific citation network Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | content_tags.quantities[2] |
| quantity | γ_power ≃ 4 — approximate power-law exponent of the power-grid network Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | content_tags.quantities[3] |
| quantity | γactor = 2.3 ± 0.1 — power-law exponent of the film-actor collaboration graph Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | content_tags.quantities[4] |
| quantity | γwww = 2.1 ± 0.1 — power-law exponent of the world wide web Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | content_tags.quantities[5] |
| quantity | over 800 million vertices — size of the world wide web as the paper takes it Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | content_tags.quantities[6] |
| quantity | 4941 vertices — size of the western US power grid Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | content_tags.quantities[7] |
| quantity | γmodel = 2.9±0.1 — exponent produced by the simulated model Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | content_tags.quantities[8] |
| variable | growth (independent) Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | content_tags.variables[4] |
| variable | preferential attachment (independent) Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | content_tags.variables[5] |
| definition | scale-free power-law distribution Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | content_tags.definitions[0] |
| definition | preferential attachment Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | content_tags.definitions[1] |
| definition | network Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | content_tags.definitions[2] |
| definition | preferential attachment Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | content_tags.definitions[3] |
| definition | random graph model Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | content_tags.definitions[4] |
| definition | small-world model Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | content_tags.definitions[5] |
| key-terms | network, vertices, power-law, scale-free, preferential, exponent, edges, distribution, probability, vertex, edge, connectivity, preferential attachment, topology, random graph, small world |
| concept | preferential attachment Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | concepts[2] |
| concept | network — not defined in this paper's own words; a set of vertices standing for the elements of a system, joined by edges standing for the interactions between them Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | concepts[4] |
| concept | scale-free — not defined in this paper's own words; a network whose connectivity distribution follows a power law, so that no characteristic connectivity exists and hubs are expected rather than absent Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | concepts[5] |
| concept | vertex — not defined in this paper's own words; one element of the system - an actor, a document, a substation, a paper, a protein or a nerve cell depending on the field Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | concepts[6] |
| concept | random graph — not defined in this paper's own words; the Erdős-Rényi construction in which every pair among N fixed vertices is joined with the same probability p Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | concepts[7] |
| concept | small world — not defined in this paper's own words; a lattice with a fraction of its edges rewired at random, which shortens the distance between vertices Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | concepts[8] |
| concept | genetic network — not defined in this paper's own words; the network of a living system, in which the vertices are proteins and genes and the edges are chemical interactions Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | concepts[9] |
| concept | world wide web — not defined in this paper's own words; the network whose vertices are HTML documents and whose edges are the links pointing from one page to another Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | concepts[10] |
| concept | six degrees of separation — not defined in this paper's own words; the popular name for the small-world phenomenon Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | concepts[11] |
| concept | power-law — not defined in this paper's own words; a distribution decaying as k to a negative exponent, with no characteristic scale Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | concepts[12] |
| concept | small-world phenomenon Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | concepts[13] |
| power-law P(k) ~ k^-γ | Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | content_tags.statistics[0] |
| poisson-distribution P(k) = e^-λ λ^k / k! | Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | content_tags.statistics[1] |
| probability-density P(k) | Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | content_tags.statistics[2] |
| exponential-distribution exp(-βk) | Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | content_tags.statistics[3] |
| method | computational-model — a second reading; recorded: simulation Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | alternatives.method |
| phenomenon | scale-free power-law distribution of vertex connectivity in large networks — a second reading; recorded: scale-free degree distribution in large networks Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | alternatives.phenomenon |
When we have changed our mind. Some entries in the table begin with a word in capitals and the reason for it. EVIDENCE CORRECTED — the finding still stands, but we had quoted the wrong sentence from the paper, and the quotation has been replaced with the right one. RETRACTED — the entry itself was wrong; it stays on the page, marked, with the reason, rather than being deleted. WITHDRAWN AND REPLACED — the entry was wrong, and a corrected version of it appears in the entries below. Each mark carries its own reason, in brackets, because the reasons differ from one entry to the next. An entry we have WITHDRAWN is removed from this page and kept in the record, with its reason. A line reading Audit and a date is a later re-reading of the entry against its whole sentence: DOUBTFUL means it was kept, and the reason says what is loose about it. Quotation marks inside the tagger's sentence. Where a tag is the tagger's own sentence, a phrase in quotation marks inside it is borrowed from the paper — the tagger's wording around it is not. The paper's own sentence is the evidence quote for that row; on this page it is withheld with the article, and the article is at its publisher. Nothing inside quotation marks anywhere on this page is ours: if it is quoted, it is the paper's. Whose words a concept carries. A concept entry records a term the paper itself uses, so the term, the sense given for it, and its evidence are the paper's own words, quoted where the paper fixes them. This is the opposite of a sense entry in the tag table, which is the tagger's sentence about how the paper uses a term. Where a concept entry could not be grounded in the paper's words, the entry says so on its own row.
Tag layer © the Meta-Tagging Project, CC BY 4.0. The paper text is © its authors/publisher
and is linked, not reproduced. Excerpts shown are short quotations for identification and verification.
· back to index
· concepts · authors
· עברית
© 2026 Shir Sivroni · ORCID 0009-0000-2597-2824