{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:RCINJQIAPT7EDZL5N5Q2Q3CQ4Q","short_pith_number":"pith:RCINJQIA","canonical_record":{"source":{"id":"2410.12964","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-10-16T18:54:45Z","cross_cats_sorted":[],"title_canon_sha256":"a96bd01e13d77487eb1417fc6b40a8c5bd08c936d8755803b286e2b5014b87c9","abstract_canon_sha256":"0c58bdee385e22d153bface45c062d64c6f24b0412cfe8711197f57f094aef8f"},"schema_version":"1.0"},"canonical_sha256":"8890d4c1007cfe41e57d6f61a86c50e4378a4f656c0e878c97dc479b243777e4","source":{"kind":"arxiv","id":"2410.12964","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.12964","created_at":"2026-07-05T09:21:53Z"},{"alias_kind":"arxiv_version","alias_value":"2410.12964v1","created_at":"2026-07-05T09:21:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.12964","created_at":"2026-07-05T09:21:53Z"},{"alias_kind":"pith_short_12","alias_value":"RCINJQIAPT7E","created_at":"2026-07-05T09:21:53Z"},{"alias_kind":"pith_short_16","alias_value":"RCINJQIAPT7EDZL5","created_at":"2026-07-05T09:21:53Z"},{"alias_kind":"pith_short_8","alias_value":"RCINJQIA","created_at":"2026-07-05T09:21:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:RCINJQIAPT7EDZL5N5Q2Q3CQ4Q","target":"record","payload":{"canonical_record":{"source":{"id":"2410.12964","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-10-16T18:54:45Z","cross_cats_sorted":[],"title_canon_sha256":"a96bd01e13d77487eb1417fc6b40a8c5bd08c936d8755803b286e2b5014b87c9","abstract_canon_sha256":"0c58bdee385e22d153bface45c062d64c6f24b0412cfe8711197f57f094aef8f"},"schema_version":"1.0"},"canonical_sha256":"8890d4c1007cfe41e57d6f61a86c50e4378a4f656c0e878c97dc479b243777e4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:21:53.411227Z","signature_b64":"tIi4y8fYd1JUfk9rUCtEKgVcZhQwsjZpbMAL+lI//1+F6sW1B6KA9Rk5FcRWLUbU4s9em+bNoXd2bzyNPMqoCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8890d4c1007cfe41e57d6f61a86c50e4378a4f656c0e878c97dc479b243777e4","last_reissued_at":"2026-07-05T09:21:53.410841Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:21:53.410841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2410.12964","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-05T09:21:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"awwgjGGBCKC5UMcDnB3yu2g9YqK4I8uXE1rLhRa703hcGMY03f1Kf3AApqLMX3DpLckeWEOvZX6cQO98XnwUBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T03:06:59.616600Z"},"content_sha256":"99cf3d234f56572a69a678b734c0b61101cb118ff46e62d7cef9b01ccecb8797","schema_version":"1.0","event_id":"sha256:99cf3d234f56572a69a678b734c0b61101cb118ff46e62d7cef9b01ccecb8797"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:RCINJQIAPT7EDZL5N5Q2Q3CQ4Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Covering Random Digraphs with Hamilton Cycles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Asaf Ferber, Marcelo Sales, Mason Shurman","submitted_at":"2024-10-16T18:54:45Z","abstract_excerpt":"A covering of a digraph $D$ by Hamilton cycles is a collection of directed Hamilton cycles (not necessarily edge-disjoint) that together cover all the edges of $D$. We prove that for $1/2 \\geq p\\geq \\frac{\\log^{20} n}{n}$, the random digraph $D_{n,p}$ typically admits an optimal Hamilton cycle covering. Specifically, the edges of $D_{n,p}$ can be covered by a family of $t$ Hamilton cycles, where $t$ is the maximum of the the in-degree and out-degree of the vertices in $D_{n,p}$. Notably, $t$ is the best possible bound, and our assumption on $p$ is optimal up to a polylogarithmic factor."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.12964","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/2410.12964/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-05T09:21:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eSZ16iu03Rb9rMceHoS2rZKiloaRR7ZZ6isJbTQQ8DFniR8lIBW/DJXJn2QilvXpB/v1EHqOp5wAlzQPAwMTAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T03:06:59.617072Z"},"content_sha256":"79c376d5bcec79dec71c06ce4fa06b6a837c02c532b369f1c4856f0e9ed7da1e","schema_version":"1.0","event_id":"sha256:79c376d5bcec79dec71c06ce4fa06b6a837c02c532b369f1c4856f0e9ed7da1e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RCINJQIAPT7EDZL5N5Q2Q3CQ4Q/bundle.json","state_url":"https://pith.science/pith/RCINJQIAPT7EDZL5N5Q2Q3CQ4Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RCINJQIAPT7EDZL5N5Q2Q3CQ4Q/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-05T03:06:59Z","links":{"resolver":"https://pith.science/pith/RCINJQIAPT7EDZL5N5Q2Q3CQ4Q","bundle":"https://pith.science/pith/RCINJQIAPT7EDZL5N5Q2Q3CQ4Q/bundle.json","state":"https://pith.science/pith/RCINJQIAPT7EDZL5N5Q2Q3CQ4Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RCINJQIAPT7EDZL5N5Q2Q3CQ4Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:RCINJQIAPT7EDZL5N5Q2Q3CQ4Q","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":"0c58bdee385e22d153bface45c062d64c6f24b0412cfe8711197f57f094aef8f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-10-16T18:54:45Z","title_canon_sha256":"a96bd01e13d77487eb1417fc6b40a8c5bd08c936d8755803b286e2b5014b87c9"},"schema_version":"1.0","source":{"id":"2410.12964","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.12964","created_at":"2026-07-05T09:21:53Z"},{"alias_kind":"arxiv_version","alias_value":"2410.12964v1","created_at":"2026-07-05T09:21:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.12964","created_at":"2026-07-05T09:21:53Z"},{"alias_kind":"pith_short_12","alias_value":"RCINJQIAPT7E","created_at":"2026-07-05T09:21:53Z"},{"alias_kind":"pith_short_16","alias_value":"RCINJQIAPT7EDZL5","created_at":"2026-07-05T09:21:53Z"},{"alias_kind":"pith_short_8","alias_value":"RCINJQIA","created_at":"2026-07-05T09:21:53Z"}],"graph_snapshots":[{"event_id":"sha256:79c376d5bcec79dec71c06ce4fa06b6a837c02c532b369f1c4856f0e9ed7da1e","target":"graph","created_at":"2026-07-05T09:21:53Z","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/2410.12964/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A covering of a digraph $D$ by Hamilton cycles is a collection of directed Hamilton cycles (not necessarily edge-disjoint) that together cover all the edges of $D$. We prove that for $1/2 \\geq p\\geq \\frac{\\log^{20} n}{n}$, the random digraph $D_{n,p}$ typically admits an optimal Hamilton cycle covering. Specifically, the edges of $D_{n,p}$ can be covered by a family of $t$ Hamilton cycles, where $t$ is the maximum of the the in-degree and out-degree of the vertices in $D_{n,p}$. Notably, $t$ is the best possible bound, and our assumption on $p$ is optimal up to a polylogarithmic factor.","authors_text":"Asaf Ferber, Marcelo Sales, Mason Shurman","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-10-16T18:54:45Z","title":"Covering Random Digraphs with Hamilton Cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.12964","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:99cf3d234f56572a69a678b734c0b61101cb118ff46e62d7cef9b01ccecb8797","target":"record","created_at":"2026-07-05T09:21:53Z","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":"0c58bdee385e22d153bface45c062d64c6f24b0412cfe8711197f57f094aef8f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-10-16T18:54:45Z","title_canon_sha256":"a96bd01e13d77487eb1417fc6b40a8c5bd08c936d8755803b286e2b5014b87c9"},"schema_version":"1.0","source":{"id":"2410.12964","kind":"arxiv","version":1}},"canonical_sha256":"8890d4c1007cfe41e57d6f61a86c50e4378a4f656c0e878c97dc479b243777e4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8890d4c1007cfe41e57d6f61a86c50e4378a4f656c0e878c97dc479b243777e4","first_computed_at":"2026-07-05T09:21:53.410841Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:21:53.410841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tIi4y8fYd1JUfk9rUCtEKgVcZhQwsjZpbMAL+lI//1+F6sW1B6KA9Rk5FcRWLUbU4s9em+bNoXd2bzyNPMqoCA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:21:53.411227Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.12964","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:99cf3d234f56572a69a678b734c0b61101cb118ff46e62d7cef9b01ccecb8797","sha256:79c376d5bcec79dec71c06ce4fa06b6a837c02c532b369f1c4856f0e9ed7da1e"],"state_sha256":"4ddff0c06e1c8f2a2792342411c653b1e90fdfd2985609cdee0cb1da9feb5c00"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VWskGqDx8srJCxCADgANEjoGBXQi3zaMB73/mRYHZDVqOsdZiGSBHdmzCam+krXC0WG7e3pbwlRHo1YnYH4fCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T03:06:59.621316Z","bundle_sha256":"9378442d22b157357a788e750b26dc88828969ce85e96aeb5fa648b85311342e"}}