{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:SL7HUKMHTNHDIJ4VCQUP5KZJPQ","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":"97909111ae5d09223bd9177150485cada18b0011e6d5376c08adb91dbc3acfe4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-06-07T14:42:39Z","title_canon_sha256":"733f13c99d551b5d7840453edff44b7e14c0dcdd10a9df728fe2ac44bbb3a803"},"schema_version":"1.0","source":{"id":"1006.1268","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.1268","created_at":"2026-05-18T03:19:22Z"},{"alias_kind":"arxiv_version","alias_value":"1006.1268v2","created_at":"2026-05-18T03:19:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.1268","created_at":"2026-05-18T03:19:22Z"},{"alias_kind":"pith_short_12","alias_value":"SL7HUKMHTNHD","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"SL7HUKMHTNHDIJ4V","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"SL7HUKMH","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:63b4d56507b0d255220a22b5662fc828e8401c5dab6a4ae5b6e974f9beb9a706","target":"graph","created_at":"2026-05-18T03:19: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":"We show that if pn >> log n, the binomial random graph G_{n,p} has an approximate Hamilton decomposition. More precisely, we show that in this range G_{n,p} contains a set of edge-disjoint Hamilton cycles covering almost all of its edges. This is best possible in the sense that the condition that pn >> log n is necessary.","authors_text":"Daniela K\\\"uhn, Deryk Osthus, Fiachra Knox","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-06-07T14:42:39Z","title":"Approximate Hamilton Decompositions of Random Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.1268","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:30144ed2d3fc84e25e317e7d04aca03add8075b52db877c68aa02aba73671cf2","target":"record","created_at":"2026-05-18T03:19: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":"97909111ae5d09223bd9177150485cada18b0011e6d5376c08adb91dbc3acfe4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-06-07T14:42:39Z","title_canon_sha256":"733f13c99d551b5d7840453edff44b7e14c0dcdd10a9df728fe2ac44bbb3a803"},"schema_version":"1.0","source":{"id":"1006.1268","kind":"arxiv","version":2}},"canonical_sha256":"92fe7a29879b4e3427951428feab297c05fde51fb3e3edf1b586514f19556ae8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"92fe7a29879b4e3427951428feab297c05fde51fb3e3edf1b586514f19556ae8","first_computed_at":"2026-05-18T03:19:22.757267Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:19:22.757267Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LZ74yYTb9APE0TgDVySmSSUUQOUdwMOsKc5MsVRFCW5AE2vs2J6rjVErIAflHGC0v3zfRlaaJcKHt3TviMoaCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:19:22.757907Z","signed_message":"canonical_sha256_bytes"},"source_id":"1006.1268","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:30144ed2d3fc84e25e317e7d04aca03add8075b52db877c68aa02aba73671cf2","sha256:63b4d56507b0d255220a22b5662fc828e8401c5dab6a4ae5b6e974f9beb9a706"],"state_sha256":"67f789d16e28bb0e4d660352bca6073f2ab4b6b21f65145d67581ac5e1e6637c"}