{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:XBRE3HP2NLHIVDF7FSELQ666HI","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":"1d1baabfb62de3fc7fe6e31b100736b402d4b33a0b6799e24e314a8821e4a3e3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-02T09:39:22Z","title_canon_sha256":"e7e4fd1c8848c906a05d98b4048e144b89c04cf7bf45b28c2d01aa1173140c7d"},"schema_version":"1.0","source":{"id":"1310.0632","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.0632","created_at":"2026-05-18T02:51:23Z"},{"alias_kind":"arxiv_version","alias_value":"1310.0632v2","created_at":"2026-05-18T02:51:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.0632","created_at":"2026-05-18T02:51:23Z"},{"alias_kind":"pith_short_12","alias_value":"XBRE3HP2NLHI","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XBRE3HP2NLHIVDF7","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XBRE3HP2","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:b45121c366b8b0dad0a6a24067f457a4c7ca992d2c12dd0f6cdc23a2b5428cee","target":"graph","created_at":"2026-05-18T02:51:23Z","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":"In the 1960s, Erd\\H{o}s and Gallai conjectured that the edge set of every graph on n vertices can be partitioned into O(n) cycles and edges. They observed that one can easily get an O(n log n) upper bound by repeatedly removing the edges of the longest cycle. We make the first progress on this problem, showing that O(n log log n) cycles and edges suffice. We also prove the Erd\\H{o}s-Gallai conjecture for random graphs and for graphs with linear minimum degree.","authors_text":"Benny Sudakov, David Conlon, Jacob Fox","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-02T09:39:22Z","title":"Cycle packing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.0632","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:805838e9803d2665ef04a5335725025953621cba45311d1cbb7a0c2e8c778600","target":"record","created_at":"2026-05-18T02:51:23Z","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":"1d1baabfb62de3fc7fe6e31b100736b402d4b33a0b6799e24e314a8821e4a3e3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-02T09:39:22Z","title_canon_sha256":"e7e4fd1c8848c906a05d98b4048e144b89c04cf7bf45b28c2d01aa1173140c7d"},"schema_version":"1.0","source":{"id":"1310.0632","kind":"arxiv","version":2}},"canonical_sha256":"b8624d9dfa6ace8a8cbf2c88b87bde3a0a8bc3d897b282a84455ccfb23ec62aa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b8624d9dfa6ace8a8cbf2c88b87bde3a0a8bc3d897b282a84455ccfb23ec62aa","first_computed_at":"2026-05-18T02:51:23.197691Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:23.197691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UM2Gz7+xWIE/Lp/CxpPPsh5gelzTtEyhiEofwlhNPlD24q5WhC3YAe//8UERXkKwDp1meKTgdJOOvGzoA6c6CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:23.198331Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.0632","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:805838e9803d2665ef04a5335725025953621cba45311d1cbb7a0c2e8c778600","sha256:b45121c366b8b0dad0a6a24067f457a4c7ca992d2c12dd0f6cdc23a2b5428cee"],"state_sha256":"869e0dd6f6eaf454c31e9242e1697df2bacedf4b8c78c76944cb10dc4b4f01ab"}