{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:2ROYIGR32ZJUAN5ZQHSGAM6UZS","short_pith_number":"pith:2ROYIGR3","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"},"canonical_sha256":"d45d841a3bd6534037b981e46033d4cc95136079424b0b18ae715cc390b50b90","source":{"kind":"arxiv","id":"1605.05764","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.05764","created_at":"2026-05-18T00:33:59Z"},{"alias_kind":"arxiv_version","alias_value":"1605.05764v2","created_at":"2026-05-18T00:33:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05764","created_at":"2026-05-18T00:33:59Z"},{"alias_kind":"pith_short_12","alias_value":"2ROYIGR32ZJU","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2ROYIGR32ZJUAN5Z","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2ROYIGR3","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:2ROYIGR32ZJUAN5ZQHSGAM6UZS","target":"record","payload":{"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"},"canonical_sha256":"d45d841a3bd6534037b981e46033d4cc95136079424b0b18ae715cc390b50b90","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"},"source_kind":"arxiv","source_id":"1605.05764","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:33:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bMwbxIpiA3LCg3g+ns59XfQWC3B9DJ63xNj5tPVTNnt+tMkjLjRXPw1pddcIKphHr7AiDFhRaeOvugL+7QQ4Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:25:44.067487Z"},"content_sha256":"acc16617fc15902e2dbd0d52efa479e8223c76ebaf00cfea8ce80e5bee34a189","schema_version":"1.0","event_id":"sha256:acc16617fc15902e2dbd0d52efa479e8223c76ebaf00cfea8ce80e5bee34a189"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:2ROYIGR32ZJUAN5ZQHSGAM6UZS","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:33:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F+Y5nlDBSL6oW3jY7CPl0uQwz6wNWX38wW/6QmBunsqD3QifjMh88RgmA1C/ZwrMdabMUnYuHR6pFX6mNblDAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:25:44.067835Z"},"content_sha256":"665625286a8e5e10ec51258608ce666d54286a964ea92d9b3739ce620321ad10","schema_version":"1.0","event_id":"sha256:665625286a8e5e10ec51258608ce666d54286a964ea92d9b3739ce620321ad10"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2ROYIGR32ZJUAN5ZQHSGAM6UZS/bundle.json","state_url":"https://pith.science/pith/2ROYIGR32ZJUAN5ZQHSGAM6UZS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2ROYIGR32ZJUAN5ZQHSGAM6UZS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T15:25:44Z","links":{"resolver":"https://pith.science/pith/2ROYIGR32ZJUAN5ZQHSGAM6UZS","bundle":"https://pith.science/pith/2ROYIGR32ZJUAN5ZQHSGAM6UZS/bundle.json","state":"https://pith.science/pith/2ROYIGR32ZJUAN5ZQHSGAM6UZS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2ROYIGR32ZJUAN5ZQHSGAM6UZS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:2ROYIGR32ZJUAN5ZQHSGAM6UZS","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":"d1fc8d9578e3964348b3bef68e5cc715002c420cb7ca711186f49ac663269efa","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-18T21:47:56Z","title_canon_sha256":"cf94e174cb6f5063c7469320fbbb32847ae938c73a7a502bd09ecc9255234f18"},"schema_version":"1.0","source":{"id":"1605.05764","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.05764","created_at":"2026-05-18T00:33:59Z"},{"alias_kind":"arxiv_version","alias_value":"1605.05764v2","created_at":"2026-05-18T00:33:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05764","created_at":"2026-05-18T00:33:59Z"},{"alias_kind":"pith_short_12","alias_value":"2ROYIGR32ZJU","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2ROYIGR32ZJUAN5Z","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2ROYIGR3","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:665625286a8e5e10ec51258608ce666d54286a964ea92d9b3739ce620321ad10","target":"graph","created_at":"2026-05-18T00:33:59Z","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 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$.","authors_text":"Carlos Hoppen, Cristiane M. Sato, Roberto F. Parente","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-18T21:47:56Z","title":"Packing arborescences in random digraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05764","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:acc16617fc15902e2dbd0d52efa479e8223c76ebaf00cfea8ce80e5bee34a189","target":"record","created_at":"2026-05-18T00:33:59Z","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":"d1fc8d9578e3964348b3bef68e5cc715002c420cb7ca711186f49ac663269efa","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-18T21:47:56Z","title_canon_sha256":"cf94e174cb6f5063c7469320fbbb32847ae938c73a7a502bd09ecc9255234f18"},"schema_version":"1.0","source":{"id":"1605.05764","kind":"arxiv","version":2}},"canonical_sha256":"d45d841a3bd6534037b981e46033d4cc95136079424b0b18ae715cc390b50b90","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d45d841a3bd6534037b981e46033d4cc95136079424b0b18ae715cc390b50b90","first_computed_at":"2026-05-18T00:33:59.993432Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:59.993432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"37eaAHZdz2J5MYE/u3sy+yG83HRVDAqOuql6o7MvTSDlId2W3NEbFyTgpjTBRG+Gr3c4i6l5hn5OinI++o8QDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:59.994159Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.05764","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:acc16617fc15902e2dbd0d52efa479e8223c76ebaf00cfea8ce80e5bee34a189","sha256:665625286a8e5e10ec51258608ce666d54286a964ea92d9b3739ce620321ad10"],"state_sha256":"4e066e062c57edcd60abab282410949329aa8bf0d9217b2ee71ddd650e6b5cf7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8Bjuy3NMjpF8zitrC2+I4iDkvMrdGhYUVZUzOpw/sgubNyvMRScQH1+Ab1bEJ/Pg3dgry1Ek7dNF0VMNV/NCBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T15:25:44.069831Z","bundle_sha256":"4e6fe33ee9298dad4b660f7937fe2588c92cf8a02a671de85555e3cf2c2357bd"}}