{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WBV3PWG7E6FZCRDZHJVEJHIYHB","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":"b6dbdadedaa1434f21685a45e1b5876f1703bbd8b8b6b5c0bb560d611709f041","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-11T17:46:48Z","title_canon_sha256":"6797a54182878f1332ebcc1dc677b50e9abe0d83d1d43031470604d7f6d20ea2"},"schema_version":"1.0","source":{"id":"1810.05143","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.05143","created_at":"2026-05-17T23:56:29Z"},{"alias_kind":"arxiv_version","alias_value":"1810.05143v2","created_at":"2026-05-17T23:56:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05143","created_at":"2026-05-17T23:56:29Z"},{"alias_kind":"pith_short_12","alias_value":"WBV3PWG7E6FZ","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"WBV3PWG7E6FZCRDZ","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"WBV3PWG7","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:b16858ea127cf855460e3165b18cd3cf57a940ebc9b3db81f94bc0baf59ea9fa","target":"graph","created_at":"2026-05-17T23:56:29Z","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":"We present improved algorithms for short cycle decomposition of a graph. Short cycle decompositions were introduced in the recent work of Chu et al, and were used to make progress on several questions in graph sparsification.\n  For all constants $\\delta \\in (0,1]$, we give an $O(mn^\\delta)$ time algorithm that, given a graph $G,$ partitions its edges into cycles of length $O(\\log n)^\\frac{1}{\\delta}$, with $O(n)$ extra edges not in any cycle. This gives the first subquadratic, in fact almost linear time, algorithm achieving polylogarithmic cycle lengths. We also give an $m \\cdot \\exp(O(\\sqrt{\\","authors_text":"Sushant Sachdeva, Yang P. Liu, Zejun Yu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-11T17:46:48Z","title":"Short Cycles via Low-Diameter Decompositions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.05143","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:878e20f15144c3a95ba9106ebd3239b2cd64e41ea323b35b866102773e15d95b","target":"record","created_at":"2026-05-17T23:56:29Z","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":"b6dbdadedaa1434f21685a45e1b5876f1703bbd8b8b6b5c0bb560d611709f041","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-11T17:46:48Z","title_canon_sha256":"6797a54182878f1332ebcc1dc677b50e9abe0d83d1d43031470604d7f6d20ea2"},"schema_version":"1.0","source":{"id":"1810.05143","kind":"arxiv","version":2}},"canonical_sha256":"b06bb7d8df278b9144793a6a449d183855861253fcac276825611a28a3c22b34","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b06bb7d8df278b9144793a6a449d183855861253fcac276825611a28a3c22b34","first_computed_at":"2026-05-17T23:56:29.336924Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:29.336924Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nNnC+U+kVR4Ps1Gu2Dya8sZYREkMbrTm7FDrZ/Xvs9RvgfeRO2Q7ECMZ5OVSy9pp1tbbKRLkPksVWOHsvI13AA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:29.337307Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.05143","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:878e20f15144c3a95ba9106ebd3239b2cd64e41ea323b35b866102773e15d95b","sha256:b16858ea127cf855460e3165b18cd3cf57a940ebc9b3db81f94bc0baf59ea9fa"],"state_sha256":"8bae79513efee0930597306bdc9d295a56198a76b1544edc80e73ab1a15aa58e"}