{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MHAU3SI3OGMNU3MEW6XRNWISRV","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":"cbf365f8655a1688d523ad955bb4f53090a4c159128e157d75e2908a67675605","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-15T19:53:12Z","title_canon_sha256":"e655c1074a9b27ce0953aaaa56b4b5cc0b2e9adee669c008f5568904aa5d886f"},"schema_version":"1.0","source":{"id":"1303.3881","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.3881","created_at":"2026-05-18T02:50:58Z"},{"alias_kind":"arxiv_version","alias_value":"1303.3881v2","created_at":"2026-05-18T02:50:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.3881","created_at":"2026-05-18T02:50:58Z"},{"alias_kind":"pith_short_12","alias_value":"MHAU3SI3OGMN","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MHAU3SI3OGMNU3ME","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MHAU3SI3","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:770a4c3d5ea0e49f03b6edd219b44279c08b561f1017698b2b1cca6b5f10b9b3","target":"graph","created_at":"2026-05-18T02:50:58Z","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 arboricity A and the maximum number T of edge-disjoint spanning trees of the Erdos-Renyi random graph G(n,p). For all p(n) in [0,1], we show that, with high probability, T is precisely the minimum between delta and floor(m/(n-1)), where delta is the smallest degree of the graph and m denotes the number of edges. Moreover, we explicitly determine a sharp threshold value for p such that: above this threshold, T equals floor(m/(n-1)) and A equals ceiling(m/(n-1)); and below this threshold, T equals delta, and we give a two-value concentration result for the arboricity A in that range","authors_text":"Cristiane M. Sato, Pu Gao, Xavier P\\'erez-Gim\\'enez","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-15T19:53:12Z","title":"Arboricity and spanning-tree packing in random graphs with an application to load balancing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.3881","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:1afcbd85a5e9d7d399d4ab455fa6e32f31e221b63a79f17e0e559474c78a2244","target":"record","created_at":"2026-05-18T02:50:58Z","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":"cbf365f8655a1688d523ad955bb4f53090a4c159128e157d75e2908a67675605","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-15T19:53:12Z","title_canon_sha256":"e655c1074a9b27ce0953aaaa56b4b5cc0b2e9adee669c008f5568904aa5d886f"},"schema_version":"1.0","source":{"id":"1303.3881","kind":"arxiv","version":2}},"canonical_sha256":"61c14dc91b7198da6d84b7af16d9128d7797fcf94766c527bcab13ac32449ab3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"61c14dc91b7198da6d84b7af16d9128d7797fcf94766c527bcab13ac32449ab3","first_computed_at":"2026-05-18T02:50:58.812091Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:50:58.812091Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5siNY8lShe5t459I80xszmEWjt+Lsha3vnOo4Yc3u6fzIL1jcCzUr1PEVzkxdjJ+jGvV4E9VDj6O/MpskMFmDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:50:58.812660Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.3881","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1afcbd85a5e9d7d399d4ab455fa6e32f31e221b63a79f17e0e559474c78a2244","sha256:770a4c3d5ea0e49f03b6edd219b44279c08b561f1017698b2b1cca6b5f10b9b3"],"state_sha256":"f52364b62dee25f7efbc495c89f2f1489633027e8d634f5bf42bc3f9b0b79b4b"}