{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:ONSOSCCBFLR7PZGASIJDYGTA7D","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":"325158e268a11f6f5e96156a5103fabc6ac19675b72eb8c5a0a44df3dab78910","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-26T03:15:16Z","title_canon_sha256":"52ad41329551eaa9159c27beb7513510b70d5d3edc3fe88d522423cd12f652e2"},"schema_version":"1.0","source":{"id":"1209.5821","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.5821","created_at":"2026-05-18T03:07:02Z"},{"alias_kind":"arxiv_version","alias_value":"1209.5821v3","created_at":"2026-05-18T03:07:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.5821","created_at":"2026-05-18T03:07:02Z"},{"alias_kind":"pith_short_12","alias_value":"ONSOSCCBFLR7","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"ONSOSCCBFLR7PZGA","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"ONSOSCCB","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:4161a3ea09db1c735ef550a54794dbb9cd769b83673970374536fd535e13992c","target":"graph","created_at":"2026-05-18T03:07:02Z","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 study algorithms for spectral graph sparsification. The input is a graph $G$ with $n$ vertices and $m$ edges, and the output is a sparse graph $\\tilde{G}$ that approximates $G$ in an algebraic sense. Concretely, for all vectors $x$ and any $\\epsilon>0$, $\\tilde{G}$ satisfies $$ (1-\\epsilon) x^T L_G x \\leq x^T L_{\\tilde{G}} x \\leq (1+\\epsilon) x^T L_G x, $$ where $L_G$ and $L_{\\tilde{G}}$ are the Laplacians of $G$ and $\\tilde{G}$ respectively. We show that the fastest known algorithm for computing a sparsifier with $O(n\\log n/\\epsilon^2)$ edges can actually run in $\\tilde{O}(m\\log^2 n)$ time","authors_text":"Alex Levin, Ioannis Koutis, Richard Peng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-26T03:15:16Z","title":"Faster spectral sparsification and numerical algorithms for SDD matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.5821","kind":"arxiv","version":3},"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:48ddd32dc59ce98a57c32799268f3f6f44fec7a1c8a0975971a0a615dd5d6d8f","target":"record","created_at":"2026-05-18T03:07:02Z","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":"325158e268a11f6f5e96156a5103fabc6ac19675b72eb8c5a0a44df3dab78910","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-26T03:15:16Z","title_canon_sha256":"52ad41329551eaa9159c27beb7513510b70d5d3edc3fe88d522423cd12f652e2"},"schema_version":"1.0","source":{"id":"1209.5821","kind":"arxiv","version":3}},"canonical_sha256":"7364e908412ae3f7e4c092123c1a60f8e1b1af5ebc9e811d0a477971cd0265b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7364e908412ae3f7e4c092123c1a60f8e1b1af5ebc9e811d0a477971cd0265b1","first_computed_at":"2026-05-18T03:07:02.133929Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:07:02.133929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7QEWhHZ2EVtN0I0iT/kHmgC2AUDOHw3oJGvkyV1mp2A9968CYA/BJiVLithql5YPenM46dHVffqEY5RwIJU6Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:07:02.134706Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.5821","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:48ddd32dc59ce98a57c32799268f3f6f44fec7a1c8a0975971a0a615dd5d6d8f","sha256:4161a3ea09db1c735ef550a54794dbb9cd769b83673970374536fd535e13992c"],"state_sha256":"543d804a65f06051b0246ba7537b2432188d5479030c93c31128a58773739ca8"}