{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:B5GRT5O6U5JRL77WZEV4OLEUWQ","short_pith_number":"pith:B5GRT5O6","canonical_record":{"source":{"id":"1203.3868","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-17T14:44:57Z","cross_cats_sorted":[],"title_canon_sha256":"b04c20dca3aeb51776313f9c363710386917429d6a133b7ba45c83d64de04bb8","abstract_canon_sha256":"197dc1e408bac495d859e5b9444274861108b5e2ffc441aab9ffec3925505724"},"schema_version":"1.0"},"canonical_sha256":"0f4d19f5dea75315fff6c92bc72c94b4154cf56e26f1c038e2eed4359447b3f0","source":{"kind":"arxiv","id":"1203.3868","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.3868","created_at":"2026-05-18T03:17:44Z"},{"alias_kind":"arxiv_version","alias_value":"1203.3868v2","created_at":"2026-05-18T03:17:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.3868","created_at":"2026-05-18T03:17:44Z"},{"alias_kind":"pith_short_12","alias_value":"B5GRT5O6U5JR","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"B5GRT5O6U5JRL77W","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"B5GRT5O6","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:B5GRT5O6U5JRL77WZEV4OLEUWQ","target":"record","payload":{"canonical_record":{"source":{"id":"1203.3868","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-17T14:44:57Z","cross_cats_sorted":[],"title_canon_sha256":"b04c20dca3aeb51776313f9c363710386917429d6a133b7ba45c83d64de04bb8","abstract_canon_sha256":"197dc1e408bac495d859e5b9444274861108b5e2ffc441aab9ffec3925505724"},"schema_version":"1.0"},"canonical_sha256":"0f4d19f5dea75315fff6c92bc72c94b4154cf56e26f1c038e2eed4359447b3f0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:44.747167Z","signature_b64":"AB/ZcYMnUg4gdLwJNF7oBZdZRqHTg93uQqYGZ/+y/r0NJdYe2Z1Ax8x1O7QCjmB2mvAD4wxuNiC0j8UiBJ1xCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f4d19f5dea75315fff6c92bc72c94b4154cf56e26f1c038e2eed4359447b3f0","last_reissued_at":"2026-05-18T03:17:44.746473Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:44.746473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.3868","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-18T03:17:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LsCYB03gTrtpyxMRURYC0rrqbDaLA+gPjbHNf6empnpGAjNyomUpor0O2OouLnA30/M83s/B8aXlejfyCV5WBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:50:16.057684Z"},"content_sha256":"048157d7640653f82a4d4c4b569260b1c719af1a5ae5d85dff6c7f617886c3aa","schema_version":"1.0","event_id":"sha256:048157d7640653f82a4d4c4b569260b1c719af1a5ae5d85dff6c7f617886c3aa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:B5GRT5O6U5JRL77WZEV4OLEUWQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal covers with Hamilton cycles in random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dan Hefetz, Daniela K\\\"uhn, Deryk Osthus, John Lapinskas","submitted_at":"2012-03-17T14:44:57Z","abstract_excerpt":"A packing of a graph G with Hamilton cycles is a set of edge-disjoint Hamilton cycles in G. Such packings have been studied intensively and recent results imply that a largest packing of Hamilton cycles in G_n,p a.a.s. has size \\lfloor delta(G_n,p) /2 \\rfloor. Glebov, Krivelevich and Szab\\'o recently initiated research on the `dual' problem, where one asks for a set of Hamilton cycles covering all edges of G. Our main result states that for log^{117}n / n < p < 1-n^{-1/8}, a.a.s. the edges of G_n,p can be covered by \\lceil Delta(G_n,p)/2 \\rceil Hamilton cycles. This is clearly optimal and impr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.3868","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-18T03:17:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EN8nPzEDc78uaHEzu1oF15dyix0/rBNF2ErYDCswOk/gupbNXaqdEQlWJoVbX0PXibsPZLPopYQ0UAtqL6xBAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:50:16.058450Z"},"content_sha256":"80be86dc71cc1792d863c7356ea513ffbe239118e273236c449a7ee38e73a692","schema_version":"1.0","event_id":"sha256:80be86dc71cc1792d863c7356ea513ffbe239118e273236c449a7ee38e73a692"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B5GRT5O6U5JRL77WZEV4OLEUWQ/bundle.json","state_url":"https://pith.science/pith/B5GRT5O6U5JRL77WZEV4OLEUWQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B5GRT5O6U5JRL77WZEV4OLEUWQ/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-05-30T17:50:16Z","links":{"resolver":"https://pith.science/pith/B5GRT5O6U5JRL77WZEV4OLEUWQ","bundle":"https://pith.science/pith/B5GRT5O6U5JRL77WZEV4OLEUWQ/bundle.json","state":"https://pith.science/pith/B5GRT5O6U5JRL77WZEV4OLEUWQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B5GRT5O6U5JRL77WZEV4OLEUWQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:B5GRT5O6U5JRL77WZEV4OLEUWQ","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":"197dc1e408bac495d859e5b9444274861108b5e2ffc441aab9ffec3925505724","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-17T14:44:57Z","title_canon_sha256":"b04c20dca3aeb51776313f9c363710386917429d6a133b7ba45c83d64de04bb8"},"schema_version":"1.0","source":{"id":"1203.3868","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.3868","created_at":"2026-05-18T03:17:44Z"},{"alias_kind":"arxiv_version","alias_value":"1203.3868v2","created_at":"2026-05-18T03:17:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.3868","created_at":"2026-05-18T03:17:44Z"},{"alias_kind":"pith_short_12","alias_value":"B5GRT5O6U5JR","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"B5GRT5O6U5JRL77W","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"B5GRT5O6","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:80be86dc71cc1792d863c7356ea513ffbe239118e273236c449a7ee38e73a692","target":"graph","created_at":"2026-05-18T03:17:44Z","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":"A packing of a graph G with Hamilton cycles is a set of edge-disjoint Hamilton cycles in G. Such packings have been studied intensively and recent results imply that a largest packing of Hamilton cycles in G_n,p a.a.s. has size \\lfloor delta(G_n,p) /2 \\rfloor. Glebov, Krivelevich and Szab\\'o recently initiated research on the `dual' problem, where one asks for a set of Hamilton cycles covering all edges of G. Our main result states that for log^{117}n / n < p < 1-n^{-1/8}, a.a.s. the edges of G_n,p can be covered by \\lceil Delta(G_n,p)/2 \\rceil Hamilton cycles. This is clearly optimal and impr","authors_text":"Dan Hefetz, Daniela K\\\"uhn, Deryk Osthus, John Lapinskas","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-17T14:44:57Z","title":"Optimal covers with Hamilton cycles in random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.3868","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:048157d7640653f82a4d4c4b569260b1c719af1a5ae5d85dff6c7f617886c3aa","target":"record","created_at":"2026-05-18T03:17:44Z","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":"197dc1e408bac495d859e5b9444274861108b5e2ffc441aab9ffec3925505724","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-17T14:44:57Z","title_canon_sha256":"b04c20dca3aeb51776313f9c363710386917429d6a133b7ba45c83d64de04bb8"},"schema_version":"1.0","source":{"id":"1203.3868","kind":"arxiv","version":2}},"canonical_sha256":"0f4d19f5dea75315fff6c92bc72c94b4154cf56e26f1c038e2eed4359447b3f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f4d19f5dea75315fff6c92bc72c94b4154cf56e26f1c038e2eed4359447b3f0","first_computed_at":"2026-05-18T03:17:44.746473Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:17:44.746473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AB/ZcYMnUg4gdLwJNF7oBZdZRqHTg93uQqYGZ/+y/r0NJdYe2Z1Ax8x1O7QCjmB2mvAD4wxuNiC0j8UiBJ1xCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:17:44.747167Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.3868","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:048157d7640653f82a4d4c4b569260b1c719af1a5ae5d85dff6c7f617886c3aa","sha256:80be86dc71cc1792d863c7356ea513ffbe239118e273236c449a7ee38e73a692"],"state_sha256":"86482da7bc151321f7573c3a0adb4928dc2f7ffad0dacf966eacfde3d9bfcc11"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cyFFaPXJNLuRXT1sKTRxCeTuRGaKo9itldhFDR3uiTPu9txc57ijnwCJg+6bVXC/eQYLb7iB4Um4/UKiKAbaBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T17:50:16.061904Z","bundle_sha256":"33861ea076052ed98e750845b4599b1167a6f8643daab174280567b2c1e70330"}}