Pith. sign in

Paper Citation Record · LEDGER

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

As of 8 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-08T06:32:00.761636+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-08T06:32:00.761636+00:00.

source=pdf_text observed=2026-08-07T11:31:19.639315Z digest=sha256:6be4cd9b2a0487b4edfea7575f0d476be089f2fc65f486c56be20cbad892b4be

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

source=pdf_text observed=2026-08-07T11:31:19.837939Z digest=sha256:7a4a6507d9f7ef8e2e0bf4083c152f26346405d5cda9ab398e408b01a0288a54

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

source=pdf_text observed=2026-08-07T11:31:20.032718Z digest=sha256:887833f7ce59830f7b17444292a3c7d257bc4cb63dff06d7f950ee7f294e72b9

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

source=pdf_text observed=2026-08-07T11:31:20.277412Z digest=sha256:610f739c5a9af9700fed76ff9f21078b2a35ad0326cacef3640368a060beb82f

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

source=pdf_text observed=2026-08-07T11:31:20.523444Z digest=sha256:80f741547465febf06e080c85113f9d13553d506cc27741aae2ec831ea955a46

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

source=pdf_text observed=2026-08-07T11:31:20.850240Z digest=sha256:6cc69aedb5a55267b59d106b4f56d65968bbecb8d854084eed1345791410be28

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-08T06:32:00.761636+00:00.

source=pdf_text observed=2026-08-07T11:31:20.854558Z digest=sha256:5fa7ace224be6c59b8ffeb0683a016ca4c276d985ff30493c4461c5b51f4d9e3

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-08T06:32:00.761636+00:00.

source=pdf_text observed=2026-08-07T11:31:20.858918Z digest=sha256:7c1e3f3c2c948db53ef65be6a8626bb10f3c70519ffcadef1d57d9d6dd33a23f

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-08T06:32:00.761636+00:00.

source=pdf_text observed=2026-08-07T11:31:20.862775Z digest=sha256:1ca44414be6e6fbfdb4ce335250564a56203374f70911c4a510aae456b3c304d

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

source=pdf_text observed=2026-08-07T11:31:20.879438Z digest=sha256:6a678468b088beda336565514bcf68b37840c60567f0009ef75030848c9d039a

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

source=pdf_text observed=2026-08-07T11:31:20.887781Z digest=sha256:9eb47dfb065c7219ee71b629fdd0e4cfe23614e6852eb82c1e71fddfb95fb0af

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

source=pdf_text observed=2026-08-07T11:31:20.896037Z digest=sha256:881f461c9d3108f3339b34b39d3e03d5d23e8cc64be5b41ed5aa8bc6b7b30978

Pith citing papers

No inbound Pith citation observations are available.