{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:MHAU3SI3OGMNU3MEW6XRNWISRV","short_pith_number":"pith:MHAU3SI3","schema_version":"1.0","canonical_sha256":"61c14dc91b7198da6d84b7af16d9128d7797fcf94766c527bcab13ac32449ab3","source":{"kind":"arxiv","id":"1303.3881","version":2},"attestation_state":"computed","paper":{"title":"Arboricity and spanning-tree packing in random graphs with an application to load balancing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Cristiane M. Sato, Pu Gao, Xavier P\\'erez-Gim\\'enez","submitted_at":"2013-03-15T19:53:12Z","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"},"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":"1303.3881","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-15T19:53:12Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"e655c1074a9b27ce0953aaaa56b4b5cc0b2e9adee669c008f5568904aa5d886f","abstract_canon_sha256":"cbf365f8655a1688d523ad955bb4f53090a4c159128e157d75e2908a67675605"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:58.812660Z","signature_b64":"5siNY8lShe5t459I80xszmEWjt+Lsha3vnOo4Yc3u6fzIL1jcCzUr1PEVzkxdjJ+jGvV4E9VDj6O/MpskMFmDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61c14dc91b7198da6d84b7af16d9128d7797fcf94766c527bcab13ac32449ab3","last_reissued_at":"2026-05-18T02:50:58.812091Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:58.812091Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Arboricity and spanning-tree packing in random graphs with an application to load balancing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Cristiane M. Sato, Pu Gao, Xavier P\\'erez-Gim\\'enez","submitted_at":"2013-03-15T19:53:12Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.3881","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":""},"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":"1303.3881","created_at":"2026-05-18T02:50:58.812178+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.3881v2","created_at":"2026-05-18T02:50:58.812178+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.3881","created_at":"2026-05-18T02:50:58.812178+00:00"},{"alias_kind":"pith_short_12","alias_value":"MHAU3SI3OGMN","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"MHAU3SI3OGMNU3ME","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"MHAU3SI3","created_at":"2026-05-18T12:27:52.871228+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MHAU3SI3OGMNU3MEW6XRNWISRV","json":"https://pith.science/pith/MHAU3SI3OGMNU3MEW6XRNWISRV.json","graph_json":"https://pith.science/api/pith-number/MHAU3SI3OGMNU3MEW6XRNWISRV/graph.json","events_json":"https://pith.science/api/pith-number/MHAU3SI3OGMNU3MEW6XRNWISRV/events.json","paper":"https://pith.science/paper/MHAU3SI3"},"agent_actions":{"view_html":"https://pith.science/pith/MHAU3SI3OGMNU3MEW6XRNWISRV","download_json":"https://pith.science/pith/MHAU3SI3OGMNU3MEW6XRNWISRV.json","view_paper":"https://pith.science/paper/MHAU3SI3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.3881&json=true","fetch_graph":"https://pith.science/api/pith-number/MHAU3SI3OGMNU3MEW6XRNWISRV/graph.json","fetch_events":"https://pith.science/api/pith-number/MHAU3SI3OGMNU3MEW6XRNWISRV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MHAU3SI3OGMNU3MEW6XRNWISRV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MHAU3SI3OGMNU3MEW6XRNWISRV/action/storage_attestation","attest_author":"https://pith.science/pith/MHAU3SI3OGMNU3MEW6XRNWISRV/action/author_attestation","sign_citation":"https://pith.science/pith/MHAU3SI3OGMNU3MEW6XRNWISRV/action/citation_signature","submit_replication":"https://pith.science/pith/MHAU3SI3OGMNU3MEW6XRNWISRV/action/replication_record"}},"created_at":"2026-05-18T02:50:58.812178+00:00","updated_at":"2026-05-18T02:50:58.812178+00:00"}