{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:UCOCY6XWTELHOB6MGF72NDSLVD","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":"26e0dfdf976a5f454c5f56c16bae3f3f8fbad06c4286fad162f1eb459f81841b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-12T17:27:11Z","title_canon_sha256":"232c6ec677403032b5c2cf7bb994d8b3ae03bfaf8f9f528cf2a621f1ef7f1561"},"schema_version":"1.0","source":{"id":"1404.3306","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.3306","created_at":"2026-05-17T23:53:34Z"},{"alias_kind":"arxiv_version","alias_value":"1404.3306v2","created_at":"2026-05-17T23:53:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3306","created_at":"2026-05-17T23:53:34Z"},{"alias_kind":"pith_short_12","alias_value":"UCOCY6XWTELH","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UCOCY6XWTELHOB6M","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UCOCY6XW","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:78f9c1a57dc0bc2707c65ed18723ba1e77721f9cdb129d03787caab71998fdbf","target":"graph","created_at":"2026-05-17T23:53:34Z","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":"Over 50 years ago, Erd\\H{o}s and Gallai conjectured that the edges of every graph on $n$ vertices can be decomposed into $O(n)$ cycles and edges. Among other results, Conlon, Fox and Sudakov recently proved that this holds for the random graph $G(n,p)$ with probability approaching 1 as $n\\rightarrow\\infty$. In this paper we show that for most edge probabilities $G(n,p)$ can be decomposed into a union of $\\frac{n}{4}+\\frac{np}{2}+o(n)$ cycles and edges whp. This result is asymptotically tight.","authors_text":"Benny Sudakov, D\\'aniel Kor\\'andi, Michael Krivelevich","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-12T17:27:11Z","title":"Decomposing random graphs into few cycles and edges"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3306","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:287c200a9b483a258a90669494cc8a3320e12f089777429d4719e9726b82a798","target":"record","created_at":"2026-05-17T23:53:34Z","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":"26e0dfdf976a5f454c5f56c16bae3f3f8fbad06c4286fad162f1eb459f81841b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-12T17:27:11Z","title_canon_sha256":"232c6ec677403032b5c2cf7bb994d8b3ae03bfaf8f9f528cf2a621f1ef7f1561"},"schema_version":"1.0","source":{"id":"1404.3306","kind":"arxiv","version":2}},"canonical_sha256":"a09c2c7af699167707cc317fa68e4ba8f6beea4f3e57210b9018ca1f66445617","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a09c2c7af699167707cc317fa68e4ba8f6beea4f3e57210b9018ca1f66445617","first_computed_at":"2026-05-17T23:53:34.951366Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:34.951366Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1alAa7swRCw6tLzpztUroQejDEiqgVkxgCTKl8Xb00shBn5ecXGLF77xnqWgWoOhjOwKHvpq6a19eJP5l//mCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:34.952116Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.3306","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:287c200a9b483a258a90669494cc8a3320e12f089777429d4719e9726b82a798","sha256:78f9c1a57dc0bc2707c65ed18723ba1e77721f9cdb129d03787caab71998fdbf"],"state_sha256":"c4e1dc473991862e129d04978e2d91baef014e2ec613a35e0fe525120fc19f65"}