Pith. sign in

Paper Citation Record · LEDGER

The vertex sets of subtrees of a tree

As of 22 August 2026, this Paper Citation Record lists 11 of 11 outbound references and 2 inbound Pith citation observations for arXiv:2506.03603.

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

pith.paper-citation-record.v1
2506.03603 v1

Coverage vector

measured 11 of 11 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-07T11:22:56.919458Z

measured 13 of 13 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-22T06:32:14.747728+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-10T19:55:28.711848Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-08-10T19:55:28.960663Z

Reference resolution

11 of 11 outbound references displayed

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

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 69714f03-e9c1-492f-b38f-1d4c46841de8 · outbound

This paper cites A characterization of rigid circuit graphs.

The vertex sets of subtrees of a tree A characterization of rigid circuit graphs

Reference 1

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:22:57.189151Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-07T11:22:56.884581Z digest=sha256:a421a9d0f3fe0f50b582416657f1b16444ae07400a32ac9a2a249a6de5363652

Observation 980e3565-3485-4dc9-bf6e-69ba49dbeb6f · outbound

This paper cites The intersection graphs of subtrees in trees are exactly the chordal graphs.

The vertex sets of subtrees of a tree The intersection graphs of subtrees in trees are exactly the chordal graphs

Reference 2

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:22:57.178111Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-07T11:22:56.888677Z digest=sha256:a3f538697b7ce5375bd4c33056b4842913f2e43de538e5a40d9919470eb094d7

Observation 85e2c588-e6d6-4880-a99c-a18bb0ab4552 · outbound

This paper cites A Helly type problem in trees.

The vertex sets of subtrees of a tree A Helly type problem in trees

Reference 3

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:22:57.167166Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-07T11:22:56.892398Z digest=sha256:a7d1501f11d6834c178292d53a08e43e2ac9771c2cf15e53f4bcb81e58d02222

Observation e4e933e5-6b4f-46c3-a0eb-683271dae4f1 · outbound

This paper cites On the representation of triangulated graphs in trees.

The vertex sets of subtrees of a tree On the representation of triangulated graphs in trees

Reference 4

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:22:57.155898Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-07T11:22:56.896472Z digest=sha256:98d7860991aa2701dba3beb326801ef9d66c335f1316b53f437996bb48a44f24

Observation 05e9b889-9ba4-4d01-8e8c-b2e68b2e3c91 · outbound

This paper cites Representation of a finite graph by a set of intervals on the real line.

The vertex sets of subtrees of a tree Representation of a finite graph by a set of intervals on the real line

Reference 5

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:22:57.145277Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-07T11:22:56.899717Z digest=sha256:1803aa16cf64ea45ec4e4469eee7fb3037580f47a8f6a9e0900247a1bcbe476c

Observation 381e0a96-815f-4e11-94f8-ffa7be774891 · outbound

This paper cites Path-width and additive quasi-isometries.

The vertex sets of subtrees of a tree Path-width and additive quasi-isometries

Reference 6

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:22:57.130188Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-07T11:22:56.903056Z digest=sha256:dcce846e413a2858c7ec561e148d80a4ab94a6bbe0611db753bc0ecf7ff4de3c

Observation 54622089-891b-4a8a-b52c-b9bbe03fd3a4 · outbound

This paper cites The tree-width compactness theorem for hypergraphs.

The vertex sets of subtrees of a tree The tree-width compactness theorem for hypergraphs

Reference 7

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:22:57.118555Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-07T11:22:56.906859Z digest=sha256:491180621f8630c2dac0d1ccc0ea62980a3da4ff9785f40cefa7561259d3b6ed

Observation 7308dfa7-06b1-48e1-b42f-f171be6e1d07 · outbound

This paper cites Configurations in graphs of large minimum degree, connectivity, or chromatic Number.

The vertex sets of subtrees of a tree Configurations in graphs of large minimum degree, connectivity, or chromatic Number

Reference 8

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:22:57.107819Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-07T11:22:56.909954Z digest=sha256:b23e0a4f4dd859e044e1d8df4001e8bc2f23ce8835535010b805fef7ce439986

Observation 3fb0490f-65d4-40b3-8881-239b9b50568b · outbound

This paper cites A structure theorem for the consecutive 1’s property.

The vertex sets of subtrees of a tree A structure theorem for the consecutive 1’s property

Reference 9

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:22:56.974202Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-07T11:22:56.913145Z digest=sha256:6bd335f065abe31a5d5e3ca7bd6b2d5318dc4fc1a3bf51d7705b8a47ab42f08d

Observation e8bdbcc8-f295-443a-9f47-d9a109eb2ffe · outbound

This paper cites Matroids and graphs.

The vertex sets of subtrees of a tree Matroids and graphs

Reference 10

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:22:56.963546Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-07T11:22:56.916210Z digest=sha256:505047098f3ab38c951d98ed329664cf6be5a9220232acef69d6ae0402a66e01

Observation e3e099a7-7d0e-4a7d-b73d-1b5387a89a2b · outbound

This paper cites Representations of chordal graphs as subtrees of a tree.

The vertex sets of subtrees of a tree Representations of chordal graphs as subtrees of a tree

Reference 11

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:22:56.952345Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-07T11:22:56.919458Z digest=sha256:3e537bc8fa192afeb22bbbe081d13841d55578282330e3a8751112a1bd457497

Pith citing papers

Observation 60763a82-616c-4d00-86be-d72238204512 · inbound

Asymptotic structure. I. Coarse tree-width cites this paper.

Asymptotic structure. I. Coarse tree-width The vertex sets of subtrees of a tree

Reference 5

Resolution
verified exact
local_arxiv, observed 2026-08-10T19:55:28.972447Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-10T19:55:28.711848Z digest=sha256:89279597fe545473d015105f15fd8a3fad4ea6b22093bbf82f7c94ff2260e57f

Observation bbb749de-11f4-44f8-82e6-77309f950ce5 · inbound

Asymptotic structure. III. Excluding a fat tree cites this paper.

Asymptotic structure. III. Excluding a fat tree The vertex sets of subtrees of a tree

Reference 2

Resolution
unresolved
no resolver link, observed 2026-08-04T19:58:12.692868Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T19:58:12.692868Z digest=sha256:e2e9b29484b3623807cd4920679045b25611550839e9d62e9f03342b51564985