{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:UCOCY6XWTELHOB6MGF72NDSLVD","short_pith_number":"pith:UCOCY6XW","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"},"canonical_sha256":"a09c2c7af699167707cc317fa68e4ba8f6beea4f3e57210b9018ca1f66445617","source":{"kind":"arxiv","id":"1404.3306","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:UCOCY6XWTELHOB6MGF72NDSLVD","target":"record","payload":{"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"},"canonical_sha256":"a09c2c7af699167707cc317fa68e4ba8f6beea4f3e57210b9018ca1f66445617","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"},"source_kind":"arxiv","source_id":"1404.3306","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:53:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pTOB+Jw2fjtG+Fds2KDwu4E1m1XZIuoyU+vnkyCv6XE2biEiId5uKwCXxeq0syENyHdz+of2a/7Xmay584x3AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:08:35.476140Z"},"content_sha256":"287c200a9b483a258a90669494cc8a3320e12f089777429d4719e9726b82a798","schema_version":"1.0","event_id":"sha256:287c200a9b483a258a90669494cc8a3320e12f089777429d4719e9726b82a798"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:UCOCY6XWTELHOB6MGF72NDSLVD","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:53:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QTab1BotDYa3UaUyRawhP9ayGO730TZoPnaWJwzF3sW9cssvquHqvnX85wVV0B5KRjMUUzQ391OVC6ZFXpCRBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:08:35.476522Z"},"content_sha256":"78f9c1a57dc0bc2707c65ed18723ba1e77721f9cdb129d03787caab71998fdbf","schema_version":"1.0","event_id":"sha256:78f9c1a57dc0bc2707c65ed18723ba1e77721f9cdb129d03787caab71998fdbf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UCOCY6XWTELHOB6MGF72NDSLVD/bundle.json","state_url":"https://pith.science/pith/UCOCY6XWTELHOB6MGF72NDSLVD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UCOCY6XWTELHOB6MGF72NDSLVD/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T12:08:35Z","links":{"resolver":"https://pith.science/pith/UCOCY6XWTELHOB6MGF72NDSLVD","bundle":"https://pith.science/pith/UCOCY6XWTELHOB6MGF72NDSLVD/bundle.json","state":"https://pith.science/pith/UCOCY6XWTELHOB6MGF72NDSLVD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UCOCY6XWTELHOB6MGF72NDSLVD/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/QWvybLDU+mGko4ktrBYJBJKLSyvtaoqwRThedRPHMX5TFZ5Ox37Mq6ADxhVtfmqO6McbewgvtkiDV17RAhvBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T12:08:35.479085Z","bundle_sha256":"2d44eb1dcf4ddcc89bbdb6cdb57afffdb3dae588c0f39b09b952366c0bfaa02d"}}