Pith. sign in

Paper Citation Record · LEDGER

The number of connected components in sub-critical random graph processes

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

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

pith.paper-citation-record.v1
2406.06380 v2

Coverage vector

measured 17 of 17 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-05-23T23:58:35.733203Z

measured 17 of 17 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 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

17 of 17 outbound references displayed

  • verified exact3
  • verified fuzzy11
  • unresolved3
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 481b7247-32be-4f99-b513-e0b3d333c3ca · outbound

This paper cites Aldous and V.

The number of connected components in sub-critical random graph processes Aldous and V

Reference 1

Resolution
verified fuzzy
raw_fallback, observed 2026-05-23T23:58:39.679873Z

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=arxiv_source observed=2026-05-23T23:58:35.733203Z digest=sha256:193215a93bd23a0e8a9d678d85d6a39c55c136b837acf767d3e6b003b07cbd5e

Observation 8764ddfa-5d0d-4031-b56d-2156491db077 · outbound

This paper cites Aldous, Brownian excursions, critical random graphs and the multiplicative coalescent, Ann.

The number of connected components in sub-critical random graph processes Aldous, Brownian excursions, critical random graphs and the multiplicative coalescent, Ann

Reference 2

Resolution
verified fuzzy
raw_fallback, observed 2026-05-23T23:58:39.675854Z

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=arxiv_source observed=2026-05-23T23:58:35.733203Z digest=sha256:819a5ca0826f2eaa4f69d64b6ba519b3e349f04732899e69f2b368936bec7690

Observation fcb09d92-067b-4dac-b35a-fa6c4bc5e2ad · outbound

This paper cites Billingsley, Convergence of probability measures, New York - London - Sydney - Toronto : John Wiley and Sons , Inc.

The number of connected components in sub-critical random graph processes Billingsley, Convergence of probability measures, New York - London - Sydney - Toronto : John Wiley and Sons , Inc

Reference 3

Resolution
verified fuzzy
raw_fallback, observed 2026-05-23T23:58:39.670963Z

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=arxiv_source observed=2026-05-23T23:58:35.733203Z digest=sha256:21833ece8608fd03a99c24e98d23731070431f11b8be7f0d09f5d58622487f51

Observation 24e7d1a3-54da-4136-916b-2c857931f868 · outbound

This paper cites ed., Wiley Ser.

The number of connected components in sub-critical random graph processes ed., Wiley Ser

Reference 4

Resolution
verified fuzzy
raw_fallback, observed 2026-05-23T23:58:39.666993Z

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=arxiv_source observed=2026-05-23T23:58:35.733203Z digest=sha256:c2c444aebc5d03c4801d34bc8c292ee153717f533ca5f36672543f1f8f40c467

Observation 074bb0d5-2efa-40c8-882e-1f8fb20616a4 · outbound

This paper cites A dynamical approach to spanning and surplus edges of random graphs.

The number of connected components in sub-critical random graph processes A dynamical approach to spanning and surplus edges of random graphs

Reference 6

Resolution
verified exact
arxiv_id, observed 2026-07-10T01:19:36.643126Z

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=arxiv_source observed=2026-05-23T23:58:35.733203Z digest=sha256:119e6a596341115604ba645687d6c1c8f3dddabd75c0c0fea225c8a9f7847e07

Observation d6c93d7b-0e32-43db-bb91-c96c509c0b02 · outbound

This paper cites Del Moral and S.

The number of connected components in sub-critical random graph processes Del Moral and S

Reference 7

Resolution
verified fuzzy
raw_fallback, observed 2026-05-23T23:58:39.663376Z

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=arxiv_source observed=2026-05-23T23:58:35.733203Z digest=sha256:88ef5827e344872e706d5f46b6cfa79f6b980b83216802bf4ea4cc90b3c672e2

Observation faa3e844-86fc-45b7-847a-4aca605b39d3 · outbound

This paper cites The process of fluctuations of the giant component of an Erd\H{o}s-R\'enyi graph.

The number of connected components in sub-critical random graph processes The process of fluctuations of the giant component of an Erd\H{o}s-R\'enyi graph

Reference 8

Resolution
verified exact
arxiv_id, observed 2026-05-23T23:58:38.205123Z

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=arxiv_source observed=2026-05-23T23:58:35.733203Z digest=sha256:36f83a117c119b979c7bc0a1ba99a3858d7d9b2eff4d659c9910d8265aa679ab

Observation 0806aa79-7568-4d3a-8ef6-6561fbec3c84 · outbound

This paper cites an unresolved cited work.

The number of connected components in sub-critical random graph processes Unresolved cited work

Reference 9

Resolution
unresolved
raw_fallback, observed 2026-05-23T23:58:39.659725Z

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=arxiv_source observed=2026-05-23T23:58:35.733203Z digest=sha256:7b796f6aad73a87d168cd7d16cb8bfa361f00b157204a3edddd92e4079e3e202

Observation 87bebbdd-8b88-4953-8d16-55765ddbbdd0 · outbound

This paper cites Erd o s and A.

The number of connected components in sub-critical random graph processes Erd o s and A

Reference 10

Resolution
verified fuzzy
raw_fallback, observed 2026-05-23T23:58:39.655966Z

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=arxiv_source observed=2026-05-23T23:58:35.733203Z digest=sha256:29a177188bccb4acb1b639e9603e1089d475a00fe26b279654d2950fa7d30ce8

Observation 5fbbf2b5-46b5-4379-a8b6-bfd4be6ed4b7 · outbound

This paper cites On Moments of Multiplicative Coalescents.

The number of connected components in sub-critical random graph processes On Moments of Multiplicative Coalescents

Reference 11

Resolution
verified exact
arxiv_id, observed 2026-05-23T23:58:38.197714Z

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=arxiv_source observed=2026-05-23T23:58:35.733203Z digest=sha256:795292488b8db0687136fca8bde69054f7ad0b3b482530010d2c78c1414b49e1

Observation 1cef18c5-a4f1-485d-8cad-07a64883b2e7 · outbound

This paper cites Limic, Properties of the multiplicative coalescent, Ph.D.

The number of connected components in sub-critical random graph processes Limic, Properties of the multiplicative coalescent, Ph.D

Reference 12

Resolution
verified fuzzy
raw_fallback, observed 2026-05-23T23:58:39.652338Z

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=arxiv_source observed=2026-05-23T23:58:35.733203Z digest=sha256:e872960fc66a340795fad06de3557b51f0be38497a5b801d79490e4c8695defe

Observation 90548998-9f41-40c5-8675-deca12d86efe · outbound

This paper cites Limic, The eternal multiplicative coalescent encoding via excursions of L \'e vy -type processes , Bernoulli 25 (2019), no.

The number of connected components in sub-critical random graph processes Limic, The eternal multiplicative coalescent encoding via excursions of L \'e vy -type processes , Bernoulli 25 (2019), no

Reference 13

Resolution
verified fuzzy
raw_fallback, observed 2026-05-23T23:58:39.641155Z

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=arxiv_source observed=2026-05-23T23:58:35.733203Z digest=sha256:74c5fcfd4aade559d7474f2621b4b8e23bceb55877f89179c8e88fe768c407b3

Observation ab19af1a-84e5-4ddc-ba02-2f9bce1a368c · outbound

This paper cites Norros and H.

The number of connected components in sub-critical random graph processes Norros and H

Reference 14

Resolution
verified fuzzy
raw_fallback, observed 2026-05-23T23:58:39.636308Z

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=arxiv_source observed=2026-05-23T23:58:35.733203Z digest=sha256:adc1805898c2be5a3c944702ae2a34877ce4b45b28e49a97f4fe97dcd23850b6

Observation b96a0491-634b-41e0-b74e-2a09110a130a · outbound

This paper cites an unresolved cited work.

The number of connected components in sub-critical random graph processes Unresolved cited work

Reference 15

Resolution
unresolved
raw_fallback, observed 2026-05-23T23:58:39.630766Z

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=arxiv_source observed=2026-05-23T23:58:35.733203Z digest=sha256:a291e9d02f65ce9172fd9cfb0c0b28d21f9dcbdafbec3a994c326badafe9bb8d

Observation afc82dfc-3022-46c0-8794-05e4c5b05714 · outbound

This paper cites an unresolved cited work.

The number of connected components in sub-critical random graph processes Unresolved cited work

Reference 16

Resolution
unresolved
raw_fallback, observed 2026-05-23T23:58:39.687444Z

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=arxiv_source observed=2026-05-23T23:58:35.733203Z digest=sha256:8507bf5a1ec5c3b1c9207e5f08a823e00c82d3db2f27cc1e8c0892b7e4c67478

Observation a50901b9-2d46-4ab6-8a83-c3c57fc1c147 · outbound

This paper cites van der Hofstad, Random graphs and complex networks.

The number of connected components in sub-critical random graph processes van der Hofstad, Random graphs and complex networks

Reference 17

Resolution
verified fuzzy
raw_fallback, observed 2026-05-23T23:58:39.647916Z

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=arxiv_source observed=2026-05-23T23:58:35.733203Z digest=sha256:3f37a9d78e7c181a25c5417722eb34325f1161b890fd907786e90b04006ba3ce

Observation 2acb87df-aabb-4bbb-bc46-4836613b4742 · outbound

This paper cites Whitt, Proofs of the martingale FCLT , Probability Surveys 4 (2007), no.

The number of connected components in sub-critical random graph processes Whitt, Proofs of the martingale FCLT , Probability Surveys 4 (2007), no

Reference 18

Resolution
verified fuzzy
raw_fallback, observed 2026-05-23T23:58:39.684092Z

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=arxiv_source observed=2026-05-23T23:58:35.733203Z digest=sha256:ac611809e2848f7c7ad400ea3cc3a244e4023a65e2cb9b2d8ee8696c9903345d

Pith citing papers

No inbound Pith citation observations are available.