{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:YN5QEPUQDCJR3BXRXOY6IELFN4","short_pith_number":"pith:YN5QEPUQ","schema_version":"1.0","canonical_sha256":"c37b023e9018931d86f1bbb1e411656f0d2bf6e2ad9d03a8ba616ee82bf3ae93","source":{"kind":"arxiv","id":"2502.01631","version":1},"attestation_state":"computed","paper":{"title":"Minimum degree edge-disjoint Hamilton cycles in random directed graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adva Mond, Asaf Ferber","submitted_at":"2025-02-03T18:58:25Z","abstract_excerpt":"In this paper we consider the problem of finding ``as many edge-disjoint Hamilton cycles as possible'' in the binomial random digraph $D_{n,p}$. We show that a typical $D_{n,p}$ contains precisely the minimum between the minimum out- and in-degrees many edge-disjoint Hamilton cycles, given that $p\\geq \\log^{15} n/n$, which is optimal up to a factor of poly$\\log n$.\n  Our proof provides a randomized algorithm to generate the cycles and uses a novel idea of generating $D_{n,p}$ in a sophisticated way that enables us to control some key properties, and on an ``online sprinkling'' idea as was intr"},"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":"2502.01631","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-02-03T18:58:25Z","cross_cats_sorted":[],"title_canon_sha256":"68a1e1d0f6142dbabe9a0e5983b03f342eeba77f18797105647de1fbd7925440","abstract_canon_sha256":"3144bb334b3b601de82b09201a609cbf4b816ff20a82528ef5fe248d95c1604d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:08:57.263608Z","signature_b64":"ZeSqsUE5WeoXSmMh9/yrJJnfMI9ifU+y0zNEqGxwiURlxcZYRwLvjamZs1ED9Le6nizk95yAVl7KWZSBuATdCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c37b023e9018931d86f1bbb1e411656f0d2bf6e2ad9d03a8ba616ee82bf3ae93","last_reissued_at":"2026-07-05T10:08:57.263123Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:08:57.263123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum degree edge-disjoint Hamilton cycles in random directed graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adva Mond, Asaf Ferber","submitted_at":"2025-02-03T18:58:25Z","abstract_excerpt":"In this paper we consider the problem of finding ``as many edge-disjoint Hamilton cycles as possible'' in the binomial random digraph $D_{n,p}$. We show that a typical $D_{n,p}$ contains precisely the minimum between the minimum out- and in-degrees many edge-disjoint Hamilton cycles, given that $p\\geq \\log^{15} n/n$, which is optimal up to a factor of poly$\\log n$.\n  Our proof provides a randomized algorithm to generate the cycles and uses a novel idea of generating $D_{n,p}$ in a sophisticated way that enables us to control some key properties, and on an ``online sprinkling'' idea as was intr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.01631","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.01631/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2502.01631","created_at":"2026-07-05T10:08:57.263179+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.01631v1","created_at":"2026-07-05T10:08:57.263179+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.01631","created_at":"2026-07-05T10:08:57.263179+00:00"},{"alias_kind":"pith_short_12","alias_value":"YN5QEPUQDCJR","created_at":"2026-07-05T10:08:57.263179+00:00"},{"alias_kind":"pith_short_16","alias_value":"YN5QEPUQDCJR3BXR","created_at":"2026-07-05T10:08:57.263179+00:00"},{"alias_kind":"pith_short_8","alias_value":"YN5QEPUQ","created_at":"2026-07-05T10:08:57.263179+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/YN5QEPUQDCJR3BXRXOY6IELFN4","json":"https://pith.science/pith/YN5QEPUQDCJR3BXRXOY6IELFN4.json","graph_json":"https://pith.science/api/pith-number/YN5QEPUQDCJR3BXRXOY6IELFN4/graph.json","events_json":"https://pith.science/api/pith-number/YN5QEPUQDCJR3BXRXOY6IELFN4/events.json","paper":"https://pith.science/paper/YN5QEPUQ"},"agent_actions":{"view_html":"https://pith.science/pith/YN5QEPUQDCJR3BXRXOY6IELFN4","download_json":"https://pith.science/pith/YN5QEPUQDCJR3BXRXOY6IELFN4.json","view_paper":"https://pith.science/paper/YN5QEPUQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.01631&json=true","fetch_graph":"https://pith.science/api/pith-number/YN5QEPUQDCJR3BXRXOY6IELFN4/graph.json","fetch_events":"https://pith.science/api/pith-number/YN5QEPUQDCJR3BXRXOY6IELFN4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YN5QEPUQDCJR3BXRXOY6IELFN4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YN5QEPUQDCJR3BXRXOY6IELFN4/action/storage_attestation","attest_author":"https://pith.science/pith/YN5QEPUQDCJR3BXRXOY6IELFN4/action/author_attestation","sign_citation":"https://pith.science/pith/YN5QEPUQDCJR3BXRXOY6IELFN4/action/citation_signature","submit_replication":"https://pith.science/pith/YN5QEPUQDCJR3BXRXOY6IELFN4/action/replication_record"}},"created_at":"2026-07-05T10:08:57.263179+00:00","updated_at":"2026-07-05T10:08:57.263179+00:00"}