{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:7VFKSY26QDPEUR7SLOMQC2GGYS","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":"9a7c6351ef4e3a19091bcf2b1a6ad777e5dfdcef07e7682dcd0b72de7b6260bb","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-04-12T08:10:32Z","title_canon_sha256":"0ca0dc3ef56b26c05118868e3636e57fd0b630fed117b5af5efdc12898dc2f2f"},"schema_version":"1.0","source":{"id":"1104.2132","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.2132","created_at":"2026-05-18T04:02:15Z"},{"alias_kind":"arxiv_version","alias_value":"1104.2132v2","created_at":"2026-05-18T04:02:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.2132","created_at":"2026-05-18T04:02:15Z"},{"alias_kind":"pith_short_12","alias_value":"7VFKSY26QDPE","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"7VFKSY26QDPEUR7S","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"7VFKSY26","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:5b20d19fda9d2383e7f5d6e5af22a8472a8c9b7dbf3527a748e41209c8bd6d4a","target":"graph","created_at":"2026-05-18T04:02:15Z","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":"The tree-depth is a parameter introduced under several names as a measure of sparsity of a graph. We compute asymptotic values of the tree-depth of random graphs. For dense graphs, p>> 1/n, the tree-depth of a random graph G is a.a.s. td(G)=n-O(sqrt(n/p)). Random graphs with p=c/n, have a.a.s. linear tree-depth when c>1, the tree-depth is Theta (log n) when c=1 and Theta (loglog n) for c<1. The result for c>1 is derived from the computation of tree-width and provides a more direct proof of a conjecture by Gao on the linearity of tree-width recently proved by Lee, Lee and Oum. We also show that","authors_text":"Guillem Perarnau, Oriol Serra","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-04-12T08:10:32Z","title":"On the tree-depth of Random Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.2132","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:17b5facdfd1c44afbb236d4c1c29460e25f0fbcfb4e9bbe3153f950e9f718e06","target":"record","created_at":"2026-05-18T04:02:15Z","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":"9a7c6351ef4e3a19091bcf2b1a6ad777e5dfdcef07e7682dcd0b72de7b6260bb","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-04-12T08:10:32Z","title_canon_sha256":"0ca0dc3ef56b26c05118868e3636e57fd0b630fed117b5af5efdc12898dc2f2f"},"schema_version":"1.0","source":{"id":"1104.2132","kind":"arxiv","version":2}},"canonical_sha256":"fd4aa9635e80de4a47f25b990168c6c4bc5a110d8b749e09a2a52f0b3023a310","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fd4aa9635e80de4a47f25b990168c6c4bc5a110d8b749e09a2a52f0b3023a310","first_computed_at":"2026-05-18T04:02:15.158647Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:02:15.158647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4BCbYbUKxW0oxePtjsv8WSygD0OHLiyC+XKHSOQk0ahggeKTA4UzdIcjS8iFQWHMUZO0mirFeuMW0+AbgYPeCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:02:15.159130Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.2132","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:17b5facdfd1c44afbb236d4c1c29460e25f0fbcfb4e9bbe3153f950e9f718e06","sha256:5b20d19fda9d2383e7f5d6e5af22a8472a8c9b7dbf3527a748e41209c8bd6d4a"],"state_sha256":"95425cfcb51f7fd7dfbfae7a61e8884a7db00dd9f104e944a65a5c87a699864d"}