{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:NIBFG7I3R6W6A6XTPIXZL6GUDG","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":"4d65f8e5212a3ba0d342770a60bc034b45db0291fbb3c9e0bfb3935d0b960593","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-16T11:55:55Z","title_canon_sha256":"161ad552a91074fde3065ef20a7aadbd3814e31bc7fb6ccdfad1dd94b60fb9d5"},"schema_version":"1.0","source":{"id":"2607.14881","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.14881","created_at":"2026-07-17T01:21:56Z"},{"alias_kind":"arxiv_version","alias_value":"2607.14881v1","created_at":"2026-07-17T01:21:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.14881","created_at":"2026-07-17T01:21:56Z"},{"alias_kind":"pith_short_12","alias_value":"NIBFG7I3R6W6","created_at":"2026-07-17T01:21:56Z"},{"alias_kind":"pith_short_16","alias_value":"NIBFG7I3R6W6A6XT","created_at":"2026-07-17T01:21:56Z"},{"alias_kind":"pith_short_8","alias_value":"NIBFG7I3","created_at":"2026-07-17T01:21:56Z"}],"graph_snapshots":[{"event_id":"sha256:c5e01887a0ac21d06fd179c931d27ef7178df64deef43c461f73d46c1e1df8d0","target":"graph","created_at":"2026-07-17T01:21:56Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.14881/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A Hamilton cover of a graph is a collection of Hamilton cycles whose union contains all edges. Since each Hamilton cycle covers two edges at every vertex, every Hamilton cover has size at least $\\lceil \\Delta(G)/2\\rceil$. We prove that this lower bound is tight for binomial random graphs $G(n,p)$ throughout the widest possible range of edge probabilities: if $\\omega(n)\\to\\infty$ and \\[\n  \\frac{\\log n+\\log\\log n+\\omega(n)}{n}\n  \\le p=p(n) \\le\n  1-\\frac{\\omega(n)}{n^{2}}, \\] then $G\\sim G(n,p)$ with high probability has a Hamilton cover of size $\\left\\lceil \\frac{\\Delta(G)}{2}\\right\\rceil. $ The","authors_text":"Michael Krivelevich, Nemanja Dragani\\'c","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-16T11:55:55Z","title":"Efficient Hamilton covers and linear arboricity of random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.14881","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:9388f599e40b2b40fb3c3b8fc949effd68e5e93982ac0e639d1e1961f668c105","target":"record","created_at":"2026-07-17T01:21:56Z","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":"4d65f8e5212a3ba0d342770a60bc034b45db0291fbb3c9e0bfb3935d0b960593","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-16T11:55:55Z","title_canon_sha256":"161ad552a91074fde3065ef20a7aadbd3814e31bc7fb6ccdfad1dd94b60fb9d5"},"schema_version":"1.0","source":{"id":"2607.14881","kind":"arxiv","version":1}},"canonical_sha256":"6a02537d1b8fade07af37a2f95f8d4199faa649a095775b52889fd77a8ec8be0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6a02537d1b8fade07af37a2f95f8d4199faa649a095775b52889fd77a8ec8be0","first_computed_at":"2026-07-17T01:21:56.839468Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-17T01:21:56.839468Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PBWQHymwsbsIgVbs+dtizKFT96MKbylEF/DMSvbOEeJSJDSdK/e/f1DjzOGO9r8thw/pTWMjkvUbX6iIZ0bSCg==","signature_status":"signed_v1","signed_at":"2026-07-17T01:21:56.840154Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.14881","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9388f599e40b2b40fb3c3b8fc949effd68e5e93982ac0e639d1e1961f668c105","sha256:c5e01887a0ac21d06fd179c931d27ef7178df64deef43c461f73d46c1e1df8d0"],"state_sha256":"493ebf55325bbeb60ff778c0d441008aa4d3f6ba6e90da7ed7add45ff8b91dc4"}