{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:3NEEOE7MEK52DXVWGDK532AF6Y","short_pith_number":"pith:3NEEOE7M","schema_version":"1.0","canonical_sha256":"db484713ec22bba1deb630d5dde805f60d6c9a6d29ab870d0f99b7d1b4bbc0a8","source":{"kind":"arxiv","id":"1407.1289","version":3},"attestation_state":"computed","paper":{"title":"Single Pass Spectral Sparsification in Dynamic Streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aaron Sidford, Cameron Musco, Christopher Musco, Michael Kapralov, Yin Tat Lee","submitted_at":"2014-07-04T18:34:03Z","abstract_excerpt":"We present the first single pass algorithm for computing spectral sparsifiers of graphs in the dynamic semi-streaming model. Given a single pass over a stream containing insertions and deletions of edges to a graph G, our algorithm maintains a randomized linear sketch of the incidence matrix of G into dimension O((1/epsilon^2) n polylog(n)). Using this sketch, at any point, the algorithm can output a (1 +/- epsilon) spectral sparsifier for G with high probability.\n  While O((1/epsilon^2) n polylog(n)) space algorithms are known for computing \"cut sparsifiers\" in dynamic streams [AGM12b, GKP12]"},"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":"1407.1289","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-04T18:34:03Z","cross_cats_sorted":[],"title_canon_sha256":"f8984b1c273773caa48e5d92c2192a7e475b2bae216fac559c6b553bb2b5308c","abstract_canon_sha256":"205b76b7577198225df1d6008859eefd9f3717a31ce4a8e26286b006bec779f4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:40.913872Z","signature_b64":"90LY/1kh8TZ7I5zyQaK71JMGbD72/JxXpCcIa2ndonezU053diTjj8xpR+uIq2zSl7Em6Of6EskcaRbJVzWcDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db484713ec22bba1deb630d5dde805f60d6c9a6d29ab870d0f99b7d1b4bbc0a8","last_reissued_at":"2026-05-18T02:18:40.913068Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:40.913068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Single Pass Spectral Sparsification in Dynamic Streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aaron Sidford, Cameron Musco, Christopher Musco, Michael Kapralov, Yin Tat Lee","submitted_at":"2014-07-04T18:34:03Z","abstract_excerpt":"We present the first single pass algorithm for computing spectral sparsifiers of graphs in the dynamic semi-streaming model. Given a single pass over a stream containing insertions and deletions of edges to a graph G, our algorithm maintains a randomized linear sketch of the incidence matrix of G into dimension O((1/epsilon^2) n polylog(n)). Using this sketch, at any point, the algorithm can output a (1 +/- epsilon) spectral sparsifier for G with high probability.\n  While O((1/epsilon^2) n polylog(n)) space algorithms are known for computing \"cut sparsifiers\" in dynamic streams [AGM12b, GKP12]"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.1289","kind":"arxiv","version":3},"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":"1407.1289","created_at":"2026-05-18T02:18:40.913178+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.1289v3","created_at":"2026-05-18T02:18:40.913178+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.1289","created_at":"2026-05-18T02:18:40.913178+00:00"},{"alias_kind":"pith_short_12","alias_value":"3NEEOE7MEK52","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"3NEEOE7MEK52DXVW","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"3NEEOE7M","created_at":"2026-05-18T12:28:11.866339+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.26550","citing_title":"Large-scale semi-supervised learning with online spectral graph sparsification","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3NEEOE7MEK52DXVWGDK532AF6Y","json":"https://pith.science/pith/3NEEOE7MEK52DXVWGDK532AF6Y.json","graph_json":"https://pith.science/api/pith-number/3NEEOE7MEK52DXVWGDK532AF6Y/graph.json","events_json":"https://pith.science/api/pith-number/3NEEOE7MEK52DXVWGDK532AF6Y/events.json","paper":"https://pith.science/paper/3NEEOE7M"},"agent_actions":{"view_html":"https://pith.science/pith/3NEEOE7MEK52DXVWGDK532AF6Y","download_json":"https://pith.science/pith/3NEEOE7MEK52DXVWGDK532AF6Y.json","view_paper":"https://pith.science/paper/3NEEOE7M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.1289&json=true","fetch_graph":"https://pith.science/api/pith-number/3NEEOE7MEK52DXVWGDK532AF6Y/graph.json","fetch_events":"https://pith.science/api/pith-number/3NEEOE7MEK52DXVWGDK532AF6Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3NEEOE7MEK52DXVWGDK532AF6Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3NEEOE7MEK52DXVWGDK532AF6Y/action/storage_attestation","attest_author":"https://pith.science/pith/3NEEOE7MEK52DXVWGDK532AF6Y/action/author_attestation","sign_citation":"https://pith.science/pith/3NEEOE7MEK52DXVWGDK532AF6Y/action/citation_signature","submit_replication":"https://pith.science/pith/3NEEOE7MEK52DXVWGDK532AF6Y/action/replication_record"}},"created_at":"2026-05-18T02:18:40.913178+00:00","updated_at":"2026-05-18T02:18:40.913178+00:00"}