{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:KYHOJQI6K3GSWRA5CHB4HIUIYC","short_pith_number":"pith:KYHOJQI6","canonical_record":{"source":{"id":"1802.08900","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-24T19:26:45Z","cross_cats_sorted":[],"title_canon_sha256":"fa06734f3eca378cac635e6135c56702bccaf421ba77e42852b09f8bdce4c376","abstract_canon_sha256":"e3e7d04dd4b9abdc8e59e68fab6efb233408ef9df2f26e2b13b1104c411ef8d3"},"schema_version":"1.0"},"canonical_sha256":"560ee4c11e56cd2b441d11c3c3a288c09a4bc23f451ead6e386c6feaadc0d987","source":{"kind":"arxiv","id":"1802.08900","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.08900","created_at":"2026-05-18T00:22:36Z"},{"alias_kind":"arxiv_version","alias_value":"1802.08900v1","created_at":"2026-05-18T00:22:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08900","created_at":"2026-05-18T00:22:36Z"},{"alias_kind":"pith_short_12","alias_value":"KYHOJQI6K3GS","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KYHOJQI6K3GSWRA5","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KYHOJQI6","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:KYHOJQI6K3GSWRA5CHB4HIUIYC","target":"record","payload":{"canonical_record":{"source":{"id":"1802.08900","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-24T19:26:45Z","cross_cats_sorted":[],"title_canon_sha256":"fa06734f3eca378cac635e6135c56702bccaf421ba77e42852b09f8bdce4c376","abstract_canon_sha256":"e3e7d04dd4b9abdc8e59e68fab6efb233408ef9df2f26e2b13b1104c411ef8d3"},"schema_version":"1.0"},"canonical_sha256":"560ee4c11e56cd2b441d11c3c3a288c09a4bc23f451ead6e386c6feaadc0d987","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:36.105432Z","signature_b64":"fT+OGmrA/h9/CG4uZk0HteA4GFYGkms0hoZ8/8U1ITugcx7jJ9LKythuW9bPBw1mP6ttMwIGHQTBQdolCvITBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"560ee4c11e56cd2b441d11c3c3a288c09a4bc23f451ead6e386c6feaadc0d987","last_reissued_at":"2026-05-18T00:22:36.104892Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:36.104892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.08900","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:22:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H9i9Sr3vMsGZbr7k3fb0Kmb8gU96A50kVqFwC+r0r5yuq0WnFY2XCES2uuhRohAEXstruL7Q0Ox+O9M+jYucDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:33:51.006833Z"},"content_sha256":"64469768239023b2ceb8ffa2ce68e9af5f975e3721f90b221fbf844601613640","schema_version":"1.0","event_id":"sha256:64469768239023b2ceb8ffa2ce68e9af5f975e3721f90b221fbf844601613640"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:KYHOJQI6K3GSWRA5CHB4HIUIYC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Powers of tight Hamilton cycles in randomly perturbed hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guilherme Oliveira Mota, Jie Han, Wiebke Bedenknecht, Yoshiharu Kohayakawa","submitted_at":"2018-02-24T19:26:45Z","abstract_excerpt":"For $k\\ge 2$ and $r\\ge 1$ such that $k+r\\ge 4$, we prove that, for any $\\alpha>0$, there exists $\\epsilon>0$ such that the union of an $n$-vertex $k$-graph with minimum codegree $\\left(1-\\binom{k+r-2}{k-1}^{-1}+\\alpha\\right)n$ and a binomial random $k$-graph $\\mathbb{G}^{(k)}(n,p)$ with $p\\ge n^{-\\binom{k+r-2}{k-1}^{-1}-\\epsilon}$ on the same vertex set contains the $r^{\\text{th}}$ power of a tight Hamilton cycle with high probability. This result for $r=1$ was first proved by McDowell and Mycroft."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.08900","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:22:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+b1Mf1ktQwBu7myCtkZV1xdY3w3S8it+p3UYwRhNL5vjiSL6Nfzcllpq44/JrXUUTkDlFpX4e2adzowUavWGCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:33:51.007393Z"},"content_sha256":"98b92b7b9b76cf5eb8ef93ee0d03e5f57d16e1275e741d3412c38da5f8a25e4b","schema_version":"1.0","event_id":"sha256:98b92b7b9b76cf5eb8ef93ee0d03e5f57d16e1275e741d3412c38da5f8a25e4b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KYHOJQI6K3GSWRA5CHB4HIUIYC/bundle.json","state_url":"https://pith.science/pith/KYHOJQI6K3GSWRA5CHB4HIUIYC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KYHOJQI6K3GSWRA5CHB4HIUIYC/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-27T16:33:51Z","links":{"resolver":"https://pith.science/pith/KYHOJQI6K3GSWRA5CHB4HIUIYC","bundle":"https://pith.science/pith/KYHOJQI6K3GSWRA5CHB4HIUIYC/bundle.json","state":"https://pith.science/pith/KYHOJQI6K3GSWRA5CHB4HIUIYC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KYHOJQI6K3GSWRA5CHB4HIUIYC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KYHOJQI6K3GSWRA5CHB4HIUIYC","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":"e3e7d04dd4b9abdc8e59e68fab6efb233408ef9df2f26e2b13b1104c411ef8d3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-24T19:26:45Z","title_canon_sha256":"fa06734f3eca378cac635e6135c56702bccaf421ba77e42852b09f8bdce4c376"},"schema_version":"1.0","source":{"id":"1802.08900","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.08900","created_at":"2026-05-18T00:22:36Z"},{"alias_kind":"arxiv_version","alias_value":"1802.08900v1","created_at":"2026-05-18T00:22:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08900","created_at":"2026-05-18T00:22:36Z"},{"alias_kind":"pith_short_12","alias_value":"KYHOJQI6K3GS","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KYHOJQI6K3GSWRA5","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KYHOJQI6","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:98b92b7b9b76cf5eb8ef93ee0d03e5f57d16e1275e741d3412c38da5f8a25e4b","target":"graph","created_at":"2026-05-18T00:22:36Z","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":"For $k\\ge 2$ and $r\\ge 1$ such that $k+r\\ge 4$, we prove that, for any $\\alpha>0$, there exists $\\epsilon>0$ such that the union of an $n$-vertex $k$-graph with minimum codegree $\\left(1-\\binom{k+r-2}{k-1}^{-1}+\\alpha\\right)n$ and a binomial random $k$-graph $\\mathbb{G}^{(k)}(n,p)$ with $p\\ge n^{-\\binom{k+r-2}{k-1}^{-1}-\\epsilon}$ on the same vertex set contains the $r^{\\text{th}}$ power of a tight Hamilton cycle with high probability. This result for $r=1$ was first proved by McDowell and Mycroft.","authors_text":"Guilherme Oliveira Mota, Jie Han, Wiebke Bedenknecht, Yoshiharu Kohayakawa","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-24T19:26:45Z","title":"Powers of tight Hamilton cycles in randomly perturbed hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.08900","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:64469768239023b2ceb8ffa2ce68e9af5f975e3721f90b221fbf844601613640","target":"record","created_at":"2026-05-18T00:22:36Z","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":"e3e7d04dd4b9abdc8e59e68fab6efb233408ef9df2f26e2b13b1104c411ef8d3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-24T19:26:45Z","title_canon_sha256":"fa06734f3eca378cac635e6135c56702bccaf421ba77e42852b09f8bdce4c376"},"schema_version":"1.0","source":{"id":"1802.08900","kind":"arxiv","version":1}},"canonical_sha256":"560ee4c11e56cd2b441d11c3c3a288c09a4bc23f451ead6e386c6feaadc0d987","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"560ee4c11e56cd2b441d11c3c3a288c09a4bc23f451ead6e386c6feaadc0d987","first_computed_at":"2026-05-18T00:22:36.104892Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:36.104892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fT+OGmrA/h9/CG4uZk0HteA4GFYGkms0hoZ8/8U1ITugcx7jJ9LKythuW9bPBw1mP6ttMwIGHQTBQdolCvITBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:36.105432Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.08900","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:64469768239023b2ceb8ffa2ce68e9af5f975e3721f90b221fbf844601613640","sha256:98b92b7b9b76cf5eb8ef93ee0d03e5f57d16e1275e741d3412c38da5f8a25e4b"],"state_sha256":"ac87f98143e9999d33f152255ccbf2d6083454d60fa6beb2b2a40c3b13de6d55"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TGgVDCSHGg2CHtmdb0k4vK1rcsfmLAmXRxfvXNWjAbemUf77RViUU31gS+8r3lKSAjyxjsh1G0ZiAT4MoQ08DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T16:33:51.010375Z","bundle_sha256":"9d8b64499303220393b6b14ec4cb17554bf71ecf742193a2a4d2179eee1a7c2f"}}