{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:WRZREAGOEMIYXCSEDNBEZMJGX6","short_pith_number":"pith:WRZREAGO","schema_version":"1.0","canonical_sha256":"b4731200ce23118b8a441b424cb126bfa51c4e46fb392d8a1fdfae04e460422f","source":{"kind":"arxiv","id":"1412.8225","version":1},"attestation_state":"computed","paper":{"title":"A Sketching Algorithm for Spectral Graph Sparsification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bo Qin, David P. Woodruff, Jiecao Chen, Qin Zhang","submitted_at":"2014-12-28T23:22:42Z","abstract_excerpt":"We study the problem of compressing a weighted graph $G$ on $n$ vertices, building a \"sketch\" $H$ of $G$, so that given any vector $x \\in \\mathbb{R}^n$, the value $x^T L_G x$ can be approximated up to a multiplicative $1+\\epsilon$ factor from only $H$ and $x$, where $L_G$ denotes the Laplacian of $G$. One solution to this problem is to build a spectral sparsifier $H$ of $G$, which, using the result of Batson, Spielman, and Srivastava, consists of $O(n \\epsilon^{-2})$ reweighted edges of $G$ and has the property that simultaneously for all $x \\in \\mathbb{R}^n$, $x^T L_H x = (1 \\pm \\epsilon) x^T"},"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":"1412.8225","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-28T23:22:42Z","cross_cats_sorted":[],"title_canon_sha256":"ff306a72bb0b8d198ff210819659ca71224032c7e29188e8e5e43935f2bd0b7d","abstract_canon_sha256":"dbd5e42b084f7dc6ba2cd04eebfb7821d45057ecdf2ebf3ce3874231951df5a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:23.744020Z","signature_b64":"3K1kvXV01XwxIpFni4F6dYIVy4UdoWG2cEDmVopSXsrXeKmJp17+qOPM1M3faaaENLGCrIK0wz6Zqx1q78IWCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4731200ce23118b8a441b424cb126bfa51c4e46fb392d8a1fdfae04e460422f","last_reissued_at":"2026-05-18T02:30:23.743336Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:23.743336Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Sketching Algorithm for Spectral Graph Sparsification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bo Qin, David P. Woodruff, Jiecao Chen, Qin Zhang","submitted_at":"2014-12-28T23:22:42Z","abstract_excerpt":"We study the problem of compressing a weighted graph $G$ on $n$ vertices, building a \"sketch\" $H$ of $G$, so that given any vector $x \\in \\mathbb{R}^n$, the value $x^T L_G x$ can be approximated up to a multiplicative $1+\\epsilon$ factor from only $H$ and $x$, where $L_G$ denotes the Laplacian of $G$. One solution to this problem is to build a spectral sparsifier $H$ of $G$, which, using the result of Batson, Spielman, and Srivastava, consists of $O(n \\epsilon^{-2})$ reweighted edges of $G$ and has the property that simultaneously for all $x \\in \\mathbb{R}^n$, $x^T L_H x = (1 \\pm \\epsilon) x^T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.8225","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":"1412.8225","created_at":"2026-05-18T02:30:23.743449+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.8225v1","created_at":"2026-05-18T02:30:23.743449+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.8225","created_at":"2026-05-18T02:30:23.743449+00:00"},{"alias_kind":"pith_short_12","alias_value":"WRZREAGOEMIY","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"WRZREAGOEMIYXCSE","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"WRZREAGO","created_at":"2026-05-18T12:28:54.890064+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/WRZREAGOEMIYXCSEDNBEZMJGX6","json":"https://pith.science/pith/WRZREAGOEMIYXCSEDNBEZMJGX6.json","graph_json":"https://pith.science/api/pith-number/WRZREAGOEMIYXCSEDNBEZMJGX6/graph.json","events_json":"https://pith.science/api/pith-number/WRZREAGOEMIYXCSEDNBEZMJGX6/events.json","paper":"https://pith.science/paper/WRZREAGO"},"agent_actions":{"view_html":"https://pith.science/pith/WRZREAGOEMIYXCSEDNBEZMJGX6","download_json":"https://pith.science/pith/WRZREAGOEMIYXCSEDNBEZMJGX6.json","view_paper":"https://pith.science/paper/WRZREAGO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.8225&json=true","fetch_graph":"https://pith.science/api/pith-number/WRZREAGOEMIYXCSEDNBEZMJGX6/graph.json","fetch_events":"https://pith.science/api/pith-number/WRZREAGOEMIYXCSEDNBEZMJGX6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WRZREAGOEMIYXCSEDNBEZMJGX6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WRZREAGOEMIYXCSEDNBEZMJGX6/action/storage_attestation","attest_author":"https://pith.science/pith/WRZREAGOEMIYXCSEDNBEZMJGX6/action/author_attestation","sign_citation":"https://pith.science/pith/WRZREAGOEMIYXCSEDNBEZMJGX6/action/citation_signature","submit_replication":"https://pith.science/pith/WRZREAGOEMIYXCSEDNBEZMJGX6/action/replication_record"}},"created_at":"2026-05-18T02:30:23.743449+00:00","updated_at":"2026-05-18T02:30:23.743449+00:00"}