{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:F7A4IRRIVEFPYRPVZ25LU3CUSK","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":"579446852b90eaf68ba8cc3975074201a1889e907283e41297956a23c1a0b876","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-09T19:47:23Z","title_canon_sha256":"39e00bdf970068da81ba377b7943fa090f6272650a07dc97e7bc2db076ce8e9c"},"schema_version":"1.0","source":{"id":"1306.2057","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.2057","created_at":"2026-05-18T03:03:20Z"},{"alias_kind":"arxiv_version","alias_value":"1306.2057v3","created_at":"2026-05-18T03:03:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.2057","created_at":"2026-05-18T03:03:20Z"},{"alias_kind":"pith_short_12","alias_value":"F7A4IRRIVEFP","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"F7A4IRRIVEFPYRPV","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"F7A4IRRI","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:1f4bb081412ae15aff05b6a609811cc5795fb73cdc4aae2c3f56569d9fa6a63b","target":"graph","created_at":"2026-05-18T03:03:20Z","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 a graph $G$ the random $n$-lift of $G$ is obtained by replacing each of its vertices by a set of $n$ vertices, and joining a pair of sets by a random matching whenever the corresponding vertices of $G$ are adjacent. We show that asymptotically almost surely the random lift of a graph $G$ is hamiltonian, provided $G$ has the minimum degree at least $5$ and contains two disjoint Hamiltonian cycles whose union is not a bipartite graph.","authors_text":"{\\L}ukasz Witkowski, Marcin Witkowski, Tomasz {\\L}uczak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-09T19:47:23Z","title":"Hamilton Cycles in Random Lifts of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.2057","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:94feca7a0f4d7184d340d146c37306e3855fc5370e68e3253924cae4257739ee","target":"record","created_at":"2026-05-18T03:03:20Z","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":"579446852b90eaf68ba8cc3975074201a1889e907283e41297956a23c1a0b876","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-09T19:47:23Z","title_canon_sha256":"39e00bdf970068da81ba377b7943fa090f6272650a07dc97e7bc2db076ce8e9c"},"schema_version":"1.0","source":{"id":"1306.2057","kind":"arxiv","version":3}},"canonical_sha256":"2fc1c44628a90afc45f5cebaba6c5492aa6dc7f2df3f2f87b4c989f5ea4da823","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2fc1c44628a90afc45f5cebaba6c5492aa6dc7f2df3f2f87b4c989f5ea4da823","first_computed_at":"2026-05-18T03:03:20.906180Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:03:20.906180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z2cKSySl+fdvb9kqzlIW0PtfIqEwhCF5pGyH4Px50MYzt/bqTBGGwcuCp1JOAyRnw0bsE+NPBfghqBWdunGNBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:03:20.906868Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.2057","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:94feca7a0f4d7184d340d146c37306e3855fc5370e68e3253924cae4257739ee","sha256:1f4bb081412ae15aff05b6a609811cc5795fb73cdc4aae2c3f56569d9fa6a63b"],"state_sha256":"647fec64efc1f73b942d24e7cfd2d036719a2507fdae9ef24d08fe6e96bff598"}