{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:G44MRRECB56QJMBDRLSPOXHVYR","short_pith_number":"pith:G44MRREC","canonical_record":{"source":{"id":"1410.1438","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-06T16:16:01Z","cross_cats_sorted":[],"title_canon_sha256":"1f3bd948e1d9e07e22a421c3c5c085ff6742b6d7b1e1954deacddc8c09880574","abstract_canon_sha256":"a606fefe4c05fae0c0279257e70c599bd62e4743849015b064d35488fed36df5"},"schema_version":"1.0"},"canonical_sha256":"3738c8c4820f7d04b0238ae4f75cf5c44d76c6f933aaf15b4d1a02ca9ebbc842","source":{"kind":"arxiv","id":"1410.1438","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.1438","created_at":"2026-05-18T01:32:50Z"},{"alias_kind":"arxiv_version","alias_value":"1410.1438v3","created_at":"2026-05-18T01:32:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.1438","created_at":"2026-05-18T01:32:50Z"},{"alias_kind":"pith_short_12","alias_value":"G44MRRECB56Q","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"G44MRRECB56QJMBD","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"G44MRREC","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:G44MRRECB56QJMBDRLSPOXHVYR","target":"record","payload":{"canonical_record":{"source":{"id":"1410.1438","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-06T16:16:01Z","cross_cats_sorted":[],"title_canon_sha256":"1f3bd948e1d9e07e22a421c3c5c085ff6742b6d7b1e1954deacddc8c09880574","abstract_canon_sha256":"a606fefe4c05fae0c0279257e70c599bd62e4743849015b064d35488fed36df5"},"schema_version":"1.0"},"canonical_sha256":"3738c8c4820f7d04b0238ae4f75cf5c44d76c6f933aaf15b4d1a02ca9ebbc842","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:50.725836Z","signature_b64":"KyHGAoBp7uc6LBRtI5Zk4rhIroG3OzUN8OjOpWHD1YNhELZwEEKtTraH9EOZdRo2h8f/dLnPrwp0x5kkYa9QCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3738c8c4820f7d04b0238ae4f75cf5c44d76c6f933aaf15b4d1a02ca9ebbc842","last_reissued_at":"2026-05-18T01:32:50.725237Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:50.725237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.1438","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-18T01:32:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wFkrpMdGwyyg0NooReVyN+eGEgXdz5DWWLiUolkQxpy3s1GWkr4F2J36hjyEXYbvk2qim+B6WTE0y/+8boGbBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:06:22.355939Z"},"content_sha256":"32ba6fc9712e7b212e1d6ef0e5de513f4746ba96dad1aa318091036e1c6b5eb6","schema_version":"1.0","event_id":"sha256:32ba6fc9712e7b212e1d6ef0e5de513f4746ba96dad1aa318091036e1c6b5eb6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:G44MRRECB56QJMBDRLSPOXHVYR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Compatible Hamilton cycles in random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Choongbum Lee, Michael Krivelevich","submitted_at":"2014-10-06T16:16:01Z","abstract_excerpt":"A graph is Hamiltonian if it contains a cycle passing through every vertex. One of the cornerstone results in the theory of random graphs asserts that for edge probability $p \\gg \\frac{\\log n}{n}$, the random graph $G(n,p)$ is asymptotically almost surely Hamiltonian. We obtain the following strengthening of this result. Given a graph $G=(V,E)$, an {\\em incompatibility system} $\\mathcal{F}$ over $G$ is a family $\\mathcal{F}=\\{F_v\\}_{v\\in V}$ where for every $v\\in V$, the set $F_v$ is a set of unordered pairs $F_v \\subseteq \\{\\{e,e'\\}: e\\ne e'\\in E, e\\cap e'=\\{v\\}\\}$. An incompatibility system "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.1438","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-18T01:32:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ql75TXGbxJM7+8eQxbrd2M7NkgN6YCSOG99IR7n3HEjTZfqZk6BbT0aX6F2be/uPVVsKPSY3fqUguFX9eRRiBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:06:22.356364Z"},"content_sha256":"8319d018fbec82831ca1ad34d658b7bcb9576f9065ec410d35906a148ed5ca68","schema_version":"1.0","event_id":"sha256:8319d018fbec82831ca1ad34d658b7bcb9576f9065ec410d35906a148ed5ca68"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G44MRRECB56QJMBDRLSPOXHVYR/bundle.json","state_url":"https://pith.science/pith/G44MRRECB56QJMBDRLSPOXHVYR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G44MRRECB56QJMBDRLSPOXHVYR/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-30T23:06:22Z","links":{"resolver":"https://pith.science/pith/G44MRRECB56QJMBDRLSPOXHVYR","bundle":"https://pith.science/pith/G44MRRECB56QJMBDRLSPOXHVYR/bundle.json","state":"https://pith.science/pith/G44MRRECB56QJMBDRLSPOXHVYR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G44MRRECB56QJMBDRLSPOXHVYR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:G44MRRECB56QJMBDRLSPOXHVYR","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":"a606fefe4c05fae0c0279257e70c599bd62e4743849015b064d35488fed36df5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-06T16:16:01Z","title_canon_sha256":"1f3bd948e1d9e07e22a421c3c5c085ff6742b6d7b1e1954deacddc8c09880574"},"schema_version":"1.0","source":{"id":"1410.1438","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.1438","created_at":"2026-05-18T01:32:50Z"},{"alias_kind":"arxiv_version","alias_value":"1410.1438v3","created_at":"2026-05-18T01:32:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.1438","created_at":"2026-05-18T01:32:50Z"},{"alias_kind":"pith_short_12","alias_value":"G44MRRECB56Q","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"G44MRRECB56QJMBD","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"G44MRREC","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:8319d018fbec82831ca1ad34d658b7bcb9576f9065ec410d35906a148ed5ca68","target":"graph","created_at":"2026-05-18T01:32:50Z","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 graph is Hamiltonian if it contains a cycle passing through every vertex. One of the cornerstone results in the theory of random graphs asserts that for edge probability $p \\gg \\frac{\\log n}{n}$, the random graph $G(n,p)$ is asymptotically almost surely Hamiltonian. We obtain the following strengthening of this result. Given a graph $G=(V,E)$, an {\\em incompatibility system} $\\mathcal{F}$ over $G$ is a family $\\mathcal{F}=\\{F_v\\}_{v\\in V}$ where for every $v\\in V$, the set $F_v$ is a set of unordered pairs $F_v \\subseteq \\{\\{e,e'\\}: e\\ne e'\\in E, e\\cap e'=\\{v\\}\\}$. An incompatibility system ","authors_text":"Benny Sudakov, Choongbum Lee, Michael Krivelevich","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-06T16:16:01Z","title":"Compatible Hamilton cycles in random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.1438","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:32ba6fc9712e7b212e1d6ef0e5de513f4746ba96dad1aa318091036e1c6b5eb6","target":"record","created_at":"2026-05-18T01:32:50Z","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":"a606fefe4c05fae0c0279257e70c599bd62e4743849015b064d35488fed36df5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-06T16:16:01Z","title_canon_sha256":"1f3bd948e1d9e07e22a421c3c5c085ff6742b6d7b1e1954deacddc8c09880574"},"schema_version":"1.0","source":{"id":"1410.1438","kind":"arxiv","version":3}},"canonical_sha256":"3738c8c4820f7d04b0238ae4f75cf5c44d76c6f933aaf15b4d1a02ca9ebbc842","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3738c8c4820f7d04b0238ae4f75cf5c44d76c6f933aaf15b4d1a02ca9ebbc842","first_computed_at":"2026-05-18T01:32:50.725237Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:50.725237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KyHGAoBp7uc6LBRtI5Zk4rhIroG3OzUN8OjOpWHD1YNhELZwEEKtTraH9EOZdRo2h8f/dLnPrwp0x5kkYa9QCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:50.725836Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.1438","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:32ba6fc9712e7b212e1d6ef0e5de513f4746ba96dad1aa318091036e1c6b5eb6","sha256:8319d018fbec82831ca1ad34d658b7bcb9576f9065ec410d35906a148ed5ca68"],"state_sha256":"4baa8d5c493eccef3ba9ba2854d424d9f8e4c09d804d9612adcc81e44a883573"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8vtqCGwsvxLwIUxGL7EX5Oe9P5ygZEfczr+w9LOTEXEaf1mmLY/wzI3/w69z+phMgEs+CwJqwbGF6Kar83ZEAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T23:06:22.363829Z","bundle_sha256":"5b0b6fc952c17bab9237d349e4a9cd7701d0270ee80b17bdd7a3175e6418a272"}}