{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:KKVU5DVQ4BWHEHQBSEEWQACW4T","short_pith_number":"pith:KKVU5DVQ","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"},"canonical_sha256":"52ab4e8eb0e06c721e019109680056e4e08ba390d832ea92aca10a486fe92cf7","source":{"kind":"arxiv","id":"1805.12051","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.12051","created_at":"2026-05-18T00:14:35Z"},{"alias_kind":"arxiv_version","alias_value":"1805.12051v1","created_at":"2026-05-18T00:14:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.12051","created_at":"2026-05-18T00:14:35Z"},{"alias_kind":"pith_short_12","alias_value":"KKVU5DVQ4BWH","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KKVU5DVQ4BWHEHQB","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KKVU5DVQ","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:KKVU5DVQ4BWHEHQBSEEWQACW4T","target":"record","payload":{"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"},"canonical_sha256":"52ab4e8eb0e06c721e019109680056e4e08ba390d832ea92aca10a486fe92cf7","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"},"source_kind":"arxiv","source_id":"1805.12051","source_version":1,"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-18T00:14:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mguvp53c+AUpFHQrXts6WLreUXMQISYo3b/709Mn7tg0PhGva54BtOV1mc+a+4F2CSC/eV9fYw7inBrBqtg7Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:15:03.508481Z"},"content_sha256":"748101c7f27ff9f7d8dde7d1af44d61b47c2110a1cda5911b99448f3213a2b8a","schema_version":"1.0","event_id":"sha256:748101c7f27ff9f7d8dde7d1af44d61b47c2110a1cda5911b99448f3213a2b8a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:KKVU5DVQ4BWHEHQBSEEWQACW4T","target":"graph","payload":{"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"},"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-18T00:14:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dzeGD9QO1cCrfw32QEa0IcZoToWcQJFq1XfHjPbbjP5rioEiFw6NXYfPxooRMhv0O8G4FUKDTo7ISRp/cA4xAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:15:03.508886Z"},"content_sha256":"2329674c6dd1b2d136f21764e13d984894c0d82b3668c750dbe7d13e01cfc93d","schema_version":"1.0","event_id":"sha256:2329674c6dd1b2d136f21764e13d984894c0d82b3668c750dbe7d13e01cfc93d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KKVU5DVQ4BWHEHQBSEEWQACW4T/bundle.json","state_url":"https://pith.science/pith/KKVU5DVQ4BWHEHQBSEEWQACW4T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KKVU5DVQ4BWHEHQBSEEWQACW4T/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-27T18:15:03Z","links":{"resolver":"https://pith.science/pith/KKVU5DVQ4BWHEHQBSEEWQACW4T","bundle":"https://pith.science/pith/KKVU5DVQ4BWHEHQBSEEWQACW4T/bundle.json","state":"https://pith.science/pith/KKVU5DVQ4BWHEHQBSEEWQACW4T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KKVU5DVQ4BWHEHQBSEEWQACW4T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KKVU5DVQ4BWHEHQBSEEWQACW4T","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":"6131f1f9454af880198b93237a2f09fbd3189317bc99d802d67475d1db56d1f2","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-30T16:14:18Z","title_canon_sha256":"8dcf6e85b16c4f5fe5702cf35ab513b943777fdec4bd3668ee0a3b401829362d"},"schema_version":"1.0","source":{"id":"1805.12051","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.12051","created_at":"2026-05-18T00:14:35Z"},{"alias_kind":"arxiv_version","alias_value":"1805.12051v1","created_at":"2026-05-18T00:14:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.12051","created_at":"2026-05-18T00:14:35Z"},{"alias_kind":"pith_short_12","alias_value":"KKVU5DVQ4BWH","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KKVU5DVQ4BWHEHQB","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KKVU5DVQ","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:2329674c6dd1b2d136f21764e13d984894c0d82b3668c750dbe7d13e01cfc93d","target":"graph","created_at":"2026-05-18T00:14:35Z","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 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","authors_text":"Junxing Wang, Richard Peng, Saurabh Sawlani, Sushant Sachdeva, Timothy Chu, Yu Gao","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-30T16:14:18Z","title":"Graph Sparsification, Spectral Sketches, and Faster Resistance Computation, via Short Cycle Decompositions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.12051","kind":"arxiv","version":1},"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:748101c7f27ff9f7d8dde7d1af44d61b47c2110a1cda5911b99448f3213a2b8a","target":"record","created_at":"2026-05-18T00:14:35Z","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":"6131f1f9454af880198b93237a2f09fbd3189317bc99d802d67475d1db56d1f2","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-30T16:14:18Z","title_canon_sha256":"8dcf6e85b16c4f5fe5702cf35ab513b943777fdec4bd3668ee0a3b401829362d"},"schema_version":"1.0","source":{"id":"1805.12051","kind":"arxiv","version":1}},"canonical_sha256":"52ab4e8eb0e06c721e019109680056e4e08ba390d832ea92aca10a486fe92cf7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52ab4e8eb0e06c721e019109680056e4e08ba390d832ea92aca10a486fe92cf7","first_computed_at":"2026-05-18T00:14:35.374729Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:35.374729Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QzM7hL1h8nVxu9rSUgMX82h9ciIEpjK/QAYChFaQwNUwy+OKiHUEKO8a7Eq5POiu8F1rJUN+EOmFhbrcSoheAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:35.375640Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.12051","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:748101c7f27ff9f7d8dde7d1af44d61b47c2110a1cda5911b99448f3213a2b8a","sha256:2329674c6dd1b2d136f21764e13d984894c0d82b3668c750dbe7d13e01cfc93d"],"state_sha256":"0c42b40689ee8db8a5d26d718f072f65703f2d5fceb84297c31d3e630cac85c0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mwtxh3474va7XVD36Ocj65No7ft/2L14TUTtItli9W/cIPc0kkNxdkxqOh/xfoEEnHYRShH1zJuP4Jx93SVdCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T18:15:03.511394Z","bundle_sha256":"56d6a130812ee90cd8bffd56b8d5038edea6c4f0900da4c511860ccc9ac9c992"}}