{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:SEOZACZGGUD5XVYFOOLVEIFTC3","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":"82981670273cd7c55ed8e41c80d84eb706feae750c7ef6936d73f3275421f26d","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-19T13:53:26Z","title_canon_sha256":"0009da2422cb9a4ad9822183de0ba7aa27b016fbed26e8ec4824a05b8ef92ccf"},"schema_version":"1.0","source":{"id":"1907.08517","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.08517","created_at":"2026-07-05T02:22:21Z"},{"alias_kind":"arxiv_version","alias_value":"1907.08517v3","created_at":"2026-07-05T02:22:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.08517","created_at":"2026-07-05T02:22:21Z"},{"alias_kind":"pith_short_12","alias_value":"SEOZACZGGUD5","created_at":"2026-07-05T02:22:21Z"},{"alias_kind":"pith_short_16","alias_value":"SEOZACZGGUD5XVYF","created_at":"2026-07-05T02:22:21Z"},{"alias_kind":"pith_short_8","alias_value":"SEOZACZG","created_at":"2026-07-05T02:22:21Z"}],"graph_snapshots":[{"event_id":"sha256:e136d062845ba1feef8c4d4cd051f986e06a30ba77fd1752ea4b14f58c58367d","target":"graph","created_at":"2026-07-05T02:22:21Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1907.08517/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider uniform random cographs (either labeled or unlabeled) of large size. Our first main result is the convergence towards a Brownian limiting object in the space of graphons. We then show that the degree of a uniform random vertex in a uniform cograph is of order $n$, and converges after normalization to the Lebesgue measure on $[0,1]$. We finally analyze the vertex connectivity (i.e. the minimal number of vertices whose removal disconnects the graph) of random connected cographs, and show that this statistics converges in distribution without renormalization. Unlike for the graphon li","authors_text":"Adeline Pierrot, Fr\\'ed\\'erique Bassino, Lucas Gerin, Mathilde Bouvel, Micka\\\"el Maazoun, Valentin F\\'eray","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-19T13:53:26Z","title":"Random cographs: Brownian graphon limit and asymptotic degree distribution"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.08517","kind":"arxiv","version":3},"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:1ed256ae8f142fb06219ec3d999b3524f2ead27764bba19f01348e105668d2a5","target":"record","created_at":"2026-07-05T02:22:21Z","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":"82981670273cd7c55ed8e41c80d84eb706feae750c7ef6936d73f3275421f26d","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-19T13:53:26Z","title_canon_sha256":"0009da2422cb9a4ad9822183de0ba7aa27b016fbed26e8ec4824a05b8ef92ccf"},"schema_version":"1.0","source":{"id":"1907.08517","kind":"arxiv","version":3}},"canonical_sha256":"911d900b263507dbd70573975220b316cf8a88e1f9f449b98a4d40bd7651036a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"911d900b263507dbd70573975220b316cf8a88e1f9f449b98a4d40bd7651036a","first_computed_at":"2026-07-05T02:22:21.024613Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:22:21.024613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Do423nYqu2wt7LUQNY0G2l91qYgUIYZ6mL5aJSZDBX8azei2pcV+p3Hpcm3P56ugptwfOksuk2PSAA852htWDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:22:21.024945Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.08517","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1ed256ae8f142fb06219ec3d999b3524f2ead27764bba19f01348e105668d2a5","sha256:e136d062845ba1feef8c4d4cd051f986e06a30ba77fd1752ea4b14f58c58367d"],"state_sha256":"541c8b68322ff4c36488bcc269d27897718016f70a8fdf2f46ba959812ce407c"}