{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:YN5QEPUQDCJR3BXRXOY6IELFN4","short_pith_number":"pith:YN5QEPUQ","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"},"canonical_sha256":"c37b023e9018931d86f1bbb1e411656f0d2bf6e2ad9d03a8ba616ee82bf3ae93","source":{"kind":"arxiv","id":"2502.01631","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.01631","created_at":"2026-07-05T10:08:57Z"},{"alias_kind":"arxiv_version","alias_value":"2502.01631v1","created_at":"2026-07-05T10:08:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.01631","created_at":"2026-07-05T10:08:57Z"},{"alias_kind":"pith_short_12","alias_value":"YN5QEPUQDCJR","created_at":"2026-07-05T10:08:57Z"},{"alias_kind":"pith_short_16","alias_value":"YN5QEPUQDCJR3BXR","created_at":"2026-07-05T10:08:57Z"},{"alias_kind":"pith_short_8","alias_value":"YN5QEPUQ","created_at":"2026-07-05T10:08:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:YN5QEPUQDCJR3BXRXOY6IELFN4","target":"record","payload":{"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"},"canonical_sha256":"c37b023e9018931d86f1bbb1e411656f0d2bf6e2ad9d03a8ba616ee82bf3ae93","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"},"source_kind":"arxiv","source_id":"2502.01631","source_version":1,"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-07-05T10:08:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"txaAWoj/SbSLIC7vhCbD5IGM4yOu8Tp7PSg067YtsvYQ/cJIeo4MrczEbiIMna2HdMVuAXgPHKbIBFZyNelkAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T16:10:30.373028Z"},"content_sha256":"c19fd5e76bfabeff3d3e180d0f4abd18967bdb7827cd0e44dfd331e2942fa25a","schema_version":"1.0","event_id":"sha256:c19fd5e76bfabeff3d3e180d0f4abd18967bdb7827cd0e44dfd331e2942fa25a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:YN5QEPUQDCJR3BXRXOY6IELFN4","target":"graph","payload":{"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"},"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-07-05T10:08:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hUvDSgz/w2G/eodyKU9diHw2woQY6III9X0KIJcdCFVyrp6Z18T71yChelNQsLHXApGyMYTKy2BBb0P3Dq26Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T16:10:30.373749Z"},"content_sha256":"011be738e7137d979a47b3f5193955eeb72cf23e612e7deab2282257abbd3cc0","schema_version":"1.0","event_id":"sha256:011be738e7137d979a47b3f5193955eeb72cf23e612e7deab2282257abbd3cc0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YN5QEPUQDCJR3BXRXOY6IELFN4/bundle.json","state_url":"https://pith.science/pith/YN5QEPUQDCJR3BXRXOY6IELFN4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YN5QEPUQDCJR3BXRXOY6IELFN4/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-08-13T16:10:30Z","links":{"resolver":"https://pith.science/pith/YN5QEPUQDCJR3BXRXOY6IELFN4","bundle":"https://pith.science/pith/YN5QEPUQDCJR3BXRXOY6IELFN4/bundle.json","state":"https://pith.science/pith/YN5QEPUQDCJR3BXRXOY6IELFN4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YN5QEPUQDCJR3BXRXOY6IELFN4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:YN5QEPUQDCJR3BXRXOY6IELFN4","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":"3144bb334b3b601de82b09201a609cbf4b816ff20a82528ef5fe248d95c1604d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-02-03T18:58:25Z","title_canon_sha256":"68a1e1d0f6142dbabe9a0e5983b03f342eeba77f18797105647de1fbd7925440"},"schema_version":"1.0","source":{"id":"2502.01631","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.01631","created_at":"2026-07-05T10:08:57Z"},{"alias_kind":"arxiv_version","alias_value":"2502.01631v1","created_at":"2026-07-05T10:08:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.01631","created_at":"2026-07-05T10:08:57Z"},{"alias_kind":"pith_short_12","alias_value":"YN5QEPUQDCJR","created_at":"2026-07-05T10:08:57Z"},{"alias_kind":"pith_short_16","alias_value":"YN5QEPUQDCJR3BXR","created_at":"2026-07-05T10:08:57Z"},{"alias_kind":"pith_short_8","alias_value":"YN5QEPUQ","created_at":"2026-07-05T10:08:57Z"}],"graph_snapshots":[{"event_id":"sha256:011be738e7137d979a47b3f5193955eeb72cf23e612e7deab2282257abbd3cc0","target":"graph","created_at":"2026-07-05T10:08:57Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2502.01631/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Adva Mond, Asaf Ferber","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-02-03T18:58:25Z","title":"Minimum degree edge-disjoint Hamilton cycles in random directed graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.01631","kind":"arxiv","version":1},"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:c19fd5e76bfabeff3d3e180d0f4abd18967bdb7827cd0e44dfd331e2942fa25a","target":"record","created_at":"2026-07-05T10:08:57Z","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":"3144bb334b3b601de82b09201a609cbf4b816ff20a82528ef5fe248d95c1604d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-02-03T18:58:25Z","title_canon_sha256":"68a1e1d0f6142dbabe9a0e5983b03f342eeba77f18797105647de1fbd7925440"},"schema_version":"1.0","source":{"id":"2502.01631","kind":"arxiv","version":1}},"canonical_sha256":"c37b023e9018931d86f1bbb1e411656f0d2bf6e2ad9d03a8ba616ee82bf3ae93","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c37b023e9018931d86f1bbb1e411656f0d2bf6e2ad9d03a8ba616ee82bf3ae93","first_computed_at":"2026-07-05T10:08:57.263123Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:08:57.263123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZeSqsUE5WeoXSmMh9/yrJJnfMI9ifU+y0zNEqGxwiURlxcZYRwLvjamZs1ED9Le6nizk95yAVl7KWZSBuATdCg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:08:57.263608Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.01631","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c19fd5e76bfabeff3d3e180d0f4abd18967bdb7827cd0e44dfd331e2942fa25a","sha256:011be738e7137d979a47b3f5193955eeb72cf23e612e7deab2282257abbd3cc0"],"state_sha256":"7c2fdb42f0058345a2b1dab722903cca09a1d264ed142664951b877f95eaa449"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QHfs+GI9eRmBJm5poH2kZqbKjwj4xapu54W8IBH/1yB/Q3hdVa6jDAIuGS8dyJHXq3YuvQ7BTgtG4W5Yq7Q/Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T16:10:30.380720Z","bundle_sha256":"bded6f15c9c9a909767ed6a579e8889332b9301326194b040d1b269f9f21b0fa"}}