Pith. sign in

Paper Citation Record · LEDGER

Differentially Private Gomory-Hu Trees

As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2408.01798.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2408.01798 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 2 of 2 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-08T06:32:00.761636+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-07T01:18:29.229693Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: pith, observed 2026-08-06T21:02:19.526265Z

Reference resolution

0 of 0 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved0
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation 76d29545-5a98-4635-a632-cd7f7c3ec5d2 · inbound

Breaking the O(mn)-Time Barrier for Vertex-Weighted Global Minimum Cut cites this paper.

Breaking the O(mn)-Time Barrier for Vertex-Weighted Global Minimum Cut Differentially Private Gomory-Hu Trees

Reference 2024

Resolution
unresolved
no resolver link, observed 2026-08-07T01:18:29.229693Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-07T01:18:29.229693Z digest=sha256:fe7ff646f756323c9b1c7712dc4acdc3c466e766a3565527e9a41d506b4092a6

Observation bf4a0e40-4aac-4282-b573-a156fd635a48 · inbound

Breaking the $n^{1.5}$ Additive Error Barrier for Private and Efficient Graph Sparsification via Private Expander Decomposition cites this paper.

Breaking the $n^{1.5}$ Additive Error Barrier for Private and Efficient Graph Sparsification via Private Expander Decomposition Differentially Private Gomory-Hu Trees

Reference 3

Resolution
verified exact
local_arxiv, observed 2026-08-06T21:02:19.530289Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-06T21:02:19.327178Z digest=sha256:16dafc9741ac4050a389040f857fe9f59e5251695dadec6aa0def7e52b2e02ae