{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:7S3IAKM5A6QT5VIOA3X2JDOFDI","short_pith_number":"pith:7S3IAKM5","schema_version":"1.0","canonical_sha256":"fcb680299d07a13ed50e06efa48dc51a33a87c1d0fbb779f9b38c31746e4b8da","source":{"kind":"arxiv","id":"1601.04034","version":2},"attestation_state":"computed","paper":{"title":"Powers of Hamilton cycles in random graphs and tight Hamilton cycles in random hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Nemanja \\v{S}kori\\'c, Rajko Nenadov","submitted_at":"2016-01-15T19:06:30Z","abstract_excerpt":"We show that for every $k \\in \\mathbb{N}$ there exists $C > 0$ such that if $p^k \\ge C \\log^8 n / n$ then asymptotically almost surely the random graph $G_{n,p}$ contains the $k$\\textsuperscript{th} power of a Hamilton cycle. This determines the threshold for appearance of the square of a Hamilton cycle up to the logarithmic factor, improving a result of K\\\"uhn and Osthus. Moreover, our proof provides a randomized quasi-polynomial algorithm for finding such powers of cycles. Using similar ideas, we also give a randomized quasi-polynomial algorithm for finding a tight Hamilton cycle in the rand"},"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":"1601.04034","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-15T19:06:30Z","cross_cats_sorted":[],"title_canon_sha256":"35b37b28d0b07297380d57f8793a1cf424d4a8b2e4219d7d1833df6d47b4cfb3","abstract_canon_sha256":"02c38da87e3bfc858ce243fd6bf48c881a03f75f3f3487c5c9d085d41b68b168"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:25.000815Z","signature_b64":"a6HB70pvrLo/VrS9juTZCvuFUxGt92oCEi1whD7sHd2MczgbknlwxWUWOgT+UqMXtuG1DWYTRJ8QOja7SX7gCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fcb680299d07a13ed50e06efa48dc51a33a87c1d0fbb779f9b38c31746e4b8da","last_reissued_at":"2026-05-18T00:44:25.000190Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:25.000190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Powers of Hamilton cycles in random graphs and tight Hamilton cycles in random hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Nemanja \\v{S}kori\\'c, Rajko Nenadov","submitted_at":"2016-01-15T19:06:30Z","abstract_excerpt":"We show that for every $k \\in \\mathbb{N}$ there exists $C > 0$ such that if $p^k \\ge C \\log^8 n / n$ then asymptotically almost surely the random graph $G_{n,p}$ contains the $k$\\textsuperscript{th} power of a Hamilton cycle. This determines the threshold for appearance of the square of a Hamilton cycle up to the logarithmic factor, improving a result of K\\\"uhn and Osthus. Moreover, our proof provides a randomized quasi-polynomial algorithm for finding such powers of cycles. Using similar ideas, we also give a randomized quasi-polynomial algorithm for finding a tight Hamilton cycle in the rand"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.04034","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1601.04034","created_at":"2026-05-18T00:44:25.000291+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.04034v2","created_at":"2026-05-18T00:44:25.000291+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.04034","created_at":"2026-05-18T00:44:25.000291+00:00"},{"alias_kind":"pith_short_12","alias_value":"7S3IAKM5A6QT","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"7S3IAKM5A6QT5VIO","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"7S3IAKM5","created_at":"2026-05-18T12:30:04.600751+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/7S3IAKM5A6QT5VIOA3X2JDOFDI","json":"https://pith.science/pith/7S3IAKM5A6QT5VIOA3X2JDOFDI.json","graph_json":"https://pith.science/api/pith-number/7S3IAKM5A6QT5VIOA3X2JDOFDI/graph.json","events_json":"https://pith.science/api/pith-number/7S3IAKM5A6QT5VIOA3X2JDOFDI/events.json","paper":"https://pith.science/paper/7S3IAKM5"},"agent_actions":{"view_html":"https://pith.science/pith/7S3IAKM5A6QT5VIOA3X2JDOFDI","download_json":"https://pith.science/pith/7S3IAKM5A6QT5VIOA3X2JDOFDI.json","view_paper":"https://pith.science/paper/7S3IAKM5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.04034&json=true","fetch_graph":"https://pith.science/api/pith-number/7S3IAKM5A6QT5VIOA3X2JDOFDI/graph.json","fetch_events":"https://pith.science/api/pith-number/7S3IAKM5A6QT5VIOA3X2JDOFDI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7S3IAKM5A6QT5VIOA3X2JDOFDI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7S3IAKM5A6QT5VIOA3X2JDOFDI/action/storage_attestation","attest_author":"https://pith.science/pith/7S3IAKM5A6QT5VIOA3X2JDOFDI/action/author_attestation","sign_citation":"https://pith.science/pith/7S3IAKM5A6QT5VIOA3X2JDOFDI/action/citation_signature","submit_replication":"https://pith.science/pith/7S3IAKM5A6QT5VIOA3X2JDOFDI/action/replication_record"}},"created_at":"2026-05-18T00:44:25.000291+00:00","updated_at":"2026-05-18T00:44:25.000291+00:00"}