{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:NIBFG7I3R6W6A6XTPIXZL6GUDG","short_pith_number":"pith:NIBFG7I3","schema_version":"1.0","canonical_sha256":"6a02537d1b8fade07af37a2f95f8d4199faa649a095775b52889fd77a8ec8be0","source":{"kind":"arxiv","id":"2607.14881","version":1},"attestation_state":"computed","paper":{"title":"Efficient Hamilton covers and linear arboricity of random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael Krivelevich, Nemanja Dragani\\'c","submitted_at":"2026-07-16T11:55:55Z","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"},"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":"2607.14881","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-16T11:55:55Z","cross_cats_sorted":[],"title_canon_sha256":"161ad552a91074fde3065ef20a7aadbd3814e31bc7fb6ccdfad1dd94b60fb9d5","abstract_canon_sha256":"4d65f8e5212a3ba0d342770a60bc034b45db0291fbb3c9e0bfb3935d0b960593"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-17T01:21:56.840154Z","signature_b64":"PBWQHymwsbsIgVbs+dtizKFT96MKbylEF/DMSvbOEeJSJDSdK/e/f1DjzOGO9r8thw/pTWMjkvUbX6iIZ0bSCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a02537d1b8fade07af37a2f95f8d4199faa649a095775b52889fd77a8ec8be0","last_reissued_at":"2026-07-17T01:21:56.839468Z","signature_status":"signed_v1","first_computed_at":"2026-07-17T01:21:56.839468Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Hamilton covers and linear arboricity of random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael Krivelevich, Nemanja Dragani\\'c","submitted_at":"2026-07-16T11:55:55Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.14881","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.14881/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2607.14881","created_at":"2026-07-17T01:21:56.839842+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.14881v1","created_at":"2026-07-17T01:21:56.839842+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.14881","created_at":"2026-07-17T01:21:56.839842+00:00"},{"alias_kind":"pith_short_12","alias_value":"NIBFG7I3R6W6","created_at":"2026-07-17T01:21:56.839842+00:00"},{"alias_kind":"pith_short_16","alias_value":"NIBFG7I3R6W6A6XT","created_at":"2026-07-17T01:21:56.839842+00:00"},{"alias_kind":"pith_short_8","alias_value":"NIBFG7I3","created_at":"2026-07-17T01:21:56.839842+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/NIBFG7I3R6W6A6XTPIXZL6GUDG","json":"https://pith.science/pith/NIBFG7I3R6W6A6XTPIXZL6GUDG.json","graph_json":"https://pith.science/api/pith-number/NIBFG7I3R6W6A6XTPIXZL6GUDG/graph.json","events_json":"https://pith.science/api/pith-number/NIBFG7I3R6W6A6XTPIXZL6GUDG/events.json","paper":"https://pith.science/paper/NIBFG7I3"},"agent_actions":{"view_html":"https://pith.science/pith/NIBFG7I3R6W6A6XTPIXZL6GUDG","download_json":"https://pith.science/pith/NIBFG7I3R6W6A6XTPIXZL6GUDG.json","view_paper":"https://pith.science/paper/NIBFG7I3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.14881&json=true","fetch_graph":"https://pith.science/api/pith-number/NIBFG7I3R6W6A6XTPIXZL6GUDG/graph.json","fetch_events":"https://pith.science/api/pith-number/NIBFG7I3R6W6A6XTPIXZL6GUDG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NIBFG7I3R6W6A6XTPIXZL6GUDG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NIBFG7I3R6W6A6XTPIXZL6GUDG/action/storage_attestation","attest_author":"https://pith.science/pith/NIBFG7I3R6W6A6XTPIXZL6GUDG/action/author_attestation","sign_citation":"https://pith.science/pith/NIBFG7I3R6W6A6XTPIXZL6GUDG/action/citation_signature","submit_replication":"https://pith.science/pith/NIBFG7I3R6W6A6XTPIXZL6GUDG/action/replication_record"}},"created_at":"2026-07-17T01:21:56.839842+00:00","updated_at":"2026-07-17T01:21:56.839842+00:00"}