Pith. sign in

Paper Citation Record · LEDGER

A short proof of Tuza's conjecture for weak saturation in hypergraphs

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

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

pith.paper-citation-record.v1
2504.03816 v3

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-07T06:34:17.273281+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-06T19:41:01.520618Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-05-11T06:25:58.217097Z

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 d208afee-2e1b-401d-8d5a-6bf3bd9b7c43 · inbound

When does a tree activate the random graph? cites this paper.

When does a tree activate the random graph? A short proof of Tuza's conjecture for weak saturation in hypergraphs

Reference 61

Resolution
unresolved
no resolver link, observed 2026-08-06T19:41:01.520618Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-06T19:41:01.520618Z digest=sha256:682e93a84ab0b31877ff068cf571609839bf3c855f1a52f5e8bc0d76d4b15feb

Observation 1a59be44-f9d9-437a-a609-96b9bb7e8558 · inbound

Asymptotically optimal lower bounds on weak saturation numbers for hypergraphs cites this paper.

Asymptotically optimal lower bounds on weak saturation numbers for hypergraphs A short proof of Tuza's conjecture for weak saturation in hypergraphs

Reference 27

Resolution
verified exact
arxiv_id, observed 2026-07-07T02:19:37.747754Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-05-10T17:39:22.333212Z digest=sha256:8c12fb0f19089e1976a4f70df572f9a9b275f8da44d070b582afa6ebc09232d2