{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:2VN3E73CHW2QLIRTIFSR5ZW6TX","short_pith_number":"pith:2VN3E73C","schema_version":"1.0","canonical_sha256":"d55bb27f623db505a23341651ee6de9dfcc1d62bcce17b78e1444854bfdfd0c5","source":{"kind":"arxiv","id":"1410.4273","version":2},"attestation_state":"computed","paper":{"title":"An Efficient Algorithm for Unweighted Spectral Graph Sparsification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christopher Melgaard, David G. Anderson, Ming Gu","submitted_at":"2014-10-16T01:53:01Z","abstract_excerpt":"Spectral graph sparsification has emerged as a powerful tool in the analysis of large-scale networks by reducing the overall number of edges, while maintaining a comparable graph Laplacian matrix. In this paper, we present an efficient algorithm for the construction of a new type of spectral sparsifier, the unweighted spectral sparsifier. Given a general undirected and unweighted graph $G = (V, E)$ and an integer $\\ell < |E|$ (the number of edges in $E$), we compute an unweighted graph $H = (V, F)$ with $F \\subset E$ and $|F| = \\ell$ such that for every $x \\in \\mathbb{R}^{V}$ \\[ {\\displaystyle"},"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":"1410.4273","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-16T01:53:01Z","cross_cats_sorted":[],"title_canon_sha256":"58e3055912756256fb99c2a7ebeb1c943f87ca06860e1b84c81046920587c9e9","abstract_canon_sha256":"7b46b1d9d2cbfb62017016addeb1f2dce5d826c4c873c51679c6c51199d24ec4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:20.513922Z","signature_b64":"my8bVtDDtGflhynjhk3IFthx4DiLXat42XxuaPn8ofw7WC36IodbhoAuRRsXTOpi/BoAS/PjVdLvQrkBZKtPBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d55bb27f623db505a23341651ee6de9dfcc1d62bcce17b78e1444854bfdfd0c5","last_reissued_at":"2026-05-18T02:31:20.513243Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:20.513243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Efficient Algorithm for Unweighted Spectral Graph Sparsification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christopher Melgaard, David G. Anderson, Ming Gu","submitted_at":"2014-10-16T01:53:01Z","abstract_excerpt":"Spectral graph sparsification has emerged as a powerful tool in the analysis of large-scale networks by reducing the overall number of edges, while maintaining a comparable graph Laplacian matrix. In this paper, we present an efficient algorithm for the construction of a new type of spectral sparsifier, the unweighted spectral sparsifier. Given a general undirected and unweighted graph $G = (V, E)$ and an integer $\\ell < |E|$ (the number of edges in $E$), we compute an unweighted graph $H = (V, F)$ with $F \\subset E$ and $|F| = \\ell$ such that for every $x \\in \\mathbb{R}^{V}$ \\[ {\\displaystyle"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4273","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":"1410.4273","created_at":"2026-05-18T02:31:20.513362+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.4273v2","created_at":"2026-05-18T02:31:20.513362+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4273","created_at":"2026-05-18T02:31:20.513362+00:00"},{"alias_kind":"pith_short_12","alias_value":"2VN3E73CHW2Q","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"2VN3E73CHW2QLIRT","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"2VN3E73C","created_at":"2026-05-18T12:28:11.866339+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/2VN3E73CHW2QLIRTIFSR5ZW6TX","json":"https://pith.science/pith/2VN3E73CHW2QLIRTIFSR5ZW6TX.json","graph_json":"https://pith.science/api/pith-number/2VN3E73CHW2QLIRTIFSR5ZW6TX/graph.json","events_json":"https://pith.science/api/pith-number/2VN3E73CHW2QLIRTIFSR5ZW6TX/events.json","paper":"https://pith.science/paper/2VN3E73C"},"agent_actions":{"view_html":"https://pith.science/pith/2VN3E73CHW2QLIRTIFSR5ZW6TX","download_json":"https://pith.science/pith/2VN3E73CHW2QLIRTIFSR5ZW6TX.json","view_paper":"https://pith.science/paper/2VN3E73C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.4273&json=true","fetch_graph":"https://pith.science/api/pith-number/2VN3E73CHW2QLIRTIFSR5ZW6TX/graph.json","fetch_events":"https://pith.science/api/pith-number/2VN3E73CHW2QLIRTIFSR5ZW6TX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2VN3E73CHW2QLIRTIFSR5ZW6TX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2VN3E73CHW2QLIRTIFSR5ZW6TX/action/storage_attestation","attest_author":"https://pith.science/pith/2VN3E73CHW2QLIRTIFSR5ZW6TX/action/author_attestation","sign_citation":"https://pith.science/pith/2VN3E73CHW2QLIRTIFSR5ZW6TX/action/citation_signature","submit_replication":"https://pith.science/pith/2VN3E73CHW2QLIRTIFSR5ZW6TX/action/replication_record"}},"created_at":"2026-05-18T02:31:20.513362+00:00","updated_at":"2026-05-18T02:31:20.513362+00:00"}