{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:4ITRDMBP4HOR4V4X6YJ4YL5YVU","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ba403bedc9f4efe7b04679576fb262940f20407d333576688a72be23e170436b","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-11-07T09:39:33Z","title_canon_sha256":"271467232cf4f5fa6d4427b629cebe8fffb2d4a3f2cdfe23ae5d0f13f8a25e89"},"schema_version":"1.0","source":{"id":"1411.1865","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.1865","created_at":"2026-05-18T02:37:37Z"},{"alias_kind":"arxiv_version","alias_value":"1411.1865v2","created_at":"2026-05-18T02:37:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.1865","created_at":"2026-05-18T02:37:37Z"},{"alias_kind":"pith_short_12","alias_value":"4ITRDMBP4HOR","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4ITRDMBP4HOR4V4X","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4ITRDMBP","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:657ac3da7f6bbcc036442e024db4bf9d9463d015fc967a49d8f1e5d1733173cf","target":"graph","created_at":"2026-05-18T02:37:37Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We study the uniform random graph $\\mathsf{C}_n$ with $n$ vertices drawn from a subcritical class of connected graphs. Our main result is that the rescaled graph $\\mathsf{C}_n / \\sqrt{n}$ converges to the Brownian Continuum Random Tree $\\mathcal{T}_{\\mathsf{e}}$ multiplied by a constant scaling factor that depends on the class under consideration. In addition, we provide subgaussian tail bounds for the diameter $\\text{D}(\\mathsf{C}_n)$ and height $\\text{H}(\\mathsf{C}_n^\\bullet)$ of the rooted random graph $\\mathsf{C}_n^\\bullet$. We give analytic expressions for the scaling factor of several cl","authors_text":"Benedikt Stufler, Kerstin Weller, Konstantinos Panagiotou","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-11-07T09:39:33Z","title":"Scaling Limits of Random Graphs from Subcritical Classes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.1865","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:83fe2161da2b354c8ad8f5a2b940654ffdc756df9cdb520ff7fceb535dfd2cd2","target":"record","created_at":"2026-05-18T02:37:37Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ba403bedc9f4efe7b04679576fb262940f20407d333576688a72be23e170436b","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-11-07T09:39:33Z","title_canon_sha256":"271467232cf4f5fa6d4427b629cebe8fffb2d4a3f2cdfe23ae5d0f13f8a25e89"},"schema_version":"1.0","source":{"id":"1411.1865","kind":"arxiv","version":2}},"canonical_sha256":"e22711b02fe1dd1e5797f613cc2fb8ad2a27b44cab855d04893c88fa91c48b05","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e22711b02fe1dd1e5797f613cc2fb8ad2a27b44cab855d04893c88fa91c48b05","first_computed_at":"2026-05-18T02:37:37.925970Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:37:37.925970Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"66Gr2z+tewK9jLjMWu2OZjPgoFpswfS2pMAmgjJ+mpeTkW/saKyiVeTzCnQ+EswRvBsq7sTWFkYIrFi6rVDYCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:37:37.926442Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.1865","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:83fe2161da2b354c8ad8f5a2b940654ffdc756df9cdb520ff7fceb535dfd2cd2","sha256:657ac3da7f6bbcc036442e024db4bf9d9463d015fc967a49d8f1e5d1733173cf"],"state_sha256":"a277011f0739193e3fe6177e9245f073bdf393da7134ba4ed863f2dfd478ea1b"}