{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:RZ7SZH7C7QAMWQ4ZLDAHYW3MVL","short_pith_number":"pith:RZ7SZH7C","schema_version":"1.0","canonical_sha256":"8e7f2c9fe2fc00cb439958c07c5b6caafd267fcb7da66a5009425352ac136c08","source":{"kind":"arxiv","id":"1405.4022","version":2},"attestation_state":"computed","paper":{"title":"Asymptotic distribution of the numbers of vertices and arcs of the giant strong component in sparse random digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Boris Pittel, Daniel Poole","submitted_at":"2014-05-15T21:50:28Z","abstract_excerpt":"Two models of a random digraph on $n$ vertices, $D(n,\\text{Prob}(\\text{arc})=p)$ and $D(n,\\text{number of arcs}=m)$ are studied. In 1990, Karp for $D(n,p)$ and independently T. \\L uczak for $D(n,m=cn)$ proved that for $c>1$, with probability tending to 1, there is an unique strong component of size of order $n$. Karp showed, in fact, that the giant component has likely size asymptotic to $n\\theta^2$, where $\\theta=\\theta(c)$ is the unique positive root of $1-\\theta=e^{-c \\theta}$. In this paper we prove that, for both random digraphs, the joint distribution of the number of vertices and number"},"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":"1405.4022","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-05-15T21:50:28Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"1263bef52bcd319ec3c45d00bd568b15eb726c13c99a0ea16ed2f3185a985207","abstract_canon_sha256":"49320e6cebee6f7cdbea1e1966c0dfd21619632aee27ddbcbb67c4e4bcf3d6a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:03:55.596282Z","signature_b64":"zFrqgjiKtP7NGbsj3eSIYiI8AE4+YOemX+lxp84Y57EhJWMXHFGKvlvlR9czJJUTzb4gGyR9VeFFeBkipWJkAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e7f2c9fe2fc00cb439958c07c5b6caafd267fcb7da66a5009425352ac136c08","last_reissued_at":"2026-05-18T02:03:55.595485Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:03:55.595485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotic distribution of the numbers of vertices and arcs of the giant strong component in sparse random digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Boris Pittel, Daniel Poole","submitted_at":"2014-05-15T21:50:28Z","abstract_excerpt":"Two models of a random digraph on $n$ vertices, $D(n,\\text{Prob}(\\text{arc})=p)$ and $D(n,\\text{number of arcs}=m)$ are studied. In 1990, Karp for $D(n,p)$ and independently T. \\L uczak for $D(n,m=cn)$ proved that for $c>1$, with probability tending to 1, there is an unique strong component of size of order $n$. Karp showed, in fact, that the giant component has likely size asymptotic to $n\\theta^2$, where $\\theta=\\theta(c)$ is the unique positive root of $1-\\theta=e^{-c \\theta}$. In this paper we prove that, for both random digraphs, the joint distribution of the number of vertices and number"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.4022","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":""},"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":"1405.4022","created_at":"2026-05-18T02:03:55.595619+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.4022v2","created_at":"2026-05-18T02:03:55.595619+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.4022","created_at":"2026-05-18T02:03:55.595619+00:00"},{"alias_kind":"pith_short_12","alias_value":"RZ7SZH7C7QAM","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"RZ7SZH7C7QAMWQ4Z","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"RZ7SZH7C","created_at":"2026-05-18T12:28:46.137349+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/RZ7SZH7C7QAMWQ4ZLDAHYW3MVL","json":"https://pith.science/pith/RZ7SZH7C7QAMWQ4ZLDAHYW3MVL.json","graph_json":"https://pith.science/api/pith-number/RZ7SZH7C7QAMWQ4ZLDAHYW3MVL/graph.json","events_json":"https://pith.science/api/pith-number/RZ7SZH7C7QAMWQ4ZLDAHYW3MVL/events.json","paper":"https://pith.science/paper/RZ7SZH7C"},"agent_actions":{"view_html":"https://pith.science/pith/RZ7SZH7C7QAMWQ4ZLDAHYW3MVL","download_json":"https://pith.science/pith/RZ7SZH7C7QAMWQ4ZLDAHYW3MVL.json","view_paper":"https://pith.science/paper/RZ7SZH7C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.4022&json=true","fetch_graph":"https://pith.science/api/pith-number/RZ7SZH7C7QAMWQ4ZLDAHYW3MVL/graph.json","fetch_events":"https://pith.science/api/pith-number/RZ7SZH7C7QAMWQ4ZLDAHYW3MVL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RZ7SZH7C7QAMWQ4ZLDAHYW3MVL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RZ7SZH7C7QAMWQ4ZLDAHYW3MVL/action/storage_attestation","attest_author":"https://pith.science/pith/RZ7SZH7C7QAMWQ4ZLDAHYW3MVL/action/author_attestation","sign_citation":"https://pith.science/pith/RZ7SZH7C7QAMWQ4ZLDAHYW3MVL/action/citation_signature","submit_replication":"https://pith.science/pith/RZ7SZH7C7QAMWQ4ZLDAHYW3MVL/action/replication_record"}},"created_at":"2026-05-18T02:03:55.595619+00:00","updated_at":"2026-05-18T02:03:55.595619+00:00"}