{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:NEZ5W53R6QHBIX6DNO44F5HJV5","short_pith_number":"pith:NEZ5W53R","schema_version":"1.0","canonical_sha256":"6933db7771f40e145fc36bb9c2f4e9af61f60906e8fd5b25d542dd9998f2dcc1","source":{"kind":"arxiv","id":"2412.06995","version":2},"attestation_state":"computed","paper":{"title":"A novel approach to the giant component fluctuations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Josu\\'e Corujo, Sophie Lemaire, Vlada Limic","submitted_at":"2024-12-09T21:03:42Z","abstract_excerpt":"We present a novel approach to study the evolution of the size (i.e. the number of vertices) of the giant component of a random graph process. It is based on the exploration algorithm called simultaneous breadth-first walk, introduced by Limic in 2019, that encodes the dynamic of the evolution of the sizes of the connected components of a large class of random graph processes. We limit our study to the variant of the Erd\\H{o}s-R\\'enyi graph process $(G_n(s))_{s\\geq 0}$ with $n$ vertices where an edge connecting a pair of vertices appears at an exponential rate 1 waiting time, independently ove"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2412.06995","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2024-12-09T21:03:42Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"1c5b98c04e992683d0c9d386e92d7bc621f711eb3fc735daefbf7d7b7b77af26","abstract_canon_sha256":"bd5fb6395c3b49ddbdf333db32402b4f4bede48786fcd7c6925352599451a3d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:38:02.517358Z","signature_b64":"IYcyavxPvd/cgdRPuGnB1Rg/BX/h0XoSpQAqhwwxrBed9+oze2qdm8aNqEkbEGqY1wvXM0urwwRVfu3i2X2PDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6933db7771f40e145fc36bb9c2f4e9af61f60906e8fd5b25d542dd9998f2dcc1","last_reissued_at":"2026-07-05T11:38:02.516863Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:38:02.516863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A novel approach to the giant component fluctuations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Josu\\'e Corujo, Sophie Lemaire, Vlada Limic","submitted_at":"2024-12-09T21:03:42Z","abstract_excerpt":"We present a novel approach to study the evolution of the size (i.e. the number of vertices) of the giant component of a random graph process. It is based on the exploration algorithm called simultaneous breadth-first walk, introduced by Limic in 2019, that encodes the dynamic of the evolution of the sizes of the connected components of a large class of random graph processes. We limit our study to the variant of the Erd\\H{o}s-R\\'enyi graph process $(G_n(s))_{s\\geq 0}$ with $n$ vertices where an edge connecting a pair of vertices appears at an exponential rate 1 waiting time, independently ove"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.06995","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.06995/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2412.06995","created_at":"2026-07-05T11:38:02.516923+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.06995v2","created_at":"2026-07-05T11:38:02.516923+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.06995","created_at":"2026-07-05T11:38:02.516923+00:00"},{"alias_kind":"pith_short_12","alias_value":"NEZ5W53R6QHB","created_at":"2026-07-05T11:38:02.516923+00:00"},{"alias_kind":"pith_short_16","alias_value":"NEZ5W53R6QHBIX6D","created_at":"2026-07-05T11:38:02.516923+00:00"},{"alias_kind":"pith_short_8","alias_value":"NEZ5W53R","created_at":"2026-07-05T11:38:02.516923+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.01354","citing_title":"Fluctuations of the giant of Poisson random graphs","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NEZ5W53R6QHBIX6DNO44F5HJV5","json":"https://pith.science/pith/NEZ5W53R6QHBIX6DNO44F5HJV5.json","graph_json":"https://pith.science/api/pith-number/NEZ5W53R6QHBIX6DNO44F5HJV5/graph.json","events_json":"https://pith.science/api/pith-number/NEZ5W53R6QHBIX6DNO44F5HJV5/events.json","paper":"https://pith.science/paper/NEZ5W53R"},"agent_actions":{"view_html":"https://pith.science/pith/NEZ5W53R6QHBIX6DNO44F5HJV5","download_json":"https://pith.science/pith/NEZ5W53R6QHBIX6DNO44F5HJV5.json","view_paper":"https://pith.science/paper/NEZ5W53R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.06995&json=true","fetch_graph":"https://pith.science/api/pith-number/NEZ5W53R6QHBIX6DNO44F5HJV5/graph.json","fetch_events":"https://pith.science/api/pith-number/NEZ5W53R6QHBIX6DNO44F5HJV5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NEZ5W53R6QHBIX6DNO44F5HJV5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NEZ5W53R6QHBIX6DNO44F5HJV5/action/storage_attestation","attest_author":"https://pith.science/pith/NEZ5W53R6QHBIX6DNO44F5HJV5/action/author_attestation","sign_citation":"https://pith.science/pith/NEZ5W53R6QHBIX6DNO44F5HJV5/action/citation_signature","submit_replication":"https://pith.science/pith/NEZ5W53R6QHBIX6DNO44F5HJV5/action/replication_record"}},"created_at":"2026-07-05T11:38:02.516923+00:00","updated_at":"2026-07-05T11:38:02.516923+00:00"}