{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WBV3PWG7E6FZCRDZHJVEJHIYHB","short_pith_number":"pith:WBV3PWG7","schema_version":"1.0","canonical_sha256":"b06bb7d8df278b9144793a6a449d183855861253fcac276825611a28a3c22b34","source":{"kind":"arxiv","id":"1810.05143","version":2},"attestation_state":"computed","paper":{"title":"Short Cycles via Low-Diameter Decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sushant Sachdeva, Yang P. Liu, Zejun Yu","submitted_at":"2018-10-11T17:46:48Z","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{\\"},"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":"1810.05143","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-11T17:46:48Z","cross_cats_sorted":[],"title_canon_sha256":"6797a54182878f1332ebcc1dc677b50e9abe0d83d1d43031470604d7f6d20ea2","abstract_canon_sha256":"b6dbdadedaa1434f21685a45e1b5876f1703bbd8b8b6b5c0bb560d611709f041"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:29.337307Z","signature_b64":"nNnC+U+kVR4Ps1Gu2Dya8sZYREkMbrTm7FDrZ/Xvs9RvgfeRO2Q7ECMZ5OVSy9pp1tbbKRLkPksVWOHsvI13AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b06bb7d8df278b9144793a6a449d183855861253fcac276825611a28a3c22b34","last_reissued_at":"2026-05-17T23:56:29.336924Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:29.336924Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Short Cycles via Low-Diameter Decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sushant Sachdeva, Yang P. Liu, Zejun Yu","submitted_at":"2018-10-11T17:46:48Z","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{\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.05143","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":"1810.05143","created_at":"2026-05-17T23:56:29.336986+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.05143v2","created_at":"2026-05-17T23:56:29.336986+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05143","created_at":"2026-05-17T23:56:29.336986+00:00"},{"alias_kind":"pith_short_12","alias_value":"WBV3PWG7E6FZ","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"WBV3PWG7E6FZCRDZ","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"WBV3PWG7","created_at":"2026-05-18T12:32:59.047623+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/WBV3PWG7E6FZCRDZHJVEJHIYHB","json":"https://pith.science/pith/WBV3PWG7E6FZCRDZHJVEJHIYHB.json","graph_json":"https://pith.science/api/pith-number/WBV3PWG7E6FZCRDZHJVEJHIYHB/graph.json","events_json":"https://pith.science/api/pith-number/WBV3PWG7E6FZCRDZHJVEJHIYHB/events.json","paper":"https://pith.science/paper/WBV3PWG7"},"agent_actions":{"view_html":"https://pith.science/pith/WBV3PWG7E6FZCRDZHJVEJHIYHB","download_json":"https://pith.science/pith/WBV3PWG7E6FZCRDZHJVEJHIYHB.json","view_paper":"https://pith.science/paper/WBV3PWG7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.05143&json=true","fetch_graph":"https://pith.science/api/pith-number/WBV3PWG7E6FZCRDZHJVEJHIYHB/graph.json","fetch_events":"https://pith.science/api/pith-number/WBV3PWG7E6FZCRDZHJVEJHIYHB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WBV3PWG7E6FZCRDZHJVEJHIYHB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WBV3PWG7E6FZCRDZHJVEJHIYHB/action/storage_attestation","attest_author":"https://pith.science/pith/WBV3PWG7E6FZCRDZHJVEJHIYHB/action/author_attestation","sign_citation":"https://pith.science/pith/WBV3PWG7E6FZCRDZHJVEJHIYHB/action/citation_signature","submit_replication":"https://pith.science/pith/WBV3PWG7E6FZCRDZHJVEJHIYHB/action/replication_record"}},"created_at":"2026-05-17T23:56:29.336986+00:00","updated_at":"2026-05-17T23:56:29.336986+00:00"}