{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KKVU5DVQ4BWHEHQBSEEWQACW4T","short_pith_number":"pith:KKVU5DVQ","schema_version":"1.0","canonical_sha256":"52ab4e8eb0e06c721e019109680056e4e08ba390d832ea92aca10a486fe92cf7","source":{"kind":"arxiv","id":"1805.12051","version":1},"attestation_state":"computed","paper":{"title":"Graph Sparsification, Spectral Sketches, and Faster Resistance Computation, via Short Cycle Decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Junxing Wang, Richard Peng, Saurabh Sawlani, Sushant Sachdeva, Timothy Chu, Yu Gao","submitted_at":"2018-05-30T16:14:18Z","abstract_excerpt":"We develop a framework for graph sparsification and sketching, based on a new tool, short cycle decomposition -- a decomposition of an unweighted graph into an edge-disjoint collection of short cycles, plus few extra edges. A simple observation gives that every graph G on n vertices with m edges can be decomposed in $O(mn)$ time into cycles of length at most $2\\log n$, and at most $2n$ extra edges. We give an $m^{1+o(1)}$ time algorithm for constructing a short cycle decomposition, with cycles of length $n^{o(1)}$, and $n^{1+o(1)}$ extra edges. These decompositions enable us to make progress o"},"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":"1805.12051","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-30T16:14:18Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"8dcf6e85b16c4f5fe5702cf35ab513b943777fdec4bd3668ee0a3b401829362d","abstract_canon_sha256":"6131f1f9454af880198b93237a2f09fbd3189317bc99d802d67475d1db56d1f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:35.375640Z","signature_b64":"QzM7hL1h8nVxu9rSUgMX82h9ciIEpjK/QAYChFaQwNUwy+OKiHUEKO8a7Eq5POiu8F1rJUN+EOmFhbrcSoheAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52ab4e8eb0e06c721e019109680056e4e08ba390d832ea92aca10a486fe92cf7","last_reissued_at":"2026-05-18T00:14:35.374729Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:35.374729Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Sparsification, Spectral Sketches, and Faster Resistance Computation, via Short Cycle Decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Junxing Wang, Richard Peng, Saurabh Sawlani, Sushant Sachdeva, Timothy Chu, Yu Gao","submitted_at":"2018-05-30T16:14:18Z","abstract_excerpt":"We develop a framework for graph sparsification and sketching, based on a new tool, short cycle decomposition -- a decomposition of an unweighted graph into an edge-disjoint collection of short cycles, plus few extra edges. A simple observation gives that every graph G on n vertices with m edges can be decomposed in $O(mn)$ time into cycles of length at most $2\\log n$, and at most $2n$ extra edges. We give an $m^{1+o(1)}$ time algorithm for constructing a short cycle decomposition, with cycles of length $n^{o(1)}$, and $n^{1+o(1)}$ extra edges. These decompositions enable us to make progress o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.12051","kind":"arxiv","version":1},"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":"1805.12051","created_at":"2026-05-18T00:14:35.374889+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.12051v1","created_at":"2026-05-18T00:14:35.374889+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.12051","created_at":"2026-05-18T00:14:35.374889+00:00"},{"alias_kind":"pith_short_12","alias_value":"KKVU5DVQ4BWH","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"KKVU5DVQ4BWHEHQB","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"KKVU5DVQ","created_at":"2026-05-18T12:32:33.847187+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/KKVU5DVQ4BWHEHQBSEEWQACW4T","json":"https://pith.science/pith/KKVU5DVQ4BWHEHQBSEEWQACW4T.json","graph_json":"https://pith.science/api/pith-number/KKVU5DVQ4BWHEHQBSEEWQACW4T/graph.json","events_json":"https://pith.science/api/pith-number/KKVU5DVQ4BWHEHQBSEEWQACW4T/events.json","paper":"https://pith.science/paper/KKVU5DVQ"},"agent_actions":{"view_html":"https://pith.science/pith/KKVU5DVQ4BWHEHQBSEEWQACW4T","download_json":"https://pith.science/pith/KKVU5DVQ4BWHEHQBSEEWQACW4T.json","view_paper":"https://pith.science/paper/KKVU5DVQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.12051&json=true","fetch_graph":"https://pith.science/api/pith-number/KKVU5DVQ4BWHEHQBSEEWQACW4T/graph.json","fetch_events":"https://pith.science/api/pith-number/KKVU5DVQ4BWHEHQBSEEWQACW4T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KKVU5DVQ4BWHEHQBSEEWQACW4T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KKVU5DVQ4BWHEHQBSEEWQACW4T/action/storage_attestation","attest_author":"https://pith.science/pith/KKVU5DVQ4BWHEHQBSEEWQACW4T/action/author_attestation","sign_citation":"https://pith.science/pith/KKVU5DVQ4BWHEHQBSEEWQACW4T/action/citation_signature","submit_replication":"https://pith.science/pith/KKVU5DVQ4BWHEHQBSEEWQACW4T/action/replication_record"}},"created_at":"2026-05-18T00:14:35.374889+00:00","updated_at":"2026-05-18T00:14:35.374889+00:00"}