Paper Citation Record · LEDGER

On the complexity of computing Strahler numbers

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

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

pith.paper-citation-record.v1
2512.19060 v2

Coverage vector

measured 12 of 12 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-03T15:05:07.798305Z

measured 12 of 12 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-12T06:34:41.77262+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

12 of 12 outbound references displayed

verified exact4
verified fuzzy0
unresolved6
parse uncertain0
malformed identifier1
metadata mismatch1

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation c901e596-4645-464f-8511-8867b281e8bd · outbound

This paper cites an unresolved cited work.

On the complexity of computing Strahler numbers Unresolved cited work

Reference 9

Resolution: verified exact; doi, observed 2026-08-03T15:09:20.873703Z

Source-reported events for the cited work

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

Observation e3fd6bc3-e3c7-4950-951f-6d78d6b9629f · outbound

This paper cites 58 Heribert Vollmer.Introduction to Circuit Complexity - A Uniform Approach.

On the complexity of computing Strahler numbers 58 Heribert Vollmer.Introduction to Circuit Complexity - A Uniform Approach

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-03T15:05:07.798305Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dcc231c4-bb94-4afd-b729-6409d68df6e7 · outbound

This paper cites On programming of arithmetic operations.Communications of the ACM, 1(8):3–6, 1958.doi:10.1145/368892.368907.

On the complexity of computing Strahler numbers On programming of arithmetic operations.Communications of the ACM, 1(8):3–6, 1958.doi:10.1145/368892.368907

Reference 66

Resolution: unresolved; no resolver link, observed 2026-08-03T15:05:07.319549Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a41bda21-bff4-4f7d-9cdd-a1f691cc86a4 · outbound

This paper cites Computing algebraic formulas using a constant number of registers.SIAM Journal on Computing, 21(1):54–58, 1992.doi:10.1137/0221006.

On the complexity of computing Strahler numbers Computing algebraic formulas using a constant number of registers.SIAM Journal on Computing, 21(1):54–58, 1992.doi:10.1137/0221006

Reference 1035

Resolution: unresolved; no resolver link, observed 2026-08-03T15:05:07.075419Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c4b40070-e3a4-4087-a8bc-a40a592dc5a0 · outbound

This paper cites Strahler.

On the complexity of computing Strahler numbers Strahler

Reference 1971

Resolution: unresolved; no resolver link, observed 2026-08-03T15:05:07.690851Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 51ce9cc1-4290-43dd-aa3d-35bc72378f3b · outbound

This paper cites 28 Philippe Flajolet, Paolo Sipala, and Jean-Marc Steyaert.

On the complexity of computing Strahler numbers 28 Philippe Flajolet, Paolo Sipala, and Jean-Marc Steyaert

Reference 1979

Resolution: verified exact; doi, observed 2026-08-03T15:09:21.314747Z

Source-reported events for the cited work

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

Observation 152f792e-759a-4ec6-9198-aaa3022e5bd3 · outbound

This paper cites A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter.

On the complexity of computing Strahler numbers A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter

Reference 1990

Resolution: metadata mismatch; local_arxiv, observed 2026-08-03T15:09:20.594825Z

Source-reported events for the cited work

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

Observation 7d9db4af-b881-4e27-a87c-5596d8998a6d · outbound

This paper cites 19 Peter J.

On the complexity of computing Strahler numbers 19 Peter J

Reference 1996

Resolution: unresolved; no resolver link, observed 2026-08-03T15:05:07.145102Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 82016dd1-5b23-44f1-8fa5-9300de095b37 · outbound

This paper cites 2 Sanjeev Arora and Boaz Barak.Computational Complexity - A Modern Approach.

On the complexity of computing Strahler numbers 2 Sanjeev Arora and Boaz Barak.Computational Complexity - A Modern Approach

Reference 2004

Resolution: verified exact; doi, observed 2026-08-03T15:09:21.884760Z

Source-reported events for the cited work

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

Observation 00427f61-25cd-48c1-b221-18fc6a7b3ec4 · outbound

This paper cites 22 Michael Elberfeld, Andreas Jakoby, and Till Tantau.

On the complexity of computing Strahler numbers 22 Michael Elberfeld, Andreas Jakoby, and Till Tantau

Reference 2010

Resolution: verified exact; doi, observed 2026-08-03T15:09:21.661866Z

Source-reported events for the cited work

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

Observation ae8ff5ca-4d49-46e6-923c-5d788c9da02e · outbound

This paper cites FSTTCS.2011.152.

On the complexity of computing Strahler numbers FSTTCS.2011.152

Reference 2011

Resolution: malformed identifier; no resolver link, observed 2026-08-03T15:05:07.005113Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2aa4dc52-4004-4556-9ebb-0d9ad7b7ae52 · outbound

This paper cites 33 Seymour Ginsburg and Edwin H.

On the complexity of computing Strahler numbers 33 Seymour Ginsburg and Edwin H

Reference 2020

Resolution: unresolved; no resolver link, observed 2026-08-03T15:05:07.449956Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.