{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KYHOJQI6K3GSWRA5CHB4HIUIYC","short_pith_number":"pith:KYHOJQI6","schema_version":"1.0","canonical_sha256":"560ee4c11e56cd2b441d11c3c3a288c09a4bc23f451ead6e386c6feaadc0d987","source":{"kind":"arxiv","id":"1802.08900","version":1},"attestation_state":"computed","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1802.08900","created_at":"2026-05-18T00:22:36.104978+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.08900v1","created_at":"2026-05-18T00:22:36.104978+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08900","created_at":"2026-05-18T00:22:36.104978+00:00"},{"alias_kind":"pith_short_12","alias_value":"KYHOJQI6K3GS","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"KYHOJQI6K3GSWRA5","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"KYHOJQI6","created_at":"2026-05-18T12:32:33.847187+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KYHOJQI6K3GSWRA5CHB4HIUIYC","json":"https://pith.science/pith/KYHOJQI6K3GSWRA5CHB4HIUIYC.json","graph_json":"https://pith.science/api/pith-number/KYHOJQI6K3GSWRA5CHB4HIUIYC/graph.json","events_json":"https://pith.science/api/pith-number/KYHOJQI6K3GSWRA5CHB4HIUIYC/events.json","paper":"https://pith.science/paper/KYHOJQI6"},"agent_actions":{"view_html":"https://pith.science/pith/KYHOJQI6K3GSWRA5CHB4HIUIYC","download_json":"https://pith.science/pith/KYHOJQI6K3GSWRA5CHB4HIUIYC.json","view_paper":"https://pith.science/paper/KYHOJQI6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.08900&json=true","fetch_graph":"https://pith.science/api/pith-number/KYHOJQI6K3GSWRA5CHB4HIUIYC/graph.json","fetch_events":"https://pith.science/api/pith-number/KYHOJQI6K3GSWRA5CHB4HIUIYC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KYHOJQI6K3GSWRA5CHB4HIUIYC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KYHOJQI6K3GSWRA5CHB4HIUIYC/action/storage_attestation","attest_author":"https://pith.science/pith/KYHOJQI6K3GSWRA5CHB4HIUIYC/action/author_attestation","sign_citation":"https://pith.science/pith/KYHOJQI6K3GSWRA5CHB4HIUIYC/action/citation_signature","submit_replication":"https://pith.science/pith/KYHOJQI6K3GSWRA5CHB4HIUIYC/action/replication_record"}},"created_at":"2026-05-18T00:22:36.104978+00:00","updated_at":"2026-05-18T00:22:36.104978+00:00"}