{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:QGG6T24KQ4RQLYWFLZLONLLHAI","short_pith_number":"pith:QGG6T24K","schema_version":"1.0","canonical_sha256":"818de9eb8a872305e2c55e56e6ad67023eb1280e5c64c39e7aa12a5a99e9f21d","source":{"kind":"arxiv","id":"math/0502581","version":1},"attestation_state":"computed","paper":{"title":"Distances in random graphs with finite mean and infinite variance degrees","license":"","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Dmitri Znamenski, Gerard Hooghiemstra, Remco van der Hofstad","submitted_at":"2005-02-28T16:51:58Z","abstract_excerpt":"In this paper we study random graphs with independent and identically distributed degrees of which the tail of the distribution function is regularly varying with exponent $\\tau\\in (2,3)$.\n  The number of edges between two arbitrary nodes, also called the graph distance or hopcount, in a graph with $N$ nodes is investigated when $N\\to \\infty$. When $\\tau\\in (2,3)$, this graph distance grows like $2\\frac{\\log\\log N}{|\\log(\\tau-2)|}$. In different papers, the cases $\\tau>3$ and $\\tau\\in (1,2)$ have been studied. We also study the fluctuations around these asymptotic means, and describe their dis"},"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":"math/0502581","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.PR","submitted_at":"2005-02-28T16:51:58Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"156af9b42354a505db5ce2ea80f3597595754697573aad50001410799ba476c6","abstract_canon_sha256":"3c89726a399f1a27ace79fe8863d5964345ebf0516e8905ef5dec5d6fb7e4b2b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:23.713143Z","signature_b64":"IqGirRJRgvAbSVfQYNPHPaWXgXskkApHUyW6lMaAYh002EHsX2b5TR4BSBm1EXjy9pxpKPJFfLQDhFG8jv/iBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"818de9eb8a872305e2c55e56e6ad67023eb1280e5c64c39e7aa12a5a99e9f21d","last_reissued_at":"2026-05-18T01:05:23.712657Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:23.712657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distances in random graphs with finite mean and infinite variance degrees","license":"","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Dmitri Znamenski, Gerard Hooghiemstra, Remco van der Hofstad","submitted_at":"2005-02-28T16:51:58Z","abstract_excerpt":"In this paper we study random graphs with independent and identically distributed degrees of which the tail of the distribution function is regularly varying with exponent $\\tau\\in (2,3)$.\n  The number of edges between two arbitrary nodes, also called the graph distance or hopcount, in a graph with $N$ nodes is investigated when $N\\to \\infty$. When $\\tau\\in (2,3)$, this graph distance grows like $2\\frac{\\log\\log N}{|\\log(\\tau-2)|}$. In different papers, the cases $\\tau>3$ and $\\tau\\in (1,2)$ have been studied. We also study the fluctuations around these asymptotic means, and describe their dis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0502581","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"math/0502581","created_at":"2026-05-18T01:05:23.712735+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0502581v1","created_at":"2026-05-18T01:05:23.712735+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0502581","created_at":"2026-05-18T01:05:23.712735+00:00"},{"alias_kind":"pith_short_12","alias_value":"QGG6T24KQ4RQ","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_16","alias_value":"QGG6T24KQ4RQLYWF","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_8","alias_value":"QGG6T24K","created_at":"2026-05-18T12:25:53.335082+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QGG6T24KQ4RQLYWFLZLONLLHAI","json":"https://pith.science/pith/QGG6T24KQ4RQLYWFLZLONLLHAI.json","graph_json":"https://pith.science/api/pith-number/QGG6T24KQ4RQLYWFLZLONLLHAI/graph.json","events_json":"https://pith.science/api/pith-number/QGG6T24KQ4RQLYWFLZLONLLHAI/events.json","paper":"https://pith.science/paper/QGG6T24K"},"agent_actions":{"view_html":"https://pith.science/pith/QGG6T24KQ4RQLYWFLZLONLLHAI","download_json":"https://pith.science/pith/QGG6T24KQ4RQLYWFLZLONLLHAI.json","view_paper":"https://pith.science/paper/QGG6T24K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0502581&json=true","fetch_graph":"https://pith.science/api/pith-number/QGG6T24KQ4RQLYWFLZLONLLHAI/graph.json","fetch_events":"https://pith.science/api/pith-number/QGG6T24KQ4RQLYWFLZLONLLHAI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QGG6T24KQ4RQLYWFLZLONLLHAI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QGG6T24KQ4RQLYWFLZLONLLHAI/action/storage_attestation","attest_author":"https://pith.science/pith/QGG6T24KQ4RQLYWFLZLONLLHAI/action/author_attestation","sign_citation":"https://pith.science/pith/QGG6T24KQ4RQLYWFLZLONLLHAI/action/citation_signature","submit_replication":"https://pith.science/pith/QGG6T24KQ4RQLYWFLZLONLLHAI/action/replication_record"}},"created_at":"2026-05-18T01:05:23.712735+00:00","updated_at":"2026-05-18T01:05:23.712735+00:00"}