{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:B6UFQ6CRV5ZRKJDECTSWGXM2IC","short_pith_number":"pith:B6UFQ6CR","canonical_record":{"source":{"id":"1103.5522","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2011-03-29T01:15:17Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"4fb9edfb01755fde5077d09066a6adf4bf5083f5b05413dbb35d33fbad06659f","abstract_canon_sha256":"f8262dedb30f6d009bfa4849df6e4b800b7ea0107693849ae0ce295f7d29b7b0"},"schema_version":"1.0"},"canonical_sha256":"0fa8587851af7315246414e5635d9a40a51fd627a0977a70ca2280e9d0c2912f","source":{"kind":"arxiv","id":"1103.5522","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.5522","created_at":"2026-05-18T03:59:03Z"},{"alias_kind":"arxiv_version","alias_value":"1103.5522v3","created_at":"2026-05-18T03:59:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.5522","created_at":"2026-05-18T03:59:03Z"},{"alias_kind":"pith_short_12","alias_value":"B6UFQ6CRV5ZR","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"B6UFQ6CRV5ZRKJDE","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"B6UFQ6CR","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:B6UFQ6CRV5ZRKJDECTSWGXM2IC","target":"record","payload":{"canonical_record":{"source":{"id":"1103.5522","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2011-03-29T01:15:17Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"4fb9edfb01755fde5077d09066a6adf4bf5083f5b05413dbb35d33fbad06659f","abstract_canon_sha256":"f8262dedb30f6d009bfa4849df6e4b800b7ea0107693849ae0ce295f7d29b7b0"},"schema_version":"1.0"},"canonical_sha256":"0fa8587851af7315246414e5635d9a40a51fd627a0977a70ca2280e9d0c2912f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:59:03.284298Z","signature_b64":"NIJSLm2FO3DYEPMafih+oLRYacLRvPNV3qrCotnaovXbb4J+Li3ArUCx5Ih6B1pz1JOrnW1+N/6fqkMOJ0X8BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0fa8587851af7315246414e5635d9a40a51fd627a0977a70ca2280e9d0c2912f","last_reissued_at":"2026-05-18T03:59:03.283596Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:59:03.283596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.5522","source_version":3,"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-18T03:59:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ID4jrfvY8sfdT2Pakf1ROhrZvHHV77tbsJNLkuzsXHPXjrBaaDgRZfgWCOAG7gMmlm6bHsPrqNHy/9pSTzJiAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:11:24.703060Z"},"content_sha256":"43bb354fcdf875e2799b4d23eff0b9b6ebaf79deb550e8c2ef097711c55dbf71","schema_version":"1.0","event_id":"sha256:43bb354fcdf875e2799b4d23eff0b9b6ebaf79deb550e8c2ef097711c55dbf71"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:B6UFQ6CRV5ZRKJDECTSWGXM2IC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Getting directed Hamilton cycle twice faster","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Choongbum Lee, Dan Vilenchik","submitted_at":"2011-03-29T01:15:17Z","abstract_excerpt":"Consider the random graph process where we start with an empty graph on n vertices, and at time t, are given an edge e_t chosen uniformly at random among the edges which have not appeared so far. A classical result in random graph theory asserts that w.h.p. the graph becomes Hamiltonian at time (1/2+o(1))n log n. On the contrary, if all the edges were directed randomly, then the graph has a directed Hamilton cycle w.h.p. only at time (1+o(1))n log n. In this paper we further study the directed case, and ask whether it is essential to have twice as many edges compared to the undirected case. Mo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.5522","kind":"arxiv","version":3},"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-18T03:59:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RANwt7ZFX3AT2Lmwcge2Wm4YSZLzc79AGI+Q11mTA6yzojm2MFpbfWIwK6XWKcKBGQaaOrsCEzFORPwuQroMBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:11:24.703419Z"},"content_sha256":"bee087641abe38fff08ae1630f2a2377ec09630abaa7e9f4ab623c9edc7bccf8","schema_version":"1.0","event_id":"sha256:bee087641abe38fff08ae1630f2a2377ec09630abaa7e9f4ab623c9edc7bccf8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B6UFQ6CRV5ZRKJDECTSWGXM2IC/bundle.json","state_url":"https://pith.science/pith/B6UFQ6CRV5ZRKJDECTSWGXM2IC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B6UFQ6CRV5ZRKJDECTSWGXM2IC/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-30T17:11:24Z","links":{"resolver":"https://pith.science/pith/B6UFQ6CRV5ZRKJDECTSWGXM2IC","bundle":"https://pith.science/pith/B6UFQ6CRV5ZRKJDECTSWGXM2IC/bundle.json","state":"https://pith.science/pith/B6UFQ6CRV5ZRKJDECTSWGXM2IC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B6UFQ6CRV5ZRKJDECTSWGXM2IC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:B6UFQ6CRV5ZRKJDECTSWGXM2IC","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":"f8262dedb30f6d009bfa4849df6e4b800b7ea0107693849ae0ce295f7d29b7b0","cross_cats_sorted":["math.PR"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2011-03-29T01:15:17Z","title_canon_sha256":"4fb9edfb01755fde5077d09066a6adf4bf5083f5b05413dbb35d33fbad06659f"},"schema_version":"1.0","source":{"id":"1103.5522","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.5522","created_at":"2026-05-18T03:59:03Z"},{"alias_kind":"arxiv_version","alias_value":"1103.5522v3","created_at":"2026-05-18T03:59:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.5522","created_at":"2026-05-18T03:59:03Z"},{"alias_kind":"pith_short_12","alias_value":"B6UFQ6CRV5ZR","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"B6UFQ6CRV5ZRKJDE","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"B6UFQ6CR","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:bee087641abe38fff08ae1630f2a2377ec09630abaa7e9f4ab623c9edc7bccf8","target":"graph","created_at":"2026-05-18T03:59:03Z","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":"Consider the random graph process where we start with an empty graph on n vertices, and at time t, are given an edge e_t chosen uniformly at random among the edges which have not appeared so far. A classical result in random graph theory asserts that w.h.p. the graph becomes Hamiltonian at time (1/2+o(1))n log n. On the contrary, if all the edges were directed randomly, then the graph has a directed Hamilton cycle w.h.p. only at time (1+o(1))n log n. In this paper we further study the directed case, and ask whether it is essential to have twice as many edges compared to the undirected case. Mo","authors_text":"Benny Sudakov, Choongbum Lee, Dan Vilenchik","cross_cats":["math.PR"],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2011-03-29T01:15:17Z","title":"Getting directed Hamilton cycle twice faster"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.5522","kind":"arxiv","version":3},"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:43bb354fcdf875e2799b4d23eff0b9b6ebaf79deb550e8c2ef097711c55dbf71","target":"record","created_at":"2026-05-18T03:59:03Z","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":"f8262dedb30f6d009bfa4849df6e4b800b7ea0107693849ae0ce295f7d29b7b0","cross_cats_sorted":["math.PR"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2011-03-29T01:15:17Z","title_canon_sha256":"4fb9edfb01755fde5077d09066a6adf4bf5083f5b05413dbb35d33fbad06659f"},"schema_version":"1.0","source":{"id":"1103.5522","kind":"arxiv","version":3}},"canonical_sha256":"0fa8587851af7315246414e5635d9a40a51fd627a0977a70ca2280e9d0c2912f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0fa8587851af7315246414e5635d9a40a51fd627a0977a70ca2280e9d0c2912f","first_computed_at":"2026-05-18T03:59:03.283596Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:59:03.283596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NIJSLm2FO3DYEPMafih+oLRYacLRvPNV3qrCotnaovXbb4J+Li3ArUCx5Ih6B1pz1JOrnW1+N/6fqkMOJ0X8BA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:59:03.284298Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.5522","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:43bb354fcdf875e2799b4d23eff0b9b6ebaf79deb550e8c2ef097711c55dbf71","sha256:bee087641abe38fff08ae1630f2a2377ec09630abaa7e9f4ab623c9edc7bccf8"],"state_sha256":"1d2d62de2ca6281cdef7a23a2e9d4a7aaf86aff9a10faf18b9471b290564e4ab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TQzoRfUOHmcy4zAs3fUPpfQCWynRlahUXZbyehJv2OVdAWCoCXXMtpJZH19jE+aUXrqQzdV+a4KVgmgCVnc8Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T17:11:24.705294Z","bundle_sha256":"049e1f74729e98211bf0dd15acbb7e658cc23edc7c4349a2d878f4a01fbf7930"}}