{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:6UEGYHJ3PRIHQKIGHGGEHFVZMC","short_pith_number":"pith:6UEGYHJ3","schema_version":"1.0","canonical_sha256":"f5086c1d3b7c50782906398c4396b960990288b4b0d28821a214bcb546a75d57","source":{"kind":"arxiv","id":"1411.3417","version":2},"attestation_state":"computed","paper":{"title":"Scaling limits of random graph models at criticality: Universality and the basin of attraction of the Erd\\H{o}s-R\\'enyi random graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Nicolas Broutin, Sanchayan Sen, Shankar Bhamidi, Xuan Wang","submitted_at":"2014-11-13T01:48:20Z","abstract_excerpt":"A wide array of random graph models have been postulated to understand properties of observed networks. Typically these models have a parameter $t$ and a critical time $t_c$ when a giant component emerges. It is conjectured that for a large class of models, the nature of this emergence is similar to that of the Erd\\H{o}s-R\\'enyi random graph, in the sense that (a) the sizes of the maximal components in the critical regime scale like $n^{2/3}$, and (b) the structure of the maximal components at criticality (rescaled by $n^{-1/3}$) converges to random fractals. To date, (a) has been proven for a"},"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":"1411.3417","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-11-13T01:48:20Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"bc78ce139da54e9d89a1392368c563513d964757c638aacf56c5bfba633c0b39","abstract_canon_sha256":"6a2ea35a3576d7da8db1ade8d0942b910f40e5bccb1572e0ca43b01e5392fa26"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:48:31.015488Z","signature_b64":"orvjLIC1VTkJPnZFW0jy8LfcT6cqh/TpG2EqHRAxucjtVmcSLWiq9t8rKPUpCOvDyZpFf+hAEdT/YHf9l37WAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5086c1d3b7c50782906398c4396b960990288b4b0d28821a214bcb546a75d57","last_reissued_at":"2026-07-05T02:48:31.015140Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:48:31.015140Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scaling limits of random graph models at criticality: Universality and the basin of attraction of the Erd\\H{o}s-R\\'enyi random graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Nicolas Broutin, Sanchayan Sen, Shankar Bhamidi, Xuan Wang","submitted_at":"2014-11-13T01:48:20Z","abstract_excerpt":"A wide array of random graph models have been postulated to understand properties of observed networks. Typically these models have a parameter $t$ and a critical time $t_c$ when a giant component emerges. It is conjectured that for a large class of models, the nature of this emergence is similar to that of the Erd\\H{o}s-R\\'enyi random graph, in the sense that (a) the sizes of the maximal components in the critical regime scale like $n^{2/3}$, and (b) the structure of the maximal components at criticality (rescaled by $n^{-1/3}$) converges to random fractals. To date, (a) has been proven for a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.3417","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/1411.3417/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":"1411.3417","created_at":"2026-07-05T02:48:31.015193+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.3417v2","created_at":"2026-07-05T02:48:31.015193+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.3417","created_at":"2026-07-05T02:48:31.015193+00:00"},{"alias_kind":"pith_short_12","alias_value":"6UEGYHJ3PRIH","created_at":"2026-07-05T02:48:31.015193+00:00"},{"alias_kind":"pith_short_16","alias_value":"6UEGYHJ3PRIHQKIG","created_at":"2026-07-05T02:48:31.015193+00:00"},{"alias_kind":"pith_short_8","alias_value":"6UEGYHJ3","created_at":"2026-07-05T02:48:31.015193+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.04403","citing_title":"On breadth-first constructions of scaling limits of random graphs and random unicellular maps","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6UEGYHJ3PRIHQKIGHGGEHFVZMC","json":"https://pith.science/pith/6UEGYHJ3PRIHQKIGHGGEHFVZMC.json","graph_json":"https://pith.science/api/pith-number/6UEGYHJ3PRIHQKIGHGGEHFVZMC/graph.json","events_json":"https://pith.science/api/pith-number/6UEGYHJ3PRIHQKIGHGGEHFVZMC/events.json","paper":"https://pith.science/paper/6UEGYHJ3"},"agent_actions":{"view_html":"https://pith.science/pith/6UEGYHJ3PRIHQKIGHGGEHFVZMC","download_json":"https://pith.science/pith/6UEGYHJ3PRIHQKIGHGGEHFVZMC.json","view_paper":"https://pith.science/paper/6UEGYHJ3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.3417&json=true","fetch_graph":"https://pith.science/api/pith-number/6UEGYHJ3PRIHQKIGHGGEHFVZMC/graph.json","fetch_events":"https://pith.science/api/pith-number/6UEGYHJ3PRIHQKIGHGGEHFVZMC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6UEGYHJ3PRIHQKIGHGGEHFVZMC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6UEGYHJ3PRIHQKIGHGGEHFVZMC/action/storage_attestation","attest_author":"https://pith.science/pith/6UEGYHJ3PRIHQKIGHGGEHFVZMC/action/author_attestation","sign_citation":"https://pith.science/pith/6UEGYHJ3PRIHQKIGHGGEHFVZMC/action/citation_signature","submit_replication":"https://pith.science/pith/6UEGYHJ3PRIHQKIGHGGEHFVZMC/action/replication_record"}},"created_at":"2026-07-05T02:48:31.015193+00:00","updated_at":"2026-07-05T02:48:31.015193+00:00"}