{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:VYX5FS3ZFMKVDD6FZBHMF5XLJQ","short_pith_number":"pith:VYX5FS3Z","canonical_record":{"source":{"id":"1708.07746","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-25T13:59:48Z","cross_cats_sorted":[],"title_canon_sha256":"701c84c98ec6c1b204c4d51900184ba894b1838694ea60047d43959c0161c262","abstract_canon_sha256":"4dacc7adaeac202615a3683269df1a2b54a0a4e95d4907e184dffc0ee168f013"},"schema_version":"1.0"},"canonical_sha256":"ae2fd2cb792b15518fc5c84ec2f6eb4c1d4f04ed7434b256ffd254675f34b6df","source":{"kind":"arxiv","id":"1708.07746","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.07746","created_at":"2026-05-18T00:20:39Z"},{"alias_kind":"arxiv_version","alias_value":"1708.07746v2","created_at":"2026-05-18T00:20:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07746","created_at":"2026-05-18T00:20:39Z"},{"alias_kind":"pith_short_12","alias_value":"VYX5FS3ZFMKV","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VYX5FS3ZFMKVDD6F","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VYX5FS3Z","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:VYX5FS3ZFMKVDD6FZBHMF5XLJQ","target":"record","payload":{"canonical_record":{"source":{"id":"1708.07746","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-25T13:59:48Z","cross_cats_sorted":[],"title_canon_sha256":"701c84c98ec6c1b204c4d51900184ba894b1838694ea60047d43959c0161c262","abstract_canon_sha256":"4dacc7adaeac202615a3683269df1a2b54a0a4e95d4907e184dffc0ee168f013"},"schema_version":"1.0"},"canonical_sha256":"ae2fd2cb792b15518fc5c84ec2f6eb4c1d4f04ed7434b256ffd254675f34b6df","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:39.192115Z","signature_b64":"pqW6UaxN09p7GroEphqwSEpKYSNLGZR3q/pSnHKcQdBv4GTQDVGWrOr6i73Azxkz/VmQmAQh2eI+QaYarEECCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae2fd2cb792b15518fc5c84ec2f6eb4c1d4f04ed7434b256ffd254675f34b6df","last_reissued_at":"2026-05-18T00:20:39.191443Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:39.191443Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.07746","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:20:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2nEuP5J1MvSO/jHYSohs61+YFnnniVWfYWc1/G2yI1AIHGJkdv/rnBhK+a8mamR9Yu932mAuM4yzPHRYDjJoCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:37:47.927850Z"},"content_sha256":"ff1f2841248b938ab17b5a8720bb219207534a336c4a16cd75f34cc63504f623","schema_version":"1.0","event_id":"sha256:ff1f2841248b938ab17b5a8720bb219207534a336c4a16cd75f34cc63504f623"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:VYX5FS3ZFMKVDD6FZBHMF5XLJQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Counting Hamilton cycles in sparse random directed graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Asaf Ferber, Benny Sudakov, Matthew Kwan","submitted_at":"2017-08-25T13:59:48Z","abstract_excerpt":"Let D(n,p) be the random directed graph on n vertices where each of the n(n-1) possible arcs is present independently with probability p. A celebrated result of Frieze shows that if $p\\ge(\\log n+\\omega(1))/n$ then D(n,p) typically has a directed Hamilton cycle, and this is best possible. In this paper, we obtain a strengthening of this result, showing that under the same condition, the number of directed Hamilton cycles in D(n,p) is typically $n!(p(1+o(1)))^{n}$. We also prove a hitting-time version of this statement, showing that in the random directed graph process, as soon as every vertex h"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07746","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:20:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d88gtbWutgDg/PBPcWu5iERTVhUvTGlBJbap2dW60tr7ZTL2gkQtsE3xjxeXzjkzBRVUEAPttR24ucAUbjYBCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:37:47.928595Z"},"content_sha256":"2172e7b1c16b6004d61e8397d9c295aa6d47c42b75f38eef91fac8cde2549925","schema_version":"1.0","event_id":"sha256:2172e7b1c16b6004d61e8397d9c295aa6d47c42b75f38eef91fac8cde2549925"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VYX5FS3ZFMKVDD6FZBHMF5XLJQ/bundle.json","state_url":"https://pith.science/pith/VYX5FS3ZFMKVDD6FZBHMF5XLJQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VYX5FS3ZFMKVDD6FZBHMF5XLJQ/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-05-30T11:37:47Z","links":{"resolver":"https://pith.science/pith/VYX5FS3ZFMKVDD6FZBHMF5XLJQ","bundle":"https://pith.science/pith/VYX5FS3ZFMKVDD6FZBHMF5XLJQ/bundle.json","state":"https://pith.science/pith/VYX5FS3ZFMKVDD6FZBHMF5XLJQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VYX5FS3ZFMKVDD6FZBHMF5XLJQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:VYX5FS3ZFMKVDD6FZBHMF5XLJQ","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":"4dacc7adaeac202615a3683269df1a2b54a0a4e95d4907e184dffc0ee168f013","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-25T13:59:48Z","title_canon_sha256":"701c84c98ec6c1b204c4d51900184ba894b1838694ea60047d43959c0161c262"},"schema_version":"1.0","source":{"id":"1708.07746","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.07746","created_at":"2026-05-18T00:20:39Z"},{"alias_kind":"arxiv_version","alias_value":"1708.07746v2","created_at":"2026-05-18T00:20:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07746","created_at":"2026-05-18T00:20:39Z"},{"alias_kind":"pith_short_12","alias_value":"VYX5FS3ZFMKV","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VYX5FS3ZFMKVDD6F","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VYX5FS3Z","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:2172e7b1c16b6004d61e8397d9c295aa6d47c42b75f38eef91fac8cde2549925","target":"graph","created_at":"2026-05-18T00:20:39Z","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":"Let D(n,p) be the random directed graph on n vertices where each of the n(n-1) possible arcs is present independently with probability p. A celebrated result of Frieze shows that if $p\\ge(\\log n+\\omega(1))/n$ then D(n,p) typically has a directed Hamilton cycle, and this is best possible. In this paper, we obtain a strengthening of this result, showing that under the same condition, the number of directed Hamilton cycles in D(n,p) is typically $n!(p(1+o(1)))^{n}$. We also prove a hitting-time version of this statement, showing that in the random directed graph process, as soon as every vertex h","authors_text":"Asaf Ferber, Benny Sudakov, Matthew Kwan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-25T13:59:48Z","title":"Counting Hamilton cycles in sparse random directed graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07746","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:ff1f2841248b938ab17b5a8720bb219207534a336c4a16cd75f34cc63504f623","target":"record","created_at":"2026-05-18T00:20:39Z","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":"4dacc7adaeac202615a3683269df1a2b54a0a4e95d4907e184dffc0ee168f013","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-25T13:59:48Z","title_canon_sha256":"701c84c98ec6c1b204c4d51900184ba894b1838694ea60047d43959c0161c262"},"schema_version":"1.0","source":{"id":"1708.07746","kind":"arxiv","version":2}},"canonical_sha256":"ae2fd2cb792b15518fc5c84ec2f6eb4c1d4f04ed7434b256ffd254675f34b6df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ae2fd2cb792b15518fc5c84ec2f6eb4c1d4f04ed7434b256ffd254675f34b6df","first_computed_at":"2026-05-18T00:20:39.191443Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:39.191443Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pqW6UaxN09p7GroEphqwSEpKYSNLGZR3q/pSnHKcQdBv4GTQDVGWrOr6i73Azxkz/VmQmAQh2eI+QaYarEECCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:39.192115Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.07746","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff1f2841248b938ab17b5a8720bb219207534a336c4a16cd75f34cc63504f623","sha256:2172e7b1c16b6004d61e8397d9c295aa6d47c42b75f38eef91fac8cde2549925"],"state_sha256":"a1e56a81b06a338104ea22c2baa501b087e365ff9522790d9b6e4a5cbc2981ec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GNfpTo7jEPzRQueZTjqHGzZtr4fXFi+jg30RyCcA6++vDycTz+ag8igEVxhkH7UgKBAg7Iv999i9z49PE/aABg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T11:37:47.932377Z","bundle_sha256":"1b86f499e10b314d1014d531d2d19c83bd4653659151a8a2826eb085fffea8df"}}