Pith. sign in

Paper Citation Record · LEDGER

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

As of 10 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-10T06:31:04.303077+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-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-05-23T23:58:35.733203Z digest=sha256:b4dfb7d346c13e6128a8263e3f8272faac0c8e7dbddbd1ed160d86a8fca8d786

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-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-05-23T23:58:35.733203Z digest=sha256:670032c68e3b0209f376aac75023140e3caf96683c61184a5eb0053b59166a13

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-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-05-23T23:58:35.733203Z digest=sha256:76f202907918602391abb8064a16f3f2bcdae75bdf7f6881512f78be7fad9f1c

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-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-05-23T23:58:35.733203Z digest=sha256:8cdc286601583bae8a0c6cce9eb624c703543e4798bc2703a73674e4ff723e3e

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-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-05-23T23:58:35.733203Z digest=sha256:1d6adb19988491d3f15bb390c045313d8b69d96336ed4eabc8139585854157e4

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-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-05-23T23:58:35.733203Z digest=sha256:f2a760389231c783f8cca7d83f66b8ad66d13729e46c445b7d6654641c4a156c

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-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-05-23T23:58:35.733203Z digest=sha256:a41924bf3847715fb6aa61b7a572b3d54166acefa341d2293551573b3470a7cb

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-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-05-23T23:58:35.733203Z digest=sha256:daa53f8a3cb0d26f99e07e2aab70c1661ac366f85c855220385ded234825a8db

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-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-05-23T23:58:35.733203Z digest=sha256:e60ada1a8455688bc28de97550846f7055b0fb74b827706896586f4a51f29211

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-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-05-23T23:58:35.733203Z digest=sha256:1e4dc1762a5974a0963b0eb4f5714ddce6292955716f92fcdd3a5d68538d3bd7

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-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-05-23T23:58:35.733203Z digest=sha256:b82b21f3fd846a24eb92257e66799528f7ba0f6f99381b5fd958bd08bf8e155e

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-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-05-23T23:58:35.733203Z digest=sha256:20c2ccaf173f57a22093a7203179689e377c3660e1c90c148b918b6444e04415

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-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-05-23T23:58:35.733203Z digest=sha256:fda3932f3d9a733d75641fa3bdcbd7a55676bb10ecf71d6e3f62d18f3b570fba

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-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-05-23T23:58:35.733203Z digest=sha256:49e24fee064cf8d6c3f9004fbbf3a8302dd2638041bd7cb7760ba2b5c4f3ff6d

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-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-05-23T23:58:35.733203Z digest=sha256:3be7e2d627832cf6c5d8451585bf90233809b594ca4fef395132699f5a31c7c0

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-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-05-23T23:58:35.733203Z digest=sha256:fc247e02d76bd735d2937f7c5144ff19e017a28e6e63a7be6ec7dd0c5e2ffda5

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-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-05-23T23:58:35.733203Z digest=sha256:df058d25f821308759520baca58229a0b031a768b8e4a199aea62183094ae518

Pith citing papers

No inbound Pith citation observations are available.