Pith. Sign in

RECORD

Multi-Source Multi-Sink Nash Flows Over Time

PaperPDF from arXiv

data files

Paper breakdownThe authors' claims, conditions and measurements, as JSON Signed receiptProof this review has not been altered
X Bluesky LinkedIn Reddit Hacker News
Leon Sering, Martin Skutella

Computer Science and Game Theory · Submitted 3 Jul 2018

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim In particular, we come up with a subtle generalization of thin flows with resetting which yields a compact description as well as an algorithmic approach for computing multi-terminal Nash flows over time.

how it is stated · asserted 1.00 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID1807.01098 (version 2)
Pith IDTERFX5NA, Pith's permanent record of this paper and its review
CitationLeon Sering, Martin Skutella. "Multi-Source Multi-Sink Nash Flows Over Time." arXiv:1807.01098 (2018). https://pith.science/paper/TERFX5NA
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 4,935 input tokens.

What the abstract itself states, as probabilities: claims first 0.10 · states limitation 0.08 · human participants 0.03 · controlled comparison 0.02 · randomized assignment 0.01 · states quantitative result 0.03 · compares with prior results 0.80 · mentions code or data availability 0.02.

The abstract, sentence by sentence

arXiv listing abstract v2. Results and the main claim are underlined; .

Nash flows over time describe the behavior of selfish users eager to reach their destination as early as possible while traveling along the arcs of a network with capacities and transit times. Throughout the past decade, they have been thoroughly studied in single-source single-sink networks for the deterministic queuing model, which is of particular relevance and frequently used in the context of traffic and transport networks. In this setting there exist Nash flows over time that can be described by a sequence of static flows featuring special properties, so-called `thin flows with resetting'. This insight can also be used algorithmically to compute Nash flows over time. We present an extension of these result to networks with multiple sources and sinks which are much more relevant in practical applications. In particular, we come up with a subtle generalization of thin flows with resetting which yields a compact description as well as an algorithmic approach for computing multi-terminal Nash flows over time.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 Nash flows over time describe the behavior of selfish users eager to reach their destination as early as possible while traveling along the arcs of a network with capacities and transit times. background 1.00 0.05 0.03 asserted 1.00
s1 Throughout the past decade, they have been thoroughly studied in single-source single-sink networks for the deterministic queuing model, which is of particular relevance and frequently used in the context of traffic and transport networks. background 0.99 0.03 0.03 asserted 1.00
s2 In this setting there exist Nash flows over time that can be described by a sequence of static flows featuring special properties, so-called `thin flows with resetting'. background 0.93 0.09 0.07 asserted 0.99
s3 This insight can also be used algorithmically to compute Nash flows over time. interpretation 0.46 0.18 0.05 asserted 0.72
s4 We present an extension of these result to networks with multiple sources and sinks which are much more relevant in practical applications. contribution 0.89 0.88 0.39 asserted 1.00
s5 In particular, we come up with a subtle generalization of thin flows with resetting which yields a compact description as well as an algorithmic approach for computing multi-terminal Nash flows over time. contribution 0.97 0.96 0.84 asserted 1.00

What kind of paper the classifier reports this is: method or tool 0.61 · evidence from proof or derivation 0.97.

What was examined, and what was not

sources read
  • arXiv listing abstract v2
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original abstract

Nash flows over time describe the behavior of selfish users eager to reach their destination as early as possible while traveling along the arcs of a network with capacities and transit times. Throughout the past decade, they have been thoroughly studied in single-source single-sink networks for the deterministic queuing model, which is of particular relevance and frequently used in the context of traffic and transport networks. In this setting there exist Nash flows over time that can be described by a sequence of static flows featuring special properties, so-called `thin flows with resetting'. This insight can also be used algorithmically to compute Nash flows over time. We present an extension of these result to networks with multiple sources and sinks which are much more relevant in practical applications. In particular, we come up with a subtle generalization of thin flows with resetting which yields a compact description as well as an algorithmic approach for computing multi-terminal Nash flows over time.

Human review

How Pith checks papers → · Full audit of this paper →

How the literature uses it

1 arXiv paper cite this in 2 sentences

Each citing sentence is taken from the citing paper's LaTeX source and typed by Pith's classifier. A label appears at probability 0.8 or more (0.95 for support), a contest at 0.7 or more; the quoted words are the citing authors'. How each label was checked · JSON

Papers citing it · 1 sentence without a confident label

Cites it as background 1 paper

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.