{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:4EUMNPKGSWMQCMA44RIFV2SOUA","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":"430a2642e93de1e509cb11058b39cabf9788221e855635fa382a3e452e6e3af0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-14T19:06:14Z","title_canon_sha256":"1e770230e4004302ba2be60d25d001f23eb3f8cf83c79bacb66d02802400447b"},"schema_version":"1.0","source":{"id":"1111.3325","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.3325","created_at":"2026-05-18T04:08:22Z"},{"alias_kind":"arxiv_version","alias_value":"1111.3325v1","created_at":"2026-05-18T04:08:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.3325","created_at":"2026-05-18T04:08:22Z"},{"alias_kind":"pith_short_12","alias_value":"4EUMNPKGSWMQ","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4EUMNPKGSWMQCMA4","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4EUMNPKG","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:f56621d6d23919feb01ef511615d63a6589955c0bd87b2a0d715abb0d090be48","target":"graph","created_at":"2026-05-18T04:08:22Z","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":"The problem of packing Hamilton cycles in random and pseudorandom graphs has been studied extensively. In this paper, we look at the dual question of covering all edges of a graph by Hamilton cycles and prove that if a graph with maximum degree $\\Delta$ satisfies some basic expansion properties and contains a family of $(1-o(1))\\Delta/2$ edge disjoint Hamilton cycles, then there also exists a covering of its edges by $(1+o(1))\\Delta/2$ Hamilton cycles. This implies that for every $\\alpha >0$ and every $p \\geq n^{\\alpha-1}$ there exists a covering of all edges of $G(n,p)$ by $(1+o(1))np/2$ Hami","authors_text":"Michael Krivelevich, Roman Glebov, Tibor Szab\\'o","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-14T19:06:14Z","title":"On covering expander graphs by Hamilton cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.3325","kind":"arxiv","version":1},"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:15c7cda4244b3a424e44b7824d5928789894d4ae1035d8617608041c2bf51516","target":"record","created_at":"2026-05-18T04:08:22Z","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":"430a2642e93de1e509cb11058b39cabf9788221e855635fa382a3e452e6e3af0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-14T19:06:14Z","title_canon_sha256":"1e770230e4004302ba2be60d25d001f23eb3f8cf83c79bacb66d02802400447b"},"schema_version":"1.0","source":{"id":"1111.3325","kind":"arxiv","version":1}},"canonical_sha256":"e128c6bd46959901301ce4505aea4ea0245a5b8d9568b01c1704f1c429ad1a17","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e128c6bd46959901301ce4505aea4ea0245a5b8d9568b01c1704f1c429ad1a17","first_computed_at":"2026-05-18T04:08:22.563272Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:08:22.563272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1U12GgiuvXglxySVobozi1r0KXb+M/BuXcJtzFTUJte843Q3b61RKoSxivzbferuaRIH+L9iXkpJI7UOtOuZDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:08:22.563744Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.3325","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:15c7cda4244b3a424e44b7824d5928789894d4ae1035d8617608041c2bf51516","sha256:f56621d6d23919feb01ef511615d63a6589955c0bd87b2a0d715abb0d090be48"],"state_sha256":"daed2f6f3e5dc34df77d4ceb03abcdfdbeed62bbfecc94a520f0c98d377528c8"}