{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:2ROYIGR32ZJUAN5ZQHSGAM6UZS","short_pith_number":"pith:2ROYIGR3","schema_version":"1.0","canonical_sha256":"d45d841a3bd6534037b981e46033d4cc95136079424b0b18ae715cc390b50b90","source":{"kind":"arxiv","id":"1605.05764","version":2},"attestation_state":"computed","paper":{"title":"Packing arborescences in random digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Carlos Hoppen, Cristiane M. Sato, Roberto F. Parente","submitted_at":"2016-05-18T21:47:56Z","abstract_excerpt":"We study the problem of packing arborescences in the random digraph $\\mathcal D(n,p)$, where each possible arc is included uniformly at random with probability $p=p(n)$. Let $\\lambda(\\mathcal D(n,p))$ denote the largest integer $\\lambda\\geq 0$ such that, for all $0\\leq \\ell\\leq \\lambda$, we have $\\sum_{i=0}^{\\ell-1} (\\ell-i)|\\{v: d^{in}(v) = i\\}| \\leq \\ell$. We show that the maximum number of arc-disjoint arborescences in $\\mathcal D(n,p)$ is $\\lambda(\\mathcal D(n,p))$ a.a.s. We also give tight estimates for $\\lambda(\\mathcal D(n,p))$ depending on the range of $p$."},"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":"1605.05764","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-18T21:47:56Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"cf94e174cb6f5063c7469320fbbb32847ae938c73a7a502bd09ecc9255234f18","abstract_canon_sha256":"d1fc8d9578e3964348b3bef68e5cc715002c420cb7ca711186f49ac663269efa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:59.994159Z","signature_b64":"37eaAHZdz2J5MYE/u3sy+yG83HRVDAqOuql6o7MvTSDlId2W3NEbFyTgpjTBRG+Gr3c4i6l5hn5OinI++o8QDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d45d841a3bd6534037b981e46033d4cc95136079424b0b18ae715cc390b50b90","last_reissued_at":"2026-05-18T00:33:59.993432Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:59.993432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Packing arborescences in random digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Carlos Hoppen, Cristiane M. Sato, Roberto F. Parente","submitted_at":"2016-05-18T21:47:56Z","abstract_excerpt":"We study the problem of packing arborescences in the random digraph $\\mathcal D(n,p)$, where each possible arc is included uniformly at random with probability $p=p(n)$. Let $\\lambda(\\mathcal D(n,p))$ denote the largest integer $\\lambda\\geq 0$ such that, for all $0\\leq \\ell\\leq \\lambda$, we have $\\sum_{i=0}^{\\ell-1} (\\ell-i)|\\{v: d^{in}(v) = i\\}| \\leq \\ell$. We show that the maximum number of arc-disjoint arborescences in $\\mathcal D(n,p)$ is $\\lambda(\\mathcal D(n,p))$ a.a.s. We also give tight estimates for $\\lambda(\\mathcal D(n,p))$ depending on the range of $p$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05764","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":"1605.05764","created_at":"2026-05-18T00:33:59.993574+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.05764v2","created_at":"2026-05-18T00:33:59.993574+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05764","created_at":"2026-05-18T00:33:59.993574+00:00"},{"alias_kind":"pith_short_12","alias_value":"2ROYIGR32ZJU","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"2ROYIGR32ZJUAN5Z","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"2ROYIGR3","created_at":"2026-05-18T12:29:55.572404+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/2ROYIGR32ZJUAN5ZQHSGAM6UZS","json":"https://pith.science/pith/2ROYIGR32ZJUAN5ZQHSGAM6UZS.json","graph_json":"https://pith.science/api/pith-number/2ROYIGR32ZJUAN5ZQHSGAM6UZS/graph.json","events_json":"https://pith.science/api/pith-number/2ROYIGR32ZJUAN5ZQHSGAM6UZS/events.json","paper":"https://pith.science/paper/2ROYIGR3"},"agent_actions":{"view_html":"https://pith.science/pith/2ROYIGR32ZJUAN5ZQHSGAM6UZS","download_json":"https://pith.science/pith/2ROYIGR32ZJUAN5ZQHSGAM6UZS.json","view_paper":"https://pith.science/paper/2ROYIGR3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.05764&json=true","fetch_graph":"https://pith.science/api/pith-number/2ROYIGR32ZJUAN5ZQHSGAM6UZS/graph.json","fetch_events":"https://pith.science/api/pith-number/2ROYIGR32ZJUAN5ZQHSGAM6UZS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2ROYIGR32ZJUAN5ZQHSGAM6UZS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2ROYIGR32ZJUAN5ZQHSGAM6UZS/action/storage_attestation","attest_author":"https://pith.science/pith/2ROYIGR32ZJUAN5ZQHSGAM6UZS/action/author_attestation","sign_citation":"https://pith.science/pith/2ROYIGR32ZJUAN5ZQHSGAM6UZS/action/citation_signature","submit_replication":"https://pith.science/pith/2ROYIGR32ZJUAN5ZQHSGAM6UZS/action/replication_record"}},"created_at":"2026-05-18T00:33:59.993574+00:00","updated_at":"2026-05-18T00:33:59.993574+00:00"}