{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:F7A4IRRIVEFPYRPVZ25LU3CUSK","short_pith_number":"pith:F7A4IRRI","schema_version":"1.0","canonical_sha256":"2fc1c44628a90afc45f5cebaba6c5492aa6dc7f2df3f2f87b4c989f5ea4da823","source":{"kind":"arxiv","id":"1306.2057","version":3},"attestation_state":"computed","paper":{"title":"Hamilton Cycles in Random Lifts of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"{\\L}ukasz Witkowski, Marcin Witkowski, Tomasz {\\L}uczak","submitted_at":"2013-06-09T19:47:23Z","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."},"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":"1306.2057","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-09T19:47:23Z","cross_cats_sorted":[],"title_canon_sha256":"39e00bdf970068da81ba377b7943fa090f6272650a07dc97e7bc2db076ce8e9c","abstract_canon_sha256":"579446852b90eaf68ba8cc3975074201a1889e907283e41297956a23c1a0b876"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:20.906868Z","signature_b64":"Z2cKSySl+fdvb9kqzlIW0PtfIqEwhCF5pGyH4Px50MYzt/bqTBGGwcuCp1JOAyRnw0bsE+NPBfghqBWdunGNBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2fc1c44628a90afc45f5cebaba6c5492aa6dc7f2df3f2f87b4c989f5ea4da823","last_reissued_at":"2026-05-18T03:03:20.906180Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:20.906180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hamilton Cycles in Random Lifts of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"{\\L}ukasz Witkowski, Marcin Witkowski, Tomasz {\\L}uczak","submitted_at":"2013-06-09T19:47:23Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.2057","kind":"arxiv","version":3},"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":"1306.2057","created_at":"2026-05-18T03:03:20.906307+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.2057v3","created_at":"2026-05-18T03:03:20.906307+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.2057","created_at":"2026-05-18T03:03:20.906307+00:00"},{"alias_kind":"pith_short_12","alias_value":"F7A4IRRIVEFP","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"F7A4IRRIVEFPYRPV","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"F7A4IRRI","created_at":"2026-05-18T12:27:45.050594+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/F7A4IRRIVEFPYRPVZ25LU3CUSK","json":"https://pith.science/pith/F7A4IRRIVEFPYRPVZ25LU3CUSK.json","graph_json":"https://pith.science/api/pith-number/F7A4IRRIVEFPYRPVZ25LU3CUSK/graph.json","events_json":"https://pith.science/api/pith-number/F7A4IRRIVEFPYRPVZ25LU3CUSK/events.json","paper":"https://pith.science/paper/F7A4IRRI"},"agent_actions":{"view_html":"https://pith.science/pith/F7A4IRRIVEFPYRPVZ25LU3CUSK","download_json":"https://pith.science/pith/F7A4IRRIVEFPYRPVZ25LU3CUSK.json","view_paper":"https://pith.science/paper/F7A4IRRI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.2057&json=true","fetch_graph":"https://pith.science/api/pith-number/F7A4IRRIVEFPYRPVZ25LU3CUSK/graph.json","fetch_events":"https://pith.science/api/pith-number/F7A4IRRIVEFPYRPVZ25LU3CUSK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F7A4IRRIVEFPYRPVZ25LU3CUSK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F7A4IRRIVEFPYRPVZ25LU3CUSK/action/storage_attestation","attest_author":"https://pith.science/pith/F7A4IRRIVEFPYRPVZ25LU3CUSK/action/author_attestation","sign_citation":"https://pith.science/pith/F7A4IRRIVEFPYRPVZ25LU3CUSK/action/citation_signature","submit_replication":"https://pith.science/pith/F7A4IRRIVEFPYRPVZ25LU3CUSK/action/replication_record"}},"created_at":"2026-05-18T03:03:20.906307+00:00","updated_at":"2026-05-18T03:03:20.906307+00:00"}