{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:L4NRRWUFX36GYFCYQ73JAFJAKZ","short_pith_number":"pith:L4NRRWUF","canonical_record":{"source":{"id":"1811.03501","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-08T15:43:19Z","cross_cats_sorted":[],"title_canon_sha256":"34ba5c5227a6e1a158e9cb45b25f5cd83389402c767b8679f332ad172796aab1","abstract_canon_sha256":"18f038a926b6d00c2067f2e4b3148de47bc5196462e17e9a9de1548518d591ed"},"schema_version":"1.0"},"canonical_sha256":"5f1b18da85befc6c145887f69015205667729e68e2ec51c95d2828b36369885e","source":{"kind":"arxiv","id":"1811.03501","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.03501","created_at":"2026-05-18T00:01:15Z"},{"alias_kind":"arxiv_version","alias_value":"1811.03501v1","created_at":"2026-05-18T00:01:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.03501","created_at":"2026-05-18T00:01:15Z"},{"alias_kind":"pith_short_12","alias_value":"L4NRRWUFX36G","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"L4NRRWUFX36GYFCY","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"L4NRRWUF","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:L4NRRWUFX36GYFCYQ73JAFJAKZ","target":"record","payload":{"canonical_record":{"source":{"id":"1811.03501","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-08T15:43:19Z","cross_cats_sorted":[],"title_canon_sha256":"34ba5c5227a6e1a158e9cb45b25f5cd83389402c767b8679f332ad172796aab1","abstract_canon_sha256":"18f038a926b6d00c2067f2e4b3148de47bc5196462e17e9a9de1548518d591ed"},"schema_version":"1.0"},"canonical_sha256":"5f1b18da85befc6c145887f69015205667729e68e2ec51c95d2828b36369885e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:15.947130Z","signature_b64":"ND+Pd/q1sk57y3g00V+URgI8/10PqBCSdTiDzJ8Lc63vvvwPOZe5Si39CaKbbA1bfEnTfq3bgYQdNjoAi3PWBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f1b18da85befc6c145887f69015205667729e68e2ec51c95d2828b36369885e","last_reissued_at":"2026-05-18T00:01:15.946526Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:15.946526Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.03501","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-18T00:01:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XPXOCcDSBsQoHcJfWrqMsK6fRKgilwxRPZ8LqC6gNgE27PnBSx8sRcKzuTE0abxw4gl1TbMPoIV6Smu0akS1CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T04:21:17.977924Z"},"content_sha256":"0eea018af40cd07cb403addfa05490ca62598fd2c84a58f6976b860e67a080a5","schema_version":"1.0","event_id":"sha256:0eea018af40cd07cb403addfa05490ca62598fd2c84a58f6976b860e67a080a5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:L4NRRWUFX36GYFCYQ73JAFJAKZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Hamilton cycles in Erd\\H{o}s-R\\'{e}nyi subgraphs of large graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Tony Johansson","submitted_at":"2018-11-08T15:43:19Z","abstract_excerpt":"Given a graph $\\Gamma = (V, E)$ on $n$ vertices and $m$ edges, we define the Erd\\H{o}s-R\\'{e}nyi graph process with host $\\Gamma$ as follows. A permutation $e_1,\\dots,e_m$ of $E$ is chosen uniformly at random, and for $t\\leq m$ we let $\\Gamma_t = (V, \\{e_1,\\dots,e_t\\})$. Suppose the minimum degree of $\\Gamma$ is $\\delta(\\Gamma) \\geq (1/2 + \\varepsilon)n$ for some constant $\\varepsilon > 0$. Then with high probability, $\\Gamma_t$ becomes Hamiltonian at the same moment that its minimum degree becomes at least two.\n  Given $0\\leq p\\leq 1$ we let $\\Gamma_p$ be the Erd\\H{o}s-R\\'{e}nyi subgraph of $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.03501","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-18T00:01:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8832YjmiAafVusvMjOiw/5uQIGUkzSQ2dy9IsBAKBaxLz8nANty0VCb0ZwhHcVJV0Pnc5hLEVw+po3UHq0vjDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T04:21:17.978273Z"},"content_sha256":"fb54295c0d43941153184c739d7fde095d802d5a6d1db2d0c06d9db05f2da63e","schema_version":"1.0","event_id":"sha256:fb54295c0d43941153184c739d7fde095d802d5a6d1db2d0c06d9db05f2da63e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L4NRRWUFX36GYFCYQ73JAFJAKZ/bundle.json","state_url":"https://pith.science/pith/L4NRRWUFX36GYFCYQ73JAFJAKZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L4NRRWUFX36GYFCYQ73JAFJAKZ/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-04T04:21:17Z","links":{"resolver":"https://pith.science/pith/L4NRRWUFX36GYFCYQ73JAFJAKZ","bundle":"https://pith.science/pith/L4NRRWUFX36GYFCYQ73JAFJAKZ/bundle.json","state":"https://pith.science/pith/L4NRRWUFX36GYFCYQ73JAFJAKZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L4NRRWUFX36GYFCYQ73JAFJAKZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:L4NRRWUFX36GYFCYQ73JAFJAKZ","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":"18f038a926b6d00c2067f2e4b3148de47bc5196462e17e9a9de1548518d591ed","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-08T15:43:19Z","title_canon_sha256":"34ba5c5227a6e1a158e9cb45b25f5cd83389402c767b8679f332ad172796aab1"},"schema_version":"1.0","source":{"id":"1811.03501","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.03501","created_at":"2026-05-18T00:01:15Z"},{"alias_kind":"arxiv_version","alias_value":"1811.03501v1","created_at":"2026-05-18T00:01:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.03501","created_at":"2026-05-18T00:01:15Z"},{"alias_kind":"pith_short_12","alias_value":"L4NRRWUFX36G","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"L4NRRWUFX36GYFCY","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"L4NRRWUF","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:fb54295c0d43941153184c739d7fde095d802d5a6d1db2d0c06d9db05f2da63e","target":"graph","created_at":"2026-05-18T00:01:15Z","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":"Given a graph $\\Gamma = (V, E)$ on $n$ vertices and $m$ edges, we define the Erd\\H{o}s-R\\'{e}nyi graph process with host $\\Gamma$ as follows. A permutation $e_1,\\dots,e_m$ of $E$ is chosen uniformly at random, and for $t\\leq m$ we let $\\Gamma_t = (V, \\{e_1,\\dots,e_t\\})$. Suppose the minimum degree of $\\Gamma$ is $\\delta(\\Gamma) \\geq (1/2 + \\varepsilon)n$ for some constant $\\varepsilon > 0$. Then with high probability, $\\Gamma_t$ becomes Hamiltonian at the same moment that its minimum degree becomes at least two.\n  Given $0\\leq p\\leq 1$ we let $\\Gamma_p$ be the Erd\\H{o}s-R\\'{e}nyi subgraph of $","authors_text":"Tony Johansson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-08T15:43:19Z","title":"On Hamilton cycles in Erd\\H{o}s-R\\'{e}nyi subgraphs of large graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.03501","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:0eea018af40cd07cb403addfa05490ca62598fd2c84a58f6976b860e67a080a5","target":"record","created_at":"2026-05-18T00:01:15Z","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":"18f038a926b6d00c2067f2e4b3148de47bc5196462e17e9a9de1548518d591ed","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-08T15:43:19Z","title_canon_sha256":"34ba5c5227a6e1a158e9cb45b25f5cd83389402c767b8679f332ad172796aab1"},"schema_version":"1.0","source":{"id":"1811.03501","kind":"arxiv","version":1}},"canonical_sha256":"5f1b18da85befc6c145887f69015205667729e68e2ec51c95d2828b36369885e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5f1b18da85befc6c145887f69015205667729e68e2ec51c95d2828b36369885e","first_computed_at":"2026-05-18T00:01:15.946526Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:15.946526Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ND+Pd/q1sk57y3g00V+URgI8/10PqBCSdTiDzJ8Lc63vvvwPOZe5Si39CaKbbA1bfEnTfq3bgYQdNjoAi3PWBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:15.947130Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.03501","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0eea018af40cd07cb403addfa05490ca62598fd2c84a58f6976b860e67a080a5","sha256:fb54295c0d43941153184c739d7fde095d802d5a6d1db2d0c06d9db05f2da63e"],"state_sha256":"82d26e23a188b57d1d3f2ca2d6c45559538751fdc9ad20eb7f54dbd007a03d8f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QPchJWlFMrBdhwByA9WjIzxlyU1+GYeU/XbI/3yNv7s9OWASa3nPJ4i4MEBwRhZCqTJSSgydLRevPNTQpsnRAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T04:21:17.980426Z","bundle_sha256":"9ffa11d1f85a2fff84a61bf3be1a95d8ee56df8b58d4c5f64971b03e962ef659"}}