{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:UCOCY6XWTELHOB6MGF72NDSLVD","short_pith_number":"pith:UCOCY6XW","schema_version":"1.0","canonical_sha256":"a09c2c7af699167707cc317fa68e4ba8f6beea4f3e57210b9018ca1f66445617","source":{"kind":"arxiv","id":"1404.3306","version":2},"attestation_state":"computed","paper":{"title":"Decomposing random graphs into few cycles and edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, D\\'aniel Kor\\'andi, Michael Krivelevich","submitted_at":"2014-04-12T17:27:11Z","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."},"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":"1404.3306","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-12T17:27:11Z","cross_cats_sorted":[],"title_canon_sha256":"232c6ec677403032b5c2cf7bb994d8b3ae03bfaf8f9f528cf2a621f1ef7f1561","abstract_canon_sha256":"26e0dfdf976a5f454c5f56c16bae3f3f8fbad06c4286fad162f1eb459f81841b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:34.952116Z","signature_b64":"1alAa7swRCw6tLzpztUroQejDEiqgVkxgCTKl8Xb00shBn5ecXGLF77xnqWgWoOhjOwKHvpq6a19eJP5l//mCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a09c2c7af699167707cc317fa68e4ba8f6beea4f3e57210b9018ca1f66445617","last_reissued_at":"2026-05-17T23:53:34.951366Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:34.951366Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decomposing random graphs into few cycles and edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, D\\'aniel Kor\\'andi, Michael Krivelevich","submitted_at":"2014-04-12T17:27:11Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3306","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1404.3306","created_at":"2026-05-17T23:53:34.951486+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.3306v2","created_at":"2026-05-17T23:53:34.951486+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3306","created_at":"2026-05-17T23:53:34.951486+00:00"},{"alias_kind":"pith_short_12","alias_value":"UCOCY6XWTELH","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"UCOCY6XWTELHOB6M","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"UCOCY6XW","created_at":"2026-05-18T12:28:52.271510+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/UCOCY6XWTELHOB6MGF72NDSLVD","json":"https://pith.science/pith/UCOCY6XWTELHOB6MGF72NDSLVD.json","graph_json":"https://pith.science/api/pith-number/UCOCY6XWTELHOB6MGF72NDSLVD/graph.json","events_json":"https://pith.science/api/pith-number/UCOCY6XWTELHOB6MGF72NDSLVD/events.json","paper":"https://pith.science/paper/UCOCY6XW"},"agent_actions":{"view_html":"https://pith.science/pith/UCOCY6XWTELHOB6MGF72NDSLVD","download_json":"https://pith.science/pith/UCOCY6XWTELHOB6MGF72NDSLVD.json","view_paper":"https://pith.science/paper/UCOCY6XW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.3306&json=true","fetch_graph":"https://pith.science/api/pith-number/UCOCY6XWTELHOB6MGF72NDSLVD/graph.json","fetch_events":"https://pith.science/api/pith-number/UCOCY6XWTELHOB6MGF72NDSLVD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UCOCY6XWTELHOB6MGF72NDSLVD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UCOCY6XWTELHOB6MGF72NDSLVD/action/storage_attestation","attest_author":"https://pith.science/pith/UCOCY6XWTELHOB6MGF72NDSLVD/action/author_attestation","sign_citation":"https://pith.science/pith/UCOCY6XWTELHOB6MGF72NDSLVD/action/citation_signature","submit_replication":"https://pith.science/pith/UCOCY6XWTELHOB6MGF72NDSLVD/action/replication_record"}},"created_at":"2026-05-17T23:53:34.951486+00:00","updated_at":"2026-05-17T23:53:34.951486+00:00"}