{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:NYND77X5GK2XMGBFRWVT6WWZ4J","short_pith_number":"pith:NYND77X5","canonical_record":{"source":{"id":"1404.4734","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-18T09:56:54Z","cross_cats_sorted":[],"title_canon_sha256":"8670418325db0b97881181416f8a77b4bef236b9a357381fe0738e96ae7877e7","abstract_canon_sha256":"3e3b0b97d0f4bb89acf6e3aa026854a2bdc710791c357f040990507cfc78b50c"},"schema_version":"1.0"},"canonical_sha256":"6e1a3ffefd32b57618258dab3f5ad9e274e01abbbe8fe91502c29c24d8d0f9bf","source":{"kind":"arxiv","id":"1404.4734","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.4734","created_at":"2026-05-18T02:53:55Z"},{"alias_kind":"arxiv_version","alias_value":"1404.4734v1","created_at":"2026-05-18T02:53:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4734","created_at":"2026-05-18T02:53:55Z"},{"alias_kind":"pith_short_12","alias_value":"NYND77X5GK2X","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NYND77X5GK2XMGBF","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NYND77X5","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:NYND77X5GK2XMGBFRWVT6WWZ4J","target":"record","payload":{"canonical_record":{"source":{"id":"1404.4734","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-18T09:56:54Z","cross_cats_sorted":[],"title_canon_sha256":"8670418325db0b97881181416f8a77b4bef236b9a357381fe0738e96ae7877e7","abstract_canon_sha256":"3e3b0b97d0f4bb89acf6e3aa026854a2bdc710791c357f040990507cfc78b50c"},"schema_version":"1.0"},"canonical_sha256":"6e1a3ffefd32b57618258dab3f5ad9e274e01abbbe8fe91502c29c24d8d0f9bf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:55.186602Z","signature_b64":"AQpouySrPO5qSpIB17CwstdMRzsTqv6fwmtXQXDC12ekdP/YcQ4Cgcder9fd/KCDGVhSI4e7FyOMv7c8+vr+Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e1a3ffefd32b57618258dab3f5ad9e274e01abbbe8fe91502c29c24d8d0f9bf","last_reissued_at":"2026-05-18T02:53:55.185897Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:55.185897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.4734","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-05-18T02:53:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8bxrw0q3dNEdcItnQYgfSPHnFyRIvElb3T39/iEQ/3Zi/QjW13zrnKkioJYwqLBUGy80lrkcWx/kCUOB5DXzCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:31:40.466800Z"},"content_sha256":"c162a40e77cc9e7e9648033c455da25248080d0631b24fba0faa66e472494dc1","schema_version":"1.0","event_id":"sha256:c162a40e77cc9e7e9648033c455da25248080d0631b24fba0faa66e472494dc1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:NYND77X5GK2XMGBFRWVT6WWZ4J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Random directed graphs are robustly Hamiltonian","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Angelika Steger, Benny Sudakov, Dan Hefetz","submitted_at":"2014-04-18T09:56:54Z","abstract_excerpt":"A classical theorem of Ghouila-Houri from 1960 asserts that every directed graph on $n$ vertices with minimum out-degree and in-degree at least $n/2$ contains a directed Hamilton cycle. In this paper we extend this theorem to a random directed graph ${\\mathcal D}(n,p)$, that is, a directed graph in which every ordered pair $(u,v)$ becomes an arc with probability $p$ independently of all other pairs. Motivated by the study of resilience of properties of random graphs, we prove that if $p \\gg \\log n/\\sqrt{n}$, then a.a.s. every subdigraph of ${\\mathcal D}(n,p)$ with minimum out-degree and in-deg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.4734","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":""},"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-18T02:53:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gHWXcMicXAuxlGhejBYettgMy7Ntgxjod2YaO/1UoDKi29Jh0FCgMikwEcLHRf8adDjfaAVBPOG0maUJvVYIAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:31:40.467559Z"},"content_sha256":"e2c0ce7691dd44fbdd31a62f81c0452c0ef805bc4116cc6c80b38747df066665","schema_version":"1.0","event_id":"sha256:e2c0ce7691dd44fbdd31a62f81c0452c0ef805bc4116cc6c80b38747df066665"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NYND77X5GK2XMGBFRWVT6WWZ4J/bundle.json","state_url":"https://pith.science/pith/NYND77X5GK2XMGBFRWVT6WWZ4J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NYND77X5GK2XMGBFRWVT6WWZ4J/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-30T13:31:40Z","links":{"resolver":"https://pith.science/pith/NYND77X5GK2XMGBFRWVT6WWZ4J","bundle":"https://pith.science/pith/NYND77X5GK2XMGBFRWVT6WWZ4J/bundle.json","state":"https://pith.science/pith/NYND77X5GK2XMGBFRWVT6WWZ4J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NYND77X5GK2XMGBFRWVT6WWZ4J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:NYND77X5GK2XMGBFRWVT6WWZ4J","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":"3e3b0b97d0f4bb89acf6e3aa026854a2bdc710791c357f040990507cfc78b50c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-18T09:56:54Z","title_canon_sha256":"8670418325db0b97881181416f8a77b4bef236b9a357381fe0738e96ae7877e7"},"schema_version":"1.0","source":{"id":"1404.4734","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.4734","created_at":"2026-05-18T02:53:55Z"},{"alias_kind":"arxiv_version","alias_value":"1404.4734v1","created_at":"2026-05-18T02:53:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4734","created_at":"2026-05-18T02:53:55Z"},{"alias_kind":"pith_short_12","alias_value":"NYND77X5GK2X","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NYND77X5GK2XMGBF","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NYND77X5","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:e2c0ce7691dd44fbdd31a62f81c0452c0ef805bc4116cc6c80b38747df066665","target":"graph","created_at":"2026-05-18T02:53:55Z","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":"A classical theorem of Ghouila-Houri from 1960 asserts that every directed graph on $n$ vertices with minimum out-degree and in-degree at least $n/2$ contains a directed Hamilton cycle. In this paper we extend this theorem to a random directed graph ${\\mathcal D}(n,p)$, that is, a directed graph in which every ordered pair $(u,v)$ becomes an arc with probability $p$ independently of all other pairs. Motivated by the study of resilience of properties of random graphs, we prove that if $p \\gg \\log n/\\sqrt{n}$, then a.a.s. every subdigraph of ${\\mathcal D}(n,p)$ with minimum out-degree and in-deg","authors_text":"Angelika Steger, Benny Sudakov, Dan Hefetz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-18T09:56:54Z","title":"Random directed graphs are robustly Hamiltonian"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.4734","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:c162a40e77cc9e7e9648033c455da25248080d0631b24fba0faa66e472494dc1","target":"record","created_at":"2026-05-18T02:53:55Z","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":"3e3b0b97d0f4bb89acf6e3aa026854a2bdc710791c357f040990507cfc78b50c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-18T09:56:54Z","title_canon_sha256":"8670418325db0b97881181416f8a77b4bef236b9a357381fe0738e96ae7877e7"},"schema_version":"1.0","source":{"id":"1404.4734","kind":"arxiv","version":1}},"canonical_sha256":"6e1a3ffefd32b57618258dab3f5ad9e274e01abbbe8fe91502c29c24d8d0f9bf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6e1a3ffefd32b57618258dab3f5ad9e274e01abbbe8fe91502c29c24d8d0f9bf","first_computed_at":"2026-05-18T02:53:55.185897Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:55.185897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AQpouySrPO5qSpIB17CwstdMRzsTqv6fwmtXQXDC12ekdP/YcQ4Cgcder9fd/KCDGVhSI4e7FyOMv7c8+vr+Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:55.186602Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.4734","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c162a40e77cc9e7e9648033c455da25248080d0631b24fba0faa66e472494dc1","sha256:e2c0ce7691dd44fbdd31a62f81c0452c0ef805bc4116cc6c80b38747df066665"],"state_sha256":"c06a07a01fc700dc248c3f4de9aa6dc538d37d6205d1fdad77ee1eda3e3ee075"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0uoUk24vurVQWmXG6e5OcugQeMqvy/VtQo+uT+MenT0171kH137yoe7MuVya6L0IyaOju3+BAmrd56gh2lHVBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T13:31:40.472175Z","bundle_sha256":"379afaef41e5eb6dc8aade3af803bd81b2f8b56747523569a4b28c546649e11d"}}