Pith. sign in

Paper Citation Record · LEDGER

Concentration of the maximum size of an induced subtree in moderately sparse random graphs

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

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

pith.paper-citation-record.v1
2506.02801 v2

Coverage vector

measured 26 of 26 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-07T11:31:20.896037Z

measured 26 of 26 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-17T06:30:58.91139+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

26 of 26 outbound references displayed

  • verified exact3
  • verified fuzzy23
  • unresolved0
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 4d0099c7-59d7-48c7-8555-d893979b216e · outbound

This paper cites The maximum size of an induced forest in the binomial random graph.

Concentration of the maximum size of an induced subtree in moderately sparse random graphs The maximum size of an induced forest in the binomial random graph

Reference 1

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:31:21.298930Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-07T11:31:19.639315Z digest=sha256:78a7b4bb41728ea0340061da4e453e7d8e684bc28e65860c37e628b23bd7b79d

Observation 9e07370a-412c-49df-91d9-3f548eb006fa · outbound

This paper cites Maximum induced trees and forests of bounded degree in random graphs.

Concentration of the maximum size of an induced subtree in moderately sparse random graphs Maximum induced trees and forests of bounded degree in random graphs

Reference 2

Resolution
verified exact
local_arxiv, observed 2026-08-07T11:31:20.979924Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-07T11:31:19.729096Z digest=sha256:7fe737a9a43c1cd77f596c0465221e2777633c2ef5054c62d63e445f6313e10b

Observation aff0fb4c-cc5d-4570-96aa-ebacfbdda594 · outbound

This paper cites On the sizes of large subgraphs of the binomial random graph.

Concentration of the maximum size of an induced subtree in moderately sparse random graphs On the sizes of large subgraphs of the binomial random graph

Reference 3

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:31:21.283352Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-07T11:31:19.837939Z digest=sha256:545d8f96015bc9d3a0f277b0890df8c62cd2a8b423ff6cb1ec34d0b5e35b3777

Observation 67ca9982-b907-46de-80ba-f11cac8db1ad · outbound

This paper cites Two-Point Concentration of the Independence Number of the Ran- dom Graph.

Concentration of the maximum size of an induced subtree in moderately sparse random graphs Two-Point Concentration of the Independence Number of the Ran- dom Graph

Reference 4

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:31:21.267580Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-07T11:31:19.945848Z digest=sha256:a6ed1cb367f2fdedb4698ba3b0c74d39fa3fb6b598f075c1b00e4b358b2a49a5

Observation e2419f33-a6fd-44bb-9715-6af7b64cd122 · outbound

This paper cites Two-point concentration of the domination number of random graphs.

Concentration of the maximum size of an induced subtree in moderately sparse random graphs Two-point concentration of the domination number of random graphs

Reference 5

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:31:21.253136Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-07T11:31:20.032718Z digest=sha256:020dbca3ce2d2b369b170691d8b7ccd230b47e30d4510b6be5e2aad685a5d0b1

Observation 57a27882-e704-4e02-b20b-c128e3dca0ed · outbound

This paper cites Random Graphs.

Concentration of the maximum size of an induced subtree in moderately sparse random graphs Random Graphs

Reference 6

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:31:21.238711Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-07T11:31:20.120919Z digest=sha256:782e134625edc4749310bd7255ce21c77db9794a6047e281e235a688451ea069

Observation 52be6ad3-3d81-4cc9-bdb2-573434b6bf66 · outbound

This paper cites Cliques in random graphs.

Concentration of the maximum size of an induced subtree in moderately sparse random graphs Cliques in random graphs

Reference 7

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:31:21.223191Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-07T11:31:20.277412Z digest=sha256:5c7e7d6cee9e30f9f91bc2eb4d594a2529d4d2d9102ba155634ea48ac67e35b1

Observation c3610393-151c-4f84-b03c-9f39cc00fcc9 · outbound

This paper cites Maximum Induced Trees in Sparse Random Graphs.

Concentration of the maximum size of an induced subtree in moderately sparse random graphs Maximum Induced Trees in Sparse Random Graphs

Reference 8

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:31:21.209490Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-07T11:31:20.381317Z digest=sha256:efdb53668ad7f37ec33e838f9a88ac6280063bba7bc966974905afdb394d0438

Observation f56d3083-741f-4144-9ea0-3690e2db0251 · outbound

This paper cites Large induced matchings in random graphs.

Concentration of the maximum size of an induced subtree in moderately sparse random graphs Large induced matchings in random graphs

Reference 9

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:31:21.195953Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-07T11:31:20.434077Z digest=sha256:56e9892e306fc23a7f66db6f1b3d29c0987281973547afa29da9831d22dd6fd6

Observation 38a9ad23-8ebe-4b9f-b013-05be05b6d204 · outbound

This paper cites Independence Numbers of Random Subgraphs of Some Distance Graph.

Concentration of the maximum size of an induced subtree in moderately sparse random graphs Independence Numbers of Random Subgraphs of Some Distance Graph

Reference 10

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:31:21.182957Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-07T11:31:20.523444Z digest=sha256:2038bf8da9ea0e0abd42ea053ea9ebbdc59ec9351d477fc18e43fd9c31f23da3

Observation 538ced12-7096-4fc8-825f-e6549b6c428a · outbound

This paper cites The largest hole in sparse random graphs.

Concentration of the maximum size of an induced subtree in moderately sparse random graphs The largest hole in sparse random graphs

Reference 11

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:31:21.170328Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-07T11:31:20.596508Z digest=sha256:a1ff136ffc553def9a4953a2ee09fed38c880f12e6f563275d4aa509ad41853a

Observation d6ad43af-1a67-4f33-a8a4-6242cc9beac5 · outbound

This paper cites Large induced trees in dense random graphs.

Concentration of the maximum size of an induced subtree in moderately sparse random graphs Large induced trees in dense random graphs

Reference 12

Resolution
verified exact
local_arxiv, observed 2026-08-07T11:31:20.959886Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-07T11:31:20.707478Z digest=sha256:8e9eeb700f616a84f60e82507ae3f58f5124ab3165a17a633ae501d1c2f7c5b7

Observation f1903309-e0f6-45a6-ad6c-ed7836d1013a · outbound

This paper cites On Induced Paths, Holes and Trees in Random Graphs.

Concentration of the maximum size of an induced subtree in moderately sparse random graphs On Induced Paths, Holes and Trees in Random Graphs

Reference 13

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:31:21.156932Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-07T11:31:20.827516Z digest=sha256:a756fbc269434829ced2611ecefe629726c50a331fde2affaaf713495a9cf161

Observation 993cfe85-91f7-4a5e-9f74-83cd83a0e0e2 · outbound

This paper cites Trees in random graphs.

Concentration of the maximum size of an induced subtree in moderately sparse random graphs Trees in random graphs

Reference 14

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:31:21.143650Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-07T11:31:20.845558Z digest=sha256:490e9942cec0a293c0605b2119abd9781e5487c0295e6fbdf0e6f06186d95acc

Observation fcbcdafd-acc7-4f23-857f-976989c27824 · outbound

This paper cites Induced trees in sparse random graphs.

Concentration of the maximum size of an induced subtree in moderately sparse random graphs Induced trees in sparse random graphs

Reference 15

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:31:21.130631Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-07T11:31:20.850240Z digest=sha256:309a441346b9aa178637d8123b6c8017d416879ecd55b6f7f0830b6866d78dd2

Observation 2d6f3238-7486-4fea-b1cf-559f71009988 · outbound

This paper cites The largest induced tree in a sparse random graph.

Concentration of the maximum size of an induced subtree in moderately sparse random graphs The largest induced tree in a sparse random graph

Reference 16

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:31:21.117331Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-07T11:31:20.854558Z digest=sha256:75c0c9e7e134e7d1e5bbd6ce9817227f275a40cdccf06ffed6d560756bc0949e

Observation dc0f2c25-25ca-48af-bf3f-68dff097319e · outbound

This paper cites Large induced trees in sparse random graphs.

Concentration of the maximum size of an induced subtree in moderately sparse random graphs Large induced trees in sparse random graphs

Reference 17

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:31:21.104430Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-07T11:31:20.858918Z digest=sha256:44a16b4350696b76a00f069b5a6c4d2a700ab26f1b1e27e1fa58e7826b1f6eb8

Observation 5497f185-92c6-4691-bf05-45e2376d32ef · outbound

This paper cites Largest sparse subgraphs of random graphs.

Concentration of the maximum size of an induced subtree in moderately sparse random graphs Largest sparse subgraphs of random graphs

Reference 18

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:31:21.091143Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-07T11:31:20.862775Z digest=sha256:7501b8814e41ef421793435c4dafe72d27b76719ae2d98c994a9404602ddf741

Observation d3e1723c-c7c0-41c8-bf3b-22dc0b63cf13 · outbound

This paper cites Note on induced paths in sparse random graphs.

Concentration of the maximum size of an induced subtree in moderately sparse random graphs Note on induced paths in sparse random graphs

Reference 19

Resolution
verified exact
local_arxiv, observed 2026-08-07T11:31:20.939792Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-07T11:31:20.866763Z digest=sha256:e9fe6c91686123f17cecd099f2bf9ade84795a660a99174bd691e9c463af1d49

Observation d2b13038-742b-4408-bc22-b71a7719bc5b · outbound

This paper cites Random Graphs.

Concentration of the maximum size of an induced subtree in moderately sparse random graphs Random Graphs

Reference 20

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:31:21.077626Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-07T11:31:20.871272Z digest=sha256:a00d14bfdee787658f397602177a9fc2470882794c6b64702e696f0851a798fd

Observation bb2ecfee-fa7c-4d4d-98d6-0a1d092ad2d5 · outbound

This paper cites Maximum sparse induced subgraphs of the binomial random graph with given number of edges.

Concentration of the maximum size of an induced subtree in moderately sparse random graphs Maximum sparse induced subgraphs of the binomial random graph with given number of edges

Reference 21

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:31:21.064534Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-07T11:31:20.875121Z digest=sha256:102bc20ec1f7e67d76b155c009f901938201659ecb28c8f6d02b59b0c1c133ca

Observation 5dac3cea-6669-4a84-aa0f-37a9504951b4 · outbound

This paper cites Maximum induced forests in random graphs.

Concentration of the maximum size of an induced subtree in moderately sparse random graphs Maximum induced forests in random graphs

Reference 22

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:31:21.050952Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-07T11:31:20.879438Z digest=sha256:1a28857bedb4a7579194db8dfcaf295b376c41aa941f8e8f2a3ac61d3a48e1bd

Observation 9295b8e5-298d-472d-9fc1-b9cb1feb8ecf · outbound

This paper cites On the probability of independent sets in random graphs.

Concentration of the maximum size of an induced subtree in moderately sparse random graphs On the probability of independent sets in random graphs

Reference 23

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:31:21.037769Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-07T11:31:20.883472Z digest=sha256:c66a6729e3e57a544405e2946e78a5cef1a8d65523ed278bbd9985ba01f592b4

Observation 3657d7dc-4b1d-4156-bea2-1f975783ea73 · outbound

This paper cites The largest clique size in a random graph.

Concentration of the maximum size of an induced subtree in moderately sparse random graphs The largest clique size in a random graph

Reference 24

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:31:21.023464Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-07T11:31:20.887781Z digest=sha256:3ee5169f2e92241144c20b071fc05d1c63dd3243b67c02b24af039fd186a3a4b

Observation f1c05d4f-3cfa-4461-8047-44c6bb08fa2c · outbound

This paper cites Counting Labelled Trees.

Concentration of the maximum size of an induced subtree in moderately sparse random graphs Counting Labelled Trees

Reference 25

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:31:21.009233Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-07T11:31:20.892365Z digest=sha256:c219fe5fa53577d1012d22429a8e1c2eabde63b1bc19c1e4fcb933b0eba4dcd9

Observation e9afe6a4-fb78-4340-8b91-b3803dc3febf · outbound

This paper cites Random graphs: models and asymptotic characteris- tics.

Concentration of the maximum size of an induced subtree in moderately sparse random graphs Random graphs: models and asymptotic characteris- tics

Reference 26

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:31:20.994753Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-07T11:31:20.896037Z digest=sha256:00a1b7553c03f297cbfc092aaf41143ad49a788461025a2e6f8743b3595d5bb3

Pith citing papers

No inbound Pith citation observations are available.