Pith. sign in

Researcher Evidence Record

Maximilian Probst Gutenberg

This bounded record lists 25 Pith paper rows and 0 imported work rows attributed to this corpus identity. The enumerated, non-disputed paper rows include cs.DS, cs.CC work dated 2020 to 2026. The record describes sources and coverage; it makes no judgment about the person.

Compiled coverage vector

Measured lane counts only. Not a trust score or person verdict.

Enumerated paper scope: 2 fields (cs.DS, cs.CC) · 2020-2026 sources: authors, author_identifiers · paper_authors · author_works · current_verdicts · cited_works

A sourced case file for attributed work. It is neither a profile score nor a verdict about this researcher.

Attributed works

A bounded ledger from the Pith paper and imported-work queries. Counts and source confidence stay with each work.

  1. 2026 Pith paper

    A Near-Optimal Offline Algorithm for Dynamic All-Pairs Shortest Paths in Planar Digraphs

    cs.DS provisional current review present

    Sources and evidence
    Authorship source
    arxiv_oai
    Printed name
    Maximilian Probst Gutenberg
    Author position
    2
    Identity state
    provisional
    Source confidence
    0.7
    Review coverage
    Measured: a current Pith review exists.
    Citation counts
    No source count is attached to this work row.
  2. 2026 Pith paper

    An Approximation Algorithm for Graph Label Selection

    cs.DS provisional current review present

    Sources and evidence
    Authorship source
    arxiv_oai
    Printed name
    Maximilian Probst Gutenberg
    Author position
    2
    Identity state
    provisional
    Source confidence
    0.7
    Review coverage
    Measured: a current Pith review exists.
    Citation counts
    No source count is attached to this work row.
  3. 2026 Pith paper

    Parallel Reachability and Shortest Paths on Non-sparse Digraphs: Near-linear Work and Sub-square-root Depth

    cs.DS provisional current review present

    Sources and evidence
    Authorship source
    paper_authors
    Printed name
    Maximilian Probst Gutenberg
    Author position
    3
    Identity state
    provisional
    Review coverage
    Measured: a current Pith review exists.
    Citation counts
    No source count is attached to this work row.
  4. 2025 Pith paper

    A Simple Deterministic Reduction From Gomory-Hu Tree to Maxflow and Expander Decomposition

    cs.DS provisional current review present

    Sources and evidence
    Authorship source
    paper_authors
    Printed name
    Maximilian Probst Gutenberg
    Author position
    1
    Identity state
    provisional
    Review coverage
    Measured: a current Pith review exists.
    Citation counts
    No source count is attached to this work row.
  5. 2025 Pith paper

    A Simple and Fast Reduction from Gomory-Hu Trees to Polylog Maxflows

    cs.DS provisional current review present

    Sources and evidence
    Authorship source
    paper_authors
    Printed name
    Maximilian Probst Gutenberg
    Author position
    1
    Identity state
    provisional
    Review coverage
    Measured: a current Pith review exists.
    Citation counts
    • 1 pith inbound references from cited_work_pith_inbound_counts
  6. 2023 Pith paper

    A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow

    cs.DS provisional measured, no current review

    Sources and evidence
    Authorship source
    arxiv_oai
    Printed name
    Maximilian Probst Gutenberg
    Author position
    6
    Identity state
    provisional
    Source confidence
    0.7
    Review coverage
    Measured: no current Pith review exists.
    Citation counts
    • 1 pith inbound references from cited_work_pith_inbound_counts
  7. 2022 Pith paper

    Deterministic Incremental APSP with Polylogarithmic Update Time and Stretch

    cs.DS provisional measured, no current review

    Sources and evidence
    Authorship source
    arxiv_oai
    Printed name
    Maximilian Probst Gutenberg
    Author position
    3
    Identity state
    provisional
    Source confidence
    0.7
    Review coverage
    Measured: no current Pith review exists.
    Citation counts
    No source count is attached to this work row.
  8. 2022 Pith paper

    A Simple Framework for Finding Balanced Sparse Cuts via APSP

    cs.DS provisional measured, no current review

    Sources and evidence
    Authorship source
    arxiv_oai
    Printed name
    Maximilian Probst Gutenberg
    Author position
    3
    Identity state
    provisional
    Source confidence
    0.7
    Review coverage
    Measured: no current Pith review exists.
    Citation counts
    No source count is attached to this work row.
  9. 2022 Pith paper

    Derandomizing Directed Random Walks in Almost-Linear Time

    cs.DS provisional measured, no current review

    Sources and evidence
    Authorship source
    arxiv_oai
    Printed name
    Maximilian Probst Gutenberg
    Author position
    3
    Identity state
    provisional
    Source confidence
    0.7
    Review coverage
    Measured: no current Pith review exists.
    Citation counts
    No source count is attached to this work row.
  10. 2022 Pith paper

    Maintaining Expander Decompositions via Sparse Cuts

    cs.DS provisional measured, no current review

    Sources and evidence
    Authorship source
    arxiv_oai
    Printed name
    Maximilian Probst Gutenberg
    Author position
    3
    Identity state
    provisional
    Source confidence
    0.7
    Review coverage
    Measured: no current Pith review exists.
    Citation counts
    No source count is attached to this work row.
  11. 2022 Pith paper

    Maximum Flow and Minimum-Cost Flow in Almost-Linear Time

    cs.DS provisional measured, no current review

    Sources and evidence
    Authorship source
    arxiv_oai
    Printed name
    Maximilian Probst Gutenberg
    Author position
    5
    Identity state
    provisional
    Source confidence
    0.7
    Review coverage
    Measured: no current Pith review exists.
    Citation counts
    No source count is attached to this work row.
  12. 2022 Pith paper

    Hardness Results for Laplacians of Simplicial Complexes via Sparse-Linear Equation Complete Gadgets

    cs.CC provisional measured, no current review

    Sources and evidence
    Authorship source
    arxiv_oai
    Printed name
    Maximilian Probst Gutenberg
    Author position
    3
    Identity state
    provisional
    Source confidence
    0.7
    Review coverage
    Measured: no current Pith review exists.
    Citation counts
    No source count is attached to this work row.
  13. 2021 Pith paper

    A Simple Algorithm for Multiple-Source Shortest Paths in Planar Digraphs

    cs.DS provisional measured, no current review

    Sources and evidence
    Authorship source
    arxiv_oai
    Printed name
    Maximilian Probst Gutenberg
    Author position
    3
    Identity state
    provisional
    Source confidence
    0.7
    Review coverage
    Measured: no current Pith review exists.
    Citation counts
    No source count is attached to this work row.
  14. 2021 Pith paper

    Incremental SSSP for Sparse Digraphs Beyond the Hopset Barrier

    cs.DS provisional measured, no current review

    Sources and evidence
    Authorship source
    arxiv_oai
    Printed name
    Maximilian Probst Gutenberg
    Author position
    3
    Identity state
    provisional
    Source confidence
    0.7
    Review coverage
    Measured: no current Pith review exists.
    Citation counts
    No source count is attached to this work row.
  15. 2021 Pith paper

    Deterministic Decremental SSSP and Approximate Min-Cost Flow in Almost-Linear Time

    cs.DS provisional measured, no current review

    Sources and evidence
    Authorship source
    arxiv_oai
    Printed name
    Maximilian Probst Gutenberg
    Author position
    2
    Identity state
    provisional
    Source confidence
    0.7
    Review coverage
    Measured: no current Pith review exists.
    Citation counts
    No source count is attached to this work row.
  16. 2020 Pith paper

    Near-Optimal Algorithms for Reachability, Strongly-Connected Components and Shortest Paths in Partially Dynamic Digraphs

    cs.DS provisional measured, no current review

    Sources and evidence
    Authorship source
    arxiv_oai
    Printed name
    Maximilian Probst Gutenberg
    Author position
    1
    Identity state
    provisional
    Source confidence
    0.7
    Review coverage
    Measured: no current Pith review exists.
    Citation counts
    No source count is attached to this work row.
  17. 2020 Pith paper

    New Techniques and Fine-Grained Hardness for Dynamic Near-Additive Spanners

    cs.DS provisional measured, no current review

    Sources and evidence
    Authorship source
    arxiv_oai
    Printed name
    Maximilian Probst Gutenberg
    Author position
    3
    Identity state
    provisional
    Source confidence
    0.7
    Review coverage
    Measured: no current Pith review exists.
    Citation counts
    No source count is attached to this work row.
  18. 2020 Pith paper

    Decremental APSP in Directed Graphs Versus an Adaptive Adversary

    cs.DS provisional measured, no current review

    Sources and evidence
    Authorship source
    arxiv_oai
    Printed name
    Maximilian Probst Gutenberg
    Author position
    3
    Identity state
    provisional
    Source confidence
    0.7
    Review coverage
    Measured: no current Pith review exists.
    Citation counts
    No source count is attached to this work row.
  19. 2020 Pith paper

    Deterministic Decremental Reachability, SCC, and Shortest Paths via Directed Expanders and Congestion Balancing

    cs.DS provisional measured, no current review

    Sources and evidence
    Authorship source
    arxiv_oai
    Printed name
    Maximilian Probst Gutenberg
    Author position
    2
    Identity state
    provisional
    Source confidence
    0.7
    Review coverage
    Measured: no current Pith review exists.
    Citation counts
    • 1 pith inbound references from cited_work_pith_inbound_counts
  20. 2020 Pith paper

    Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary

    cs.DS provisional measured, no current review

    Sources and evidence
    Authorship source
    arxiv_oai
    Printed name
    Maximilian Probst Gutenberg
    Author position
    3
    Identity state
    provisional
    Source confidence
    0.7
    Review coverage
    Measured: no current Pith review exists.
    Citation counts
    • 1 pith inbound references from cited_work_pith_inbound_counts
  21. 2020 Pith paper

    Near-Optimal Decremental SSSP in Dense Weighted Digraphs

    cs.DS provisional measured, no current review

    Sources and evidence
    Authorship source
    arxiv_oai
    Printed name
    Maximilian Probst Gutenberg
    Author position
    2
    Identity state
    provisional
    Source confidence
    0.7
    Review coverage
    Measured: no current Pith review exists.
    Citation counts
    No source count is attached to this work row.
  22. 2020 Pith paper

    Decremental SSSP in Weighted Digraphs: Faster and Against an Adaptive Adversary

    cs.DS provisional measured, no current review

    Sources and evidence
    Authorship source
    arxiv_oai
    Printed name
    Maximilian Probst Gutenberg
    Author position
    1
    Identity state
    provisional
    Source confidence
    0.7
    Review coverage
    Measured: no current Pith review exists.
    Citation counts
    No source count is attached to this work row.
  23. 2020 Pith paper

    Deterministic Algorithms for Decremental Approximate Shortest Paths: Faster and Simpler

    cs.DS provisional measured, no current review

    Sources and evidence
    Authorship source
    arxiv_oai
    Printed name
    Maximilian Probst Gutenberg
    Author position
    1
    Identity state
    provisional
    Source confidence
    0.7
    Review coverage
    Measured: no current Pith review exists.
    Citation counts
    No source count is attached to this work row.
  24. 2020 Pith paper

    Fully-Dynamic All-Pairs Shortest Paths: Improved Worst-Case Time and Space Bounds

    cs.DS provisional measured, no current review

    Sources and evidence
    Authorship source
    arxiv_oai
    Printed name
    Maximilian Probst Gutenberg
    Author position
    1
    Identity state
    provisional
    Source confidence
    0.7
    Review coverage
    Measured: no current Pith review exists.
    Citation counts
    No source count is attached to this work row.
  25. 2020 Pith paper

    New Algorithms and Hardness for Incremental Single-Source Shortest Paths in Directed Graphs

    cs.DS provisional measured, no current review

    Sources and evidence
    Authorship source
    arxiv_oai
    Printed name
    Maximilian Probst Gutenberg
    Author position
    1
    Identity state
    provisional
    Source confidence
    0.7
    Review coverage
    Measured: no current Pith review exists.
    Citation counts
    No source count is attached to this work row.

Evidence apparatus

The machinery behind this record. Every lane states whether Pith measured it, did not query it, could not reach it, or withheld it.

LaneStateObservedBoundary and source
identity Measured 2 Canonical identity row plus public typed identifiers.
source=authors, author_identifiers
papers Measured 25 of 25 bounded rows Rows attributed to this author UUID in the Pith corpus.
source=paper_authors
works Measured zero 0 of 0 bounded rows Imported works not duplicated by the paper ledger.
source=author_works
reviews Measured 5 of 25 bounded rows Coverage count only. No review outcome is projected onto the person.
source=current_verdicts
citations Measured 4 of 25 bounded rows Counts remain itemized by work and source.
source=cited_works
coauthors Measured 31 of 25 bounded rows Shared-work edges from admitted paper rows.
source=paper_authors
account Unavailable No public count of 1 bounded rows Account metadata is separate from corpus evidence.
source=users.author_id
Public identity sources
  • name variant
    Maximilian Probst Gutenberg
    backfill
    confidence 0.6
Enumerated research scope

Fields and dates come only from enumerated, non-disputed Pith paper rows. They do not claim career completeness.

  • cs.DS24 rows
  • cs.CC1 rows
  • 202010 rows
  • 20213 rows
  • 20226 rows
  • 20231 rows
  • 20252 rows
  • 20263 rows
Shared-work index
Record scope

The work queries are bounded. Missing rows may mean measured zero, an unavailable source, a query that did not run, or private data that Pith withheld. The lane table keeps those cases separate.

Paper findings remain attached to papers. They do not become findings about this researcher.