{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:7S3IAKM5A6QT5VIOA3X2JDOFDI","short_pith_number":"pith:7S3IAKM5","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"},"canonical_sha256":"fcb680299d07a13ed50e06efa48dc51a33a87c1d0fbb779f9b38c31746e4b8da","source":{"kind":"arxiv","id":"1601.04034","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.04034","created_at":"2026-05-18T00:44:25Z"},{"alias_kind":"arxiv_version","alias_value":"1601.04034v2","created_at":"2026-05-18T00:44:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.04034","created_at":"2026-05-18T00:44:25Z"},{"alias_kind":"pith_short_12","alias_value":"7S3IAKM5A6QT","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7S3IAKM5A6QT5VIO","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7S3IAKM5","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:7S3IAKM5A6QT5VIOA3X2JDOFDI","target":"record","payload":{"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"},"canonical_sha256":"fcb680299d07a13ed50e06efa48dc51a33a87c1d0fbb779f9b38c31746e4b8da","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"},"source_kind":"arxiv","source_id":"1601.04034","source_version":2,"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:44:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZlY+HZR9NwqV40yKh7Nddjpp8BP5GXOm6OKncNnN8GG5aQu8jJk/w3VAmYtDE3qvXxkqJVK8B+qNQUXv3LYYBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:18:16.056350Z"},"content_sha256":"42a92a9bd6907ad26a946f4a17bc1be372b5e79a0cde18f2fd3ee7b4faca5f6b","schema_version":"1.0","event_id":"sha256:42a92a9bd6907ad26a946f4a17bc1be372b5e79a0cde18f2fd3ee7b4faca5f6b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:7S3IAKM5A6QT5VIOA3X2JDOFDI","target":"graph","payload":{"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"},"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:44:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8IFVHr+R8x0jdqUkGw7gG9OuSAVQkbyblD3StsAjTRxukG3KmjKUbOsnoZFlo0Lk/ewc4tM11PkGwR2ASDnLDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:18:16.056698Z"},"content_sha256":"1e8e6cd16ccec3e80ad91f8895b2c2395aa273a5d90dd214f0f6581917f574fe","schema_version":"1.0","event_id":"sha256:1e8e6cd16ccec3e80ad91f8895b2c2395aa273a5d90dd214f0f6581917f574fe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7S3IAKM5A6QT5VIOA3X2JDOFDI/bundle.json","state_url":"https://pith.science/pith/7S3IAKM5A6QT5VIOA3X2JDOFDI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7S3IAKM5A6QT5VIOA3X2JDOFDI/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-03T02:18:16Z","links":{"resolver":"https://pith.science/pith/7S3IAKM5A6QT5VIOA3X2JDOFDI","bundle":"https://pith.science/pith/7S3IAKM5A6QT5VIOA3X2JDOFDI/bundle.json","state":"https://pith.science/pith/7S3IAKM5A6QT5VIOA3X2JDOFDI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7S3IAKM5A6QT5VIOA3X2JDOFDI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:7S3IAKM5A6QT5VIOA3X2JDOFDI","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":"02c38da87e3bfc858ce243fd6bf48c881a03f75f3f3487c5c9d085d41b68b168","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-15T19:06:30Z","title_canon_sha256":"35b37b28d0b07297380d57f8793a1cf424d4a8b2e4219d7d1833df6d47b4cfb3"},"schema_version":"1.0","source":{"id":"1601.04034","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.04034","created_at":"2026-05-18T00:44:25Z"},{"alias_kind":"arxiv_version","alias_value":"1601.04034v2","created_at":"2026-05-18T00:44:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.04034","created_at":"2026-05-18T00:44:25Z"},{"alias_kind":"pith_short_12","alias_value":"7S3IAKM5A6QT","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7S3IAKM5A6QT5VIO","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7S3IAKM5","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:1e8e6cd16ccec3e80ad91f8895b2c2395aa273a5d90dd214f0f6581917f574fe","target":"graph","created_at":"2026-05-18T00:44:25Z","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":"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","authors_text":"Nemanja \\v{S}kori\\'c, Rajko Nenadov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-15T19:06:30Z","title":"Powers of Hamilton cycles in random graphs and tight Hamilton cycles in random hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.04034","kind":"arxiv","version":2},"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:42a92a9bd6907ad26a946f4a17bc1be372b5e79a0cde18f2fd3ee7b4faca5f6b","target":"record","created_at":"2026-05-18T00:44:25Z","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":"02c38da87e3bfc858ce243fd6bf48c881a03f75f3f3487c5c9d085d41b68b168","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-15T19:06:30Z","title_canon_sha256":"35b37b28d0b07297380d57f8793a1cf424d4a8b2e4219d7d1833df6d47b4cfb3"},"schema_version":"1.0","source":{"id":"1601.04034","kind":"arxiv","version":2}},"canonical_sha256":"fcb680299d07a13ed50e06efa48dc51a33a87c1d0fbb779f9b38c31746e4b8da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fcb680299d07a13ed50e06efa48dc51a33a87c1d0fbb779f9b38c31746e4b8da","first_computed_at":"2026-05-18T00:44:25.000190Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:25.000190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a6HB70pvrLo/VrS9juTZCvuFUxGt92oCEi1whD7sHd2MczgbknlwxWUWOgT+UqMXtuG1DWYTRJ8QOja7SX7gCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:25.000815Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.04034","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:42a92a9bd6907ad26a946f4a17bc1be372b5e79a0cde18f2fd3ee7b4faca5f6b","sha256:1e8e6cd16ccec3e80ad91f8895b2c2395aa273a5d90dd214f0f6581917f574fe"],"state_sha256":"e905ac9155b88649b74838bb6f98ef4aa302288302af80cabc77b371be2b0089"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IjmZGW5G4d+X6N8u7iE6fWO2XORlDkmv9QL1cmX6Oaupb6SvzEkD7EuG521cY5ni0JL7vJxWcqh1Q2Peyw9dAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T02:18:16.058784Z","bundle_sha256":"94bbb26c1f76456dd19b09c3016386b2f8c298d74770f995ec90861d58d01c23"}}