{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6MZVHCYV4U4Q6ZH6ZN5JQHXNK7","short_pith_number":"pith:6MZVHCYV","canonical_record":{"source":{"id":"1710.00505","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-02T06:45:21Z","cross_cats_sorted":[],"title_canon_sha256":"bea87c52ad54584cf4179528fcdc39e303f8ad3466ecee0bed6ffe139c291c7a","abstract_canon_sha256":"0d7baa7ef47e289a1c9fb244dee3c7e7628a6994039cac848252ea9106f49f46"},"schema_version":"1.0"},"canonical_sha256":"f333538b15e5390f64fecb7a981eed57ec0f7bc47c78407a6b16ff6635b8cf19","source":{"kind":"arxiv","id":"1710.00505","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.00505","created_at":"2026-05-17T23:48:11Z"},{"alias_kind":"arxiv_version","alias_value":"1710.00505v2","created_at":"2026-05-17T23:48:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.00505","created_at":"2026-05-17T23:48:11Z"},{"alias_kind":"pith_short_12","alias_value":"6MZVHCYV4U4Q","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6MZVHCYV4U4Q6ZH6","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6MZVHCYV","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6MZVHCYV4U4Q6ZH6ZN5JQHXNK7","target":"record","payload":{"canonical_record":{"source":{"id":"1710.00505","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-02T06:45:21Z","cross_cats_sorted":[],"title_canon_sha256":"bea87c52ad54584cf4179528fcdc39e303f8ad3466ecee0bed6ffe139c291c7a","abstract_canon_sha256":"0d7baa7ef47e289a1c9fb244dee3c7e7628a6994039cac848252ea9106f49f46"},"schema_version":"1.0"},"canonical_sha256":"f333538b15e5390f64fecb7a981eed57ec0f7bc47c78407a6b16ff6635b8cf19","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:11.983785Z","signature_b64":"wpFxWBvdFZz2hU2wxTmVxixcUf5FvFA0C1SW6quCFavz1OTDJNu3/1Y+am4g6CDdXZ95H6My1noK8/pD/XwjBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f333538b15e5390f64fecb7a981eed57ec0f7bc47c78407a6b16ff6635b8cf19","last_reissued_at":"2026-05-17T23:48:11.983150Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:11.983150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.00505","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-17T23:48:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VsWi1dWltZaSftvPalG980F0s8iQt4ne4ZriPrAhC362qJXm7IeNjny8S+X4Wi5Q1GQqmM4f2eB/aShCfPmKDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T12:58:49.304522Z"},"content_sha256":"106c49d290757563ff5a775c655a3ca8f19260dea5fc43bf1f078e64c4db3244","schema_version":"1.0","event_id":"sha256:106c49d290757563ff5a775c655a3ca8f19260dea5fc43bf1f078e64c4db3244"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6MZVHCYV4U4Q6ZH6ZN5JQHXNK7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hamiltonicity in random graphs is born resilient","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Richard Montgomery","submitted_at":"2017-10-02T06:45:21Z","abstract_excerpt":"Let $\\{G_M\\}_{M\\geq 0}$ be the random graph process, where $G_0$ is the empty graph on $n$ vertices and subsequent graphs in the sequence are obtained by adding a new edge uniformly at random. For each $\\varepsilon>0$, we show that, almost surely, any graph $G_M$ with minimum degree at least 2 is not only Hamiltonian (as shown by Bollob\\'as), but remains Hamiltonian despite the removal of any set of edges, as long as at most $(1/2-\\varepsilon)$ of the edges incident to each vertex are removed. We say that such a graph is $(1/2-\\varepsilon)$-resiliently Hamiltonian. Furthermore, for each $\\epsi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.00505","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-17T23:48:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lX3/C9ch/WRJW5at1mBRA1a5SVohPWlU0kLoSFf0c7WEwKpPKlOZURk/FETDB8+R3pSXR2zedpzf8DQZndINCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T12:58:49.305215Z"},"content_sha256":"635809ec0c67d08acd0d837a3395b4c49f17f848991e26b70c348b46f5ecb3ac","schema_version":"1.0","event_id":"sha256:635809ec0c67d08acd0d837a3395b4c49f17f848991e26b70c348b46f5ecb3ac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6MZVHCYV4U4Q6ZH6ZN5JQHXNK7/bundle.json","state_url":"https://pith.science/pith/6MZVHCYV4U4Q6ZH6ZN5JQHXNK7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6MZVHCYV4U4Q6ZH6ZN5JQHXNK7/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-06-09T12:58:49Z","links":{"resolver":"https://pith.science/pith/6MZVHCYV4U4Q6ZH6ZN5JQHXNK7","bundle":"https://pith.science/pith/6MZVHCYV4U4Q6ZH6ZN5JQHXNK7/bundle.json","state":"https://pith.science/pith/6MZVHCYV4U4Q6ZH6ZN5JQHXNK7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6MZVHCYV4U4Q6ZH6ZN5JQHXNK7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6MZVHCYV4U4Q6ZH6ZN5JQHXNK7","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":"0d7baa7ef47e289a1c9fb244dee3c7e7628a6994039cac848252ea9106f49f46","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-02T06:45:21Z","title_canon_sha256":"bea87c52ad54584cf4179528fcdc39e303f8ad3466ecee0bed6ffe139c291c7a"},"schema_version":"1.0","source":{"id":"1710.00505","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.00505","created_at":"2026-05-17T23:48:11Z"},{"alias_kind":"arxiv_version","alias_value":"1710.00505v2","created_at":"2026-05-17T23:48:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.00505","created_at":"2026-05-17T23:48:11Z"},{"alias_kind":"pith_short_12","alias_value":"6MZVHCYV4U4Q","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6MZVHCYV4U4Q6ZH6","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6MZVHCYV","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:635809ec0c67d08acd0d837a3395b4c49f17f848991e26b70c348b46f5ecb3ac","target":"graph","created_at":"2026-05-17T23:48:11Z","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 $\\{G_M\\}_{M\\geq 0}$ be the random graph process, where $G_0$ is the empty graph on $n$ vertices and subsequent graphs in the sequence are obtained by adding a new edge uniformly at random. For each $\\varepsilon>0$, we show that, almost surely, any graph $G_M$ with minimum degree at least 2 is not only Hamiltonian (as shown by Bollob\\'as), but remains Hamiltonian despite the removal of any set of edges, as long as at most $(1/2-\\varepsilon)$ of the edges incident to each vertex are removed. We say that such a graph is $(1/2-\\varepsilon)$-resiliently Hamiltonian. Furthermore, for each $\\epsi","authors_text":"Richard Montgomery","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-02T06:45:21Z","title":"Hamiltonicity in random graphs is born resilient"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.00505","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:106c49d290757563ff5a775c655a3ca8f19260dea5fc43bf1f078e64c4db3244","target":"record","created_at":"2026-05-17T23:48:11Z","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":"0d7baa7ef47e289a1c9fb244dee3c7e7628a6994039cac848252ea9106f49f46","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-02T06:45:21Z","title_canon_sha256":"bea87c52ad54584cf4179528fcdc39e303f8ad3466ecee0bed6ffe139c291c7a"},"schema_version":"1.0","source":{"id":"1710.00505","kind":"arxiv","version":2}},"canonical_sha256":"f333538b15e5390f64fecb7a981eed57ec0f7bc47c78407a6b16ff6635b8cf19","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f333538b15e5390f64fecb7a981eed57ec0f7bc47c78407a6b16ff6635b8cf19","first_computed_at":"2026-05-17T23:48:11.983150Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:11.983150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wpFxWBvdFZz2hU2wxTmVxixcUf5FvFA0C1SW6quCFavz1OTDJNu3/1Y+am4g6CDdXZ95H6My1noK8/pD/XwjBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:11.983785Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.00505","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:106c49d290757563ff5a775c655a3ca8f19260dea5fc43bf1f078e64c4db3244","sha256:635809ec0c67d08acd0d837a3395b4c49f17f848991e26b70c348b46f5ecb3ac"],"state_sha256":"0f752f4c1490af6244039a4a8543f6430de295c4eabb40458bb0d0bdd10a1854"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x/DtS02cBUetIByKqRWuaKaD7ZHsHoQFO6CS5mL7mIn5D3y8aDwcenQQw350pxGD1NhXIy0LbmXGS2zTY9/3Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T12:58:49.308596Z","bundle_sha256":"0aa01fb8d1ad8243c04f3ec8928670a288da36914285cc578e862583f6ac5c33"}}